./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml', '-i', '../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G valid-free) )\nCHECK( init(main()), LTL(G valid-deref) )\nCHECK( init(main()), LTL(G valid-memtrack) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105'] 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/forester-heap/dll-rb-cnstr_1-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:40:56,651 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:40:56,732 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-07 16:40:56,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:40:56,736 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:40:56,750 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:40:56,751 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:40:56,751 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:40:56,751 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:40:56,751 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:40:56,751 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:40:56,751 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:40:56,752 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:40:56,752 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:40:56,752 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:40:56,752 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:40:56,752 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:40:56,752 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:40:56,752 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:40:56,752 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:40:56,752 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:40:56,752 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:40:56,753 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 16:40:56,753 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:40:56,753 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:40:56,753 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:40:56,753 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:40:56,753 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:40:56,753 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:40:56,753 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:40:56,753 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:40:56,753 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:40:56,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:40:56,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:40:56,754 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:40:56,754 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:40:56,754 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 16:40:56,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 16:40:56,754 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:40:56,754 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:40:56,754 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:40:56,754 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:40:56,754 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 -> 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 [2024-11-07 16:40:56,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:40:56,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:40:56,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:40:56,972 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:40:56,972 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:40:56,974 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2024-11-07 16:40:58,116 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:40:58,394 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:40:58,394 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2024-11-07 16:40:58,405 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef0a3fcd6/85dcb51892ca4545a288319a0a7acf3e/FLAG0b03cdf49 [2024-11-07 16:40:58,685 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef0a3fcd6/85dcb51892ca4545a288319a0a7acf3e [2024-11-07 16:40:58,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:40:58,689 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:40:58,690 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:40:58,690 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:40:58,693 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:40:58,693 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:40:58" (1/1) ... [2024-11-07 16:40:58,694 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26c0994c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:58, skipping insertion in model container [2024-11-07 16:40:58,694 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:40:58" (1/1) ... [2024-11-07 16:40:58,721 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:40:58,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:40:58,916 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:40:58,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:40:58,972 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:40:58,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:58 WrapperNode [2024-11-07 16:40:58,974 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:40:58,975 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:40:58,975 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:40:58,975 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:40:58,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:58" (1/1) ... [2024-11-07 16:40:58,992 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:58" (1/1) ... [2024-11-07 16:40:59,009 INFO L138 Inliner]: procedures = 119, calls = 46, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 160 [2024-11-07 16:40:59,011 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:40:59,012 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:40:59,013 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:40:59,013 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:40:59,018 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:58" (1/1) ... [2024-11-07 16:40:59,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:58" (1/1) ... [2024-11-07 16:40:59,021 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:58" (1/1) ... [2024-11-07 16:40:59,040 INFO L175 MemorySlicer]: Split 29 memory accesses to 2 slices as follows [2, 27]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 12 writes are split as follows [0, 12]. [2024-11-07 16:40:59,043 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:58" (1/1) ... [2024-11-07 16:40:59,043 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:58" (1/1) ... [2024-11-07 16:40:59,052 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:58" (1/1) ... [2024-11-07 16:40:59,055 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:58" (1/1) ... [2024-11-07 16:40:59,058 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:58" (1/1) ... [2024-11-07 16:40:59,059 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:58" (1/1) ... [2024-11-07 16:40:59,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:40:59,061 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:40:59,061 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:40:59,061 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:40:59,066 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:58" (1/1) ... [2024-11-07 16:40:59,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:40:59,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:40:59,093 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 16:40:59,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 16:40:59,128 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-07 16:40:59,128 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-07 16:40:59,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 16:40:59,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 16:40:59,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 16:40:59,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 16:40:59,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 16:40:59,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 16:40:59,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 16:40:59,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 16:40:59,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 16:40:59,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 16:40:59,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 16:40:59,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 16:40:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 16:40:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:40:59,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:40:59,219 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:40:59,221 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:40:59,507 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-11-07 16:40:59,507 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:40:59,519 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:40:59,520 INFO L316 CfgBuilder]: Removed 17 assume(true) statements. [2024-11-07 16:40:59,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:40:59 BoogieIcfgContainer [2024-11-07 16:40:59,521 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:40:59,523 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:40:59,523 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:40:59,527 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:40:59,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:40:58" (1/3) ... [2024-11-07 16:40:59,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a5b1d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:40:59, skipping insertion in model container [2024-11-07 16:40:59,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:58" (2/3) ... [2024-11-07 16:40:59,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a5b1d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:40:59, skipping insertion in model container [2024-11-07 16:40:59,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:40:59" (3/3) ... [2024-11-07 16:40:59,528 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-1.i [2024-11-07 16:40:59,539 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:40:59,539 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2024-11-07 16:40:59,572 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:40:59,581 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;@16fc1a15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:40:59,581 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2024-11-07 16:40:59,586 INFO L276 IsEmpty]: Start isEmpty. Operand has 161 states, 87 states have (on average 2.103448275862069) internal successors, (183), 152 states have internal predecessors, (183), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 16:40:59,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-07 16:40:59,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:40:59,591 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-07 16:40:59,591 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-07 16:40:59,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:40:59,595 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2024-11-07 16:40:59,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:40:59,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633391491] [2024-11-07 16:40:59,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:59,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:40:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:59,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:40:59,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:40:59,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633391491] [2024-11-07 16:40:59,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633391491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:40:59,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:40:59,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:40:59,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346729761] [2024-11-07 16:40:59,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:40:59,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:40:59,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:40:59,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:40:59,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:40:59,766 INFO L87 Difference]: Start difference. First operand has 161 states, 87 states have (on average 2.103448275862069) internal successors, (183), 152 states have internal predecessors, (183), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:40:59,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:40:59,911 INFO L93 Difference]: Finished difference Result 147 states and 160 transitions. [2024-11-07 16:40:59,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:40:59,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-07 16:40:59,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:40:59,917 INFO L225 Difference]: With dead ends: 147 [2024-11-07 16:40:59,917 INFO L226 Difference]: Without dead ends: 145 [2024-11-07 16:40:59,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:40:59,921 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 117 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:40:59,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 101 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:40:59,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-07 16:40:59,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-07 16:40:59,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 80 states have (on average 1.8875) internal successors, (151), 143 states have internal predecessors, (151), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:40:59,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2024-11-07 16:40:59,957 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 3 [2024-11-07 16:40:59,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:40:59,958 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2024-11-07 16:40:59,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:40:59,959 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2024-11-07 16:40:59,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-07 16:40:59,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:40:59,959 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-07 16:40:59,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 16:40:59,959 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-07 16:40:59,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:40:59,960 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2024-11-07 16:40:59,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:40:59,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652909313] [2024-11-07 16:40:59,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:59,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:40:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:00,045 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:41:00,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:41:00,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652909313] [2024-11-07 16:41:00,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652909313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:41:00,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:41:00,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:41:00,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326008726] [2024-11-07 16:41:00,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:41:00,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:41:00,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:41:00,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:41:00,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:41:00,047 INFO L87 Difference]: Start difference. First operand 145 states and 158 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:41:00,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:41:00,155 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2024-11-07 16:41:00,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:41:00,155 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:41:00,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:41:00,156 INFO L225 Difference]: With dead ends: 149 [2024-11-07 16:41:00,157 INFO L226 Difference]: Without dead ends: 149 [2024-11-07 16:41:00,157 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:41:00,158 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 111 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:41:00,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 112 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:41:00,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-07 16:41:00,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-07 16:41:00,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 87 states have (on average 1.7816091954022988) internal successors, (155), 147 states have internal predecessors, (155), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:00,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 162 transitions. [2024-11-07 16:41:00,169 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 162 transitions. Word has length 3 [2024-11-07 16:41:00,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:41:00,169 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 162 transitions. [2024-11-07 16:41:00,169 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:41:00,169 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 162 transitions. [2024-11-07 16:41:00,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 16:41:00,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:41:00,170 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:41:00,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 16:41:00,170 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-07 16:41:00,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:41:00,170 INFO L85 PathProgramCache]: Analyzing trace with hash 919164531, now seen corresponding path program 1 times [2024-11-07 16:41:00,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:41:00,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997802347] [2024-11-07 16:41:00,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:00,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:41:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:00,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:41:00,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:41:00,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997802347] [2024-11-07 16:41:00,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997802347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:41:00,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:41:00,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:41:00,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135965988] [2024-11-07 16:41:00,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:41:00,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:41:00,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:41:00,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:41:00,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:41:00,368 INFO L87 Difference]: Start difference. First operand 149 states and 162 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:00,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:41:00,508 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2024-11-07 16:41:00,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:41:00,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-07 16:41:00,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:41:00,510 INFO L225 Difference]: With dead ends: 136 [2024-11-07 16:41:00,510 INFO L226 Difference]: Without dead ends: 136 [2024-11-07 16:41:00,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:41:00,510 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 154 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:41:00,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 83 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:41:00,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-07 16:41:00,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-07 16:41:00,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 89 states have (on average 1.6179775280898876) internal successors, (144), 134 states have internal predecessors, (144), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:00,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 151 transitions. [2024-11-07 16:41:00,515 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 151 transitions. Word has length 9 [2024-11-07 16:41:00,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:41:00,515 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 151 transitions. [2024-11-07 16:41:00,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:00,515 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 151 transitions. [2024-11-07 16:41:00,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 16:41:00,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:41:00,516 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:41:00,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 16:41:00,516 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-07 16:41:00,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:41:00,516 INFO L85 PathProgramCache]: Analyzing trace with hash 919164532, now seen corresponding path program 1 times [2024-11-07 16:41:00,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:41:00,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949552799] [2024-11-07 16:41:00,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:00,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:41:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:00,741 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:41:00,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:41:00,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949552799] [2024-11-07 16:41:00,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949552799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:41:00,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:41:00,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:41:00,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598671563] [2024-11-07 16:41:00,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:41:00,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:41:00,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:41:00,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:41:00,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:41:00,743 INFO L87 Difference]: Start difference. First operand 136 states and 151 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:00,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:41:00,984 INFO L93 Difference]: Finished difference Result 149 states and 165 transitions. [2024-11-07 16:41:00,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:41:00,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-07 16:41:00,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:41:00,985 INFO L225 Difference]: With dead ends: 149 [2024-11-07 16:41:00,985 INFO L226 Difference]: Without dead ends: 149 [2024-11-07 16:41:00,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:41:00,985 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 241 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:41:00,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 157 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:41:00,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-07 16:41:00,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2024-11-07 16:41:00,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 100 states have (on average 1.57) internal successors, (157), 144 states have internal predecessors, (157), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:00,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 164 transitions. [2024-11-07 16:41:00,998 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 164 transitions. Word has length 9 [2024-11-07 16:41:00,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:41:00,998 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 164 transitions. [2024-11-07 16:41:00,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:00,998 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 164 transitions. [2024-11-07 16:41:00,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 16:41:00,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:41:00,998 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:41:00,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 16:41:00,999 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-07 16:41:01,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:41:01,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1871491110, now seen corresponding path program 1 times [2024-11-07 16:41:01,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:41:01,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288147442] [2024-11-07 16:41:01,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:01,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:41:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:01,057 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:41:01,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:41:01,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288147442] [2024-11-07 16:41:01,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288147442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:41:01,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:41:01,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:41:01,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925426472] [2024-11-07 16:41:01,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:41:01,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:41:01,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:41:01,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:41:01,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:41:01,061 INFO L87 Difference]: Start difference. First operand 146 states and 164 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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:41:01,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:41:01,176 INFO L93 Difference]: Finished difference Result 152 states and 167 transitions. [2024-11-07 16:41:01,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:41:01,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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:41:01,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:41:01,177 INFO L225 Difference]: With dead ends: 152 [2024-11-07 16:41:01,177 INFO L226 Difference]: Without dead ends: 152 [2024-11-07 16:41:01,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:41:01,178 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 131 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:41:01,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 188 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:41:01,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-07 16:41:01,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 145. [2024-11-07 16:41:01,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 100 states have (on average 1.54) internal successors, (154), 143 states have internal predecessors, (154), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:01,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 160 transitions. [2024-11-07 16:41:01,183 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 160 transitions. Word has length 13 [2024-11-07 16:41:01,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:41:01,183 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 160 transitions. [2024-11-07 16:41:01,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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:41:01,183 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 160 transitions. [2024-11-07 16:41:01,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 16:41:01,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:41:01,183 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:41:01,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 16:41:01,184 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-07 16:41:01,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:41:01,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1880931275, now seen corresponding path program 1 times [2024-11-07 16:41:01,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:41:01,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041151881] [2024-11-07 16:41:01,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:01,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:41:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:01,264 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:41:01,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:41:01,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041151881] [2024-11-07 16:41:01,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041151881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:41:01,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:41:01,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:41:01,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912227262] [2024-11-07 16:41:01,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:41:01,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:41:01,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:41:01,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:41:01,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:41:01,266 INFO L87 Difference]: Start difference. First operand 145 states and 160 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:01,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:41:01,379 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2024-11-07 16:41:01,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:41:01,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-07 16:41:01,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:41:01,380 INFO L225 Difference]: With dead ends: 144 [2024-11-07 16:41:01,380 INFO L226 Difference]: Without dead ends: 144 [2024-11-07 16:41:01,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:41:01,381 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 4 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:41:01,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 346 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:41:01,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-07 16:41:01,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-07 16:41:01,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 100 states have (on average 1.52) internal successors, (152), 142 states have internal predecessors, (152), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:01,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 158 transitions. [2024-11-07 16:41:01,386 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 158 transitions. Word has length 12 [2024-11-07 16:41:01,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:41:01,386 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 158 transitions. [2024-11-07 16:41:01,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:01,387 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 158 transitions. [2024-11-07 16:41:01,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 16:41:01,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:41:01,387 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:41:01,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 16:41:01,387 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-07 16:41:01,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:41:01,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1880931274, now seen corresponding path program 1 times [2024-11-07 16:41:01,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:41:01,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853478555] [2024-11-07 16:41:01,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:01,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:41:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:01,534 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:41:01,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:41:01,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853478555] [2024-11-07 16:41:01,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853478555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:41:01,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:41:01,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:41:01,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842664591] [2024-11-07 16:41:01,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:41:01,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:41:01,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:41:01,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:41:01,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:41:01,536 INFO L87 Difference]: Start difference. First operand 144 states and 158 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:01,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:41:01,678 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2024-11-07 16:41:01,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:41:01,679 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-07 16:41:01,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:41:01,679 INFO L225 Difference]: With dead ends: 143 [2024-11-07 16:41:01,679 INFO L226 Difference]: Without dead ends: 143 [2024-11-07 16:41:01,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:41:01,680 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 2 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:41:01,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 331 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:41:01,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-07 16:41:01,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-11-07 16:41:01,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 100 states have (on average 1.5) internal successors, (150), 141 states have internal predecessors, (150), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:01,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 156 transitions. [2024-11-07 16:41:01,684 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 156 transitions. Word has length 12 [2024-11-07 16:41:01,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:41:01,684 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 156 transitions. [2024-11-07 16:41:01,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:01,684 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2024-11-07 16:41:01,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 16:41:01,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:41:01,685 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:41:01,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 16:41:01,685 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-07 16:41:01,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:41:01,686 INFO L85 PathProgramCache]: Analyzing trace with hash -25570964, now seen corresponding path program 1 times [2024-11-07 16:41:01,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:41:01,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624444492] [2024-11-07 16:41:01,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:01,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:41:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:01,767 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:41:01,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:41:01,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624444492] [2024-11-07 16:41:01,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624444492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:41:01,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:41:01,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:41:01,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454543187] [2024-11-07 16:41:01,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:41:01,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:41:01,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:41:01,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:41:01,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:41:01,769 INFO L87 Difference]: Start difference. First operand 143 states and 156 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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:41:01,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:41:01,912 INFO L93 Difference]: Finished difference Result 183 states and 202 transitions. [2024-11-07 16:41:01,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:41:01,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 16 [2024-11-07 16:41:01,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:41:01,914 INFO L225 Difference]: With dead ends: 183 [2024-11-07 16:41:01,914 INFO L226 Difference]: Without dead ends: 183 [2024-11-07 16:41:01,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:41:01,914 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 204 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:41:01,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 334 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:41:01,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-07 16:41:01,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 148. [2024-11-07 16:41:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 105 states have (on average 1.4761904761904763) internal successors, (155), 146 states have internal predecessors, (155), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:01,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 161 transitions. [2024-11-07 16:41:01,918 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 161 transitions. Word has length 16 [2024-11-07 16:41:01,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:41:01,918 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 161 transitions. [2024-11-07 16:41:01,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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:41:01,919 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 161 transitions. [2024-11-07 16:41:01,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 16:41:01,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:41:01,919 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:41:01,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 16:41:01,919 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-07 16:41:01,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:41:01,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1483618057, now seen corresponding path program 1 times [2024-11-07 16:41:01,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:41:01,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305302993] [2024-11-07 16:41:01,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:01,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:41:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:02,114 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:41:02,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:41:02,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305302993] [2024-11-07 16:41:02,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305302993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:41:02,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:41:02,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 16:41:02,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028778499] [2024-11-07 16:41:02,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:41:02,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:41:02,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:41:02,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:41:02,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:41:02,119 INFO L87 Difference]: Start difference. First operand 148 states and 161 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:02,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:41:02,471 INFO L93 Difference]: Finished difference Result 147 states and 160 transitions. [2024-11-07 16:41:02,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:41:02,471 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-07 16:41:02,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:41:02,472 INFO L225 Difference]: With dead ends: 147 [2024-11-07 16:41:02,472 INFO L226 Difference]: Without dead ends: 147 [2024-11-07 16:41:02,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-07 16:41:02,473 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 147 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:41:02,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 288 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:41:02,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-07 16:41:02,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-07 16:41:02,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 105 states have (on average 1.4666666666666666) internal successors, (154), 145 states have internal predecessors, (154), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:02,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 160 transitions. [2024-11-07 16:41:02,477 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 160 transitions. Word has length 16 [2024-11-07 16:41:02,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:41:02,477 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 160 transitions. [2024-11-07 16:41:02,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:02,477 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 160 transitions. [2024-11-07 16:41:02,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 16:41:02,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:41:02,478 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:41:02,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 16:41:02,478 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-07 16:41:02,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:41:02,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1483618056, now seen corresponding path program 1 times [2024-11-07 16:41:02,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:41:02,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542334602] [2024-11-07 16:41:02,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:02,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:41:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:02,712 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:41:02,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:41:02,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542334602] [2024-11-07 16:41:02,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542334602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:41:02,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:41:02,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 16:41:02,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927792558] [2024-11-07 16:41:02,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:41:02,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 16:41:02,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:41:02,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 16:41:02,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:41:02,714 INFO L87 Difference]: Start difference. First operand 147 states and 160 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:03,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:41:03,047 INFO L93 Difference]: Finished difference Result 161 states and 178 transitions. [2024-11-07 16:41:03,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 16:41:03,048 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-07 16:41:03,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:41:03,048 INFO L225 Difference]: With dead ends: 161 [2024-11-07 16:41:03,048 INFO L226 Difference]: Without dead ends: 161 [2024-11-07 16:41:03,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-11-07 16:41:03,049 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 193 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:41:03,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 270 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:41:03,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-07 16:41:03,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 151. [2024-11-07 16:41:03,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 149 states have internal predecessors, (162), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:03,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 168 transitions. [2024-11-07 16:41:03,052 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 168 transitions. Word has length 16 [2024-11-07 16:41:03,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:41:03,052 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 168 transitions. [2024-11-07 16:41:03,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:03,052 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 168 transitions. [2024-11-07 16:41:03,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-07 16:41:03,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:41:03,053 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:41:03,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 16:41:03,053 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-07 16:41:03,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:41:03,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1685995508, now seen corresponding path program 1 times [2024-11-07 16:41:03,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:41:03,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062971380] [2024-11-07 16:41:03,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:03,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:41:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:03,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:41:03,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:41:03,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062971380] [2024-11-07 16:41:03,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062971380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:41:03,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680969629] [2024-11-07 16:41:03,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:03,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:41:03,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:41:03,188 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:41:03,189 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:41:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:03,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-07 16:41:03,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:41:03,303 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:41:03,306 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:41:03,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-07 16:41:03,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-07 16:41:03,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-07 16:41:03,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-07 16:41:03,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:41:03,468 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:41:03,697 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 10 treesize of output 8 [2024-11-07 16:41:03,705 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 14 treesize of output 12 [2024-11-07 16:41:03,718 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 10 treesize of output 8 [2024-11-07 16:41:03,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:41:03,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:41:03,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680969629] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:41:03,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:41:03,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 13 [2024-11-07 16:41:03,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041436445] [2024-11-07 16:41:03,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:41:03,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 16:41:03,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:41:03,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 16:41:03,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:41:03,737 INFO L87 Difference]: Start difference. First operand 151 states and 168 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 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:41:04,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:41:04,074 INFO L93 Difference]: Finished difference Result 189 states and 212 transitions. [2024-11-07 16:41:04,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 16:41:04,074 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-07 16:41:04,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:41:04,075 INFO L225 Difference]: With dead ends: 189 [2024-11-07 16:41:04,075 INFO L226 Difference]: Without dead ends: 189 [2024-11-07 16:41:04,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2024-11-07 16:41:04,076 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 331 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:41:04,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 539 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:41:04,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-07 16:41:04,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 158. [2024-11-07 16:41:04,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 122 states have (on average 1.3934426229508197) internal successors, (170), 156 states have internal predecessors, (170), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:04,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 176 transitions. [2024-11-07 16:41:04,080 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 176 transitions. Word has length 21 [2024-11-07 16:41:04,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:41:04,080 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 176 transitions. [2024-11-07 16:41:04,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 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:41:04,080 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 176 transitions. [2024-11-07 16:41:04,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-07 16:41:04,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:41:04,081 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:41:04,095 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:41:04,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-07 16:41:04,286 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-07 16:41:04,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:41:04,286 INFO L85 PathProgramCache]: Analyzing trace with hash -576308362, now seen corresponding path program 1 times [2024-11-07 16:41:04,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:41:04,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870387912] [2024-11-07 16:41:04,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:04,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:41:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:04,331 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:41:04,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:41:04,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870387912] [2024-11-07 16:41:04,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870387912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:41:04,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:41:04,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:41:04,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954575301] [2024-11-07 16:41:04,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:41:04,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:41:04,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:41:04,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:41:04,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:41:04,332 INFO L87 Difference]: Start difference. First operand 158 states and 176 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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:41:04,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:41:04,438 INFO L93 Difference]: Finished difference Result 161 states and 177 transitions. [2024-11-07 16:41:04,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:41:04,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-11-07 16:41:04,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:41:04,439 INFO L225 Difference]: With dead ends: 161 [2024-11-07 16:41:04,439 INFO L226 Difference]: Without dead ends: 161 [2024-11-07 16:41:04,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:41:04,440 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 18 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:41:04,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 335 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:41:04,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-07 16:41:04,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2024-11-07 16:41:04,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 121 states have (on average 1.3801652892561984) internal successors, (167), 155 states have internal predecessors, (167), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:04,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 173 transitions. [2024-11-07 16:41:04,442 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 173 transitions. Word has length 22 [2024-11-07 16:41:04,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:41:04,443 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 173 transitions. [2024-11-07 16:41:04,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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:41:04,443 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 173 transitions. [2024-11-07 16:41:04,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 16:41:04,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:41:04,443 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:41:04,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 16:41:04,443 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-07 16:41:04,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:41:04,444 INFO L85 PathProgramCache]: Analyzing trace with hash 365917424, now seen corresponding path program 1 times [2024-11-07 16:41:04,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:41:04,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191593011] [2024-11-07 16:41:04,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:04,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:41:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:04,501 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:41:04,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:41:04,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191593011] [2024-11-07 16:41:04,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191593011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:41:04,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:41:04,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:41:04,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826186392] [2024-11-07 16:41:04,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:41:04,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:41:04,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:41:04,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:41:04,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:41:04,503 INFO L87 Difference]: Start difference. First operand 157 states and 173 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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:41:04,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:41:04,572 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2024-11-07 16:41:04,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:41:04,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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:41:04,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:41:04,573 INFO L225 Difference]: With dead ends: 160 [2024-11-07 16:41:04,573 INFO L226 Difference]: Without dead ends: 160 [2024-11-07 16:41:04,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:41:04,574 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 15 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:41:04,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 286 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:41:04,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-07 16:41:04,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2024-11-07 16:41:04,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 121 states have (on average 1.3636363636363635) internal successors, (165), 154 states have internal predecessors, (165), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:04,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2024-11-07 16:41:04,576 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 24 [2024-11-07 16:41:04,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:41:04,577 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2024-11-07 16:41:04,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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:41:04,577 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2024-11-07 16:41:04,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 16:41:04,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:41:04,577 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:41:04,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 16:41:04,577 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-07 16:41:04,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:41:04,578 INFO L85 PathProgramCache]: Analyzing trace with hash 627434664, now seen corresponding path program 1 times [2024-11-07 16:41:04,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:41:04,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377245838] [2024-11-07 16:41:04,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:04,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:41:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:04,644 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:41:04,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:41:04,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377245838] [2024-11-07 16:41:04,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377245838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:41:04,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:41:04,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:41:04,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675583304] [2024-11-07 16:41:04,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:41:04,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:41:04,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:41:04,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:41:04,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:41:04,645 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:04,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:41:04,741 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2024-11-07 16:41:04,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:41:04,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-07 16:41:04,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:41:04,742 INFO L225 Difference]: With dead ends: 155 [2024-11-07 16:41:04,742 INFO L226 Difference]: Without dead ends: 155 [2024-11-07 16:41:04,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:41:04,742 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 3 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:41:04,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 321 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:41:04,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-07 16:41:04,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-07 16:41:04,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 121 states have (on average 1.3553719008264462) internal successors, (164), 153 states have internal predecessors, (164), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:04,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 169 transitions. [2024-11-07 16:41:04,745 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 169 transitions. Word has length 24 [2024-11-07 16:41:04,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:41:04,745 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 169 transitions. [2024-11-07 16:41:04,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:04,746 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 169 transitions. [2024-11-07 16:41:04,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 16:41:04,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:41:04,746 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:41:04,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 16:41:04,746 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-07 16:41:04,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:41:04,747 INFO L85 PathProgramCache]: Analyzing trace with hash 627434665, now seen corresponding path program 1 times [2024-11-07 16:41:04,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:41:04,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072814635] [2024-11-07 16:41:04,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:04,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:41:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:04,863 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:41:04,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:41:04,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072814635] [2024-11-07 16:41:04,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072814635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:41:04,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:41:04,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:41:04,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383950639] [2024-11-07 16:41:04,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:41:04,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:41:04,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:41:04,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:41:04,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:41:04,864 INFO L87 Difference]: Start difference. First operand 155 states and 169 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:04,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:41:04,970 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2024-11-07 16:41:04,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:41:04,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-07 16:41:04,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:41:04,971 INFO L225 Difference]: With dead ends: 154 [2024-11-07 16:41:04,971 INFO L226 Difference]: Without dead ends: 154 [2024-11-07 16:41:04,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:41:04,971 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 1 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:41:04,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 311 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:41:04,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-07 16:41:04,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-07 16:41:04,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 121 states have (on average 1.3471074380165289) internal successors, (163), 152 states have internal predecessors, (163), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:04,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 168 transitions. [2024-11-07 16:41:04,974 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 168 transitions. Word has length 24 [2024-11-07 16:41:04,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:41:04,974 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 168 transitions. [2024-11-07 16:41:04,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:04,974 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions. [2024-11-07 16:41:04,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-07 16:41:04,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:41:04,974 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:41:04,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 16:41:04,975 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-07 16:41:04,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:41:04,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1801374639, now seen corresponding path program 1 times [2024-11-07 16:41:04,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:41:04,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739059492] [2024-11-07 16:41:04,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:04,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:41:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:05,106 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:41:05,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:41:05,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739059492] [2024-11-07 16:41:05,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739059492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:41:05,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:41:05,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:41:05,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168728572] [2024-11-07 16:41:05,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:41:05,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:41:05,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:41:05,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:41:05,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:41:05,108 INFO L87 Difference]: Start difference. First operand 154 states and 168 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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:41:05,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:41:05,200 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2024-11-07 16:41:05,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:41:05,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 27 [2024-11-07 16:41:05,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:41:05,202 INFO L225 Difference]: With dead ends: 154 [2024-11-07 16:41:05,202 INFO L226 Difference]: Without dead ends: 154 [2024-11-07 16:41:05,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:41:05,203 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 11 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:41:05,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 261 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:41:05,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-07 16:41:05,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2024-11-07 16:41:05,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 121 states have (on average 1.3305785123966942) internal successors, (161), 151 states have internal predecessors, (161), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:05,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2024-11-07 16:41:05,206 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 27 [2024-11-07 16:41:05,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:41:05,207 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2024-11-07 16:41:05,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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:41:05,207 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2024-11-07 16:41:05,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-07 16:41:05,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:41:05,209 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:41:05,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 16:41:05,209 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-07 16:41:05,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:41:05,210 INFO L85 PathProgramCache]: Analyzing trace with hash -754420961, now seen corresponding path program 1 times [2024-11-07 16:41:05,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:41:05,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092397291] [2024-11-07 16:41:05,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:05,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:41:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:05,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:41:05,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:41:05,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092397291] [2024-11-07 16:41:05,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092397291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:41:05,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:41:05,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:41:05,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278300821] [2024-11-07 16:41:05,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:41:05,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:41:05,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:41:05,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:41:05,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:41:05,244 INFO L87 Difference]: Start difference. First operand 153 states and 165 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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:41:05,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:41:05,278 INFO L93 Difference]: Finished difference Result 155 states and 167 transitions. [2024-11-07 16:41:05,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:41:05,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-07 16:41:05,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:41:05,280 INFO L225 Difference]: With dead ends: 155 [2024-11-07 16:41:05,280 INFO L226 Difference]: Without dead ends: 155 [2024-11-07 16:41:05,280 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:41:05,281 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 64 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:41:05,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 121 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:41:05,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-07 16:41:05,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-07 16:41:05,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 123 states have (on average 1.3252032520325203) internal successors, (163), 153 states have internal predecessors, (163), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:05,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 167 transitions. [2024-11-07 16:41:05,287 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 167 transitions. Word has length 27 [2024-11-07 16:41:05,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:41:05,288 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 167 transitions. [2024-11-07 16:41:05,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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:41:05,288 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 167 transitions. [2024-11-07 16:41:05,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 16:41:05,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:41:05,288 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] [2024-11-07 16:41:05,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 16:41:05,289 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-07 16:41:05,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:41:05,289 INFO L85 PathProgramCache]: Analyzing trace with hash -303373466, now seen corresponding path program 1 times [2024-11-07 16:41:05,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:41:05,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460080952] [2024-11-07 16:41:05,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:05,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:41:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:05,394 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:41:05,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:41:05,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460080952] [2024-11-07 16:41:05,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460080952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:41:05,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:41:05,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:41:05,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079934759] [2024-11-07 16:41:05,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:41:05,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:41:05,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:41:05,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:41:05,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:41:05,396 INFO L87 Difference]: Start difference. First operand 155 states and 167 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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:41:05,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:41:05,515 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2024-11-07 16:41:05,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:41:05,515 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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 29 [2024-11-07 16:41:05,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:41:05,516 INFO L225 Difference]: With dead ends: 155 [2024-11-07 16:41:05,516 INFO L226 Difference]: Without dead ends: 155 [2024-11-07 16:41:05,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:41:05,516 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 176 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:41:05,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 157 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:41:05,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-07 16:41:05,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2024-11-07 16:41:05,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 152 states have internal predecessors, (161), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:05,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 164 transitions. [2024-11-07 16:41:05,522 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 164 transitions. Word has length 29 [2024-11-07 16:41:05,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:41:05,522 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 164 transitions. [2024-11-07 16:41:05,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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:41:05,522 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 164 transitions. [2024-11-07 16:41:05,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 16:41:05,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:41:05,522 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:41:05,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 16:41:05,523 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-07 16:41:05,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:41:05,523 INFO L85 PathProgramCache]: Analyzing trace with hash -2128115797, now seen corresponding path program 1 times [2024-11-07 16:41:05,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:41:05,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114242499] [2024-11-07 16:41:05,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:05,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:41:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:05,778 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:41:05,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:41:05,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114242499] [2024-11-07 16:41:05,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114242499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:41:05,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:41:05,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 16:41:05,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750729734] [2024-11-07 16:41:05,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:41:05,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:41:05,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:41:05,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:41:05,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:41:05,780 INFO L87 Difference]: Start difference. First operand 154 states and 164 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 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:41:06,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:41:06,075 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2024-11-07 16:41:06,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:41:06,075 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-07 16:41:06,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:41:06,076 INFO L225 Difference]: With dead ends: 149 [2024-11-07 16:41:06,076 INFO L226 Difference]: Without dead ends: 149 [2024-11-07 16:41:06,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:41:06,077 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 55 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:41:06,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 467 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:41:06,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-07 16:41:06,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 131. [2024-11-07 16:41:06,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 107 states have (on average 1.280373831775701) internal successors, (137), 129 states have internal predecessors, (137), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:06,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2024-11-07 16:41:06,080 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 28 [2024-11-07 16:41:06,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:41:06,080 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2024-11-07 16:41:06,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 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:41:06,080 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2024-11-07 16:41:06,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 16:41:06,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:41:06,081 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:41:06,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 16:41:06,081 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-07 16:41:06,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:41:06,081 INFO L85 PathProgramCache]: Analyzing trace with hash -2128115798, now seen corresponding path program 1 times [2024-11-07 16:41:06,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:41:06,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679932625] [2024-11-07 16:41:06,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:06,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:41:06,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:06,240 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:41:06,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:41:06,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679932625] [2024-11-07 16:41:06,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679932625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:41:06,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:41:06,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 16:41:06,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950158067] [2024-11-07 16:41:06,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:41:06,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:41:06,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:41:06,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:41:06,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:41:06,243 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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:41:06,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:41:06,390 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2024-11-07 16:41:06,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:41:06,391 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-07 16:41:06,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:41:06,391 INFO L225 Difference]: With dead ends: 131 [2024-11-07 16:41:06,391 INFO L226 Difference]: Without dead ends: 131 [2024-11-07 16:41:06,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:41:06,392 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 39 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:41:06,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 264 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:41:06,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-07 16:41:06,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-11-07 16:41:06,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 107 states have (on average 1.2710280373831775) internal successors, (136), 128 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:06,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2024-11-07 16:41:06,394 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 28 [2024-11-07 16:41:06,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:41:06,395 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2024-11-07 16:41:06,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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:41:06,395 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2024-11-07 16:41:06,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 16:41:06,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:41:06,397 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] [2024-11-07 16:41:06,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 16:41:06,397 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-07 16:41:06,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:41:06,398 INFO L85 PathProgramCache]: Analyzing trace with hash 850939202, now seen corresponding path program 1 times [2024-11-07 16:41:06,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:41:06,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272967025] [2024-11-07 16:41:06,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:06,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:41:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:06,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:41:06,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:41:06,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272967025] [2024-11-07 16:41:06,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272967025] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:41:06,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570114954] [2024-11-07 16:41:06,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:06,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:41:06,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:41:06,480 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:41:06,481 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:41:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:06,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 16:41:06,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:41:06,564 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:41:06,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:41:06,594 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:41:06,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570114954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:41:06,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 16:41:06,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2024-11-07 16:41:06,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449318789] [2024-11-07 16:41:06,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:41:06,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:41:06,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:41:06,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:41:06,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:41:06,595 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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:41:06,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:41:06,645 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2024-11-07 16:41:06,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:41:06,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-11-07 16:41:06,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:41:06,646 INFO L225 Difference]: With dead ends: 137 [2024-11-07 16:41:06,646 INFO L226 Difference]: Without dead ends: 137 [2024-11-07 16:41:06,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:41:06,647 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 5 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:41:06,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 263 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:41:06,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-07 16:41:06,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2024-11-07 16:41:06,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 110 states have (on average 1.2636363636363637) internal successors, (139), 131 states have internal predecessors, (139), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:06,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2024-11-07 16:41:06,650 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 29 [2024-11-07 16:41:06,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:41:06,650 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2024-11-07 16:41:06,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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:41:06,650 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2024-11-07 16:41:06,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-07 16:41:06,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:41:06,651 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:41:06,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 16:41:06,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:41:06,852 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-07 16:41:06,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:41:06,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1002487277, now seen corresponding path program 1 times [2024-11-07 16:41:06,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:41:06,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875431364] [2024-11-07 16:41:06,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:06,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:41:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:07,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:41:07,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:41:07,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875431364] [2024-11-07 16:41:07,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875431364] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:41:07,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828749881] [2024-11-07 16:41:07,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:07,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:41:07,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:41:07,004 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:41:07,006 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:41:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:07,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-07 16:41:07,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:41:07,089 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:41:07,093 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:41:07,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-07 16:41:07,102 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:41:07,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:41:07,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2024-11-07 16:41:07,132 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:41:07,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:41:07,230 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:41:07,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:41:07,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828749881] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:41:07,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:41:07,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 10 [2024-11-07 16:41:07,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872952795] [2024-11-07 16:41:07,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:41:07,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 16:41:07,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:41:07,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 16:41:07,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:41:07,298 INFO L87 Difference]: Start difference. First operand 133 states and 142 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 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:41:07,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:41:07,584 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2024-11-07 16:41:07,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 16:41:07,586 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 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 30 [2024-11-07 16:41:07,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:41:07,587 INFO L225 Difference]: With dead ends: 155 [2024-11-07 16:41:07,587 INFO L226 Difference]: Without dead ends: 155 [2024-11-07 16:41:07,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-11-07 16:41:07,588 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 19 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:41:07,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 464 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:41:07,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-07 16:41:07,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2024-11-07 16:41:07,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 121 states have (on average 1.256198347107438) internal successors, (152), 142 states have internal predecessors, (152), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:07,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 155 transitions. [2024-11-07 16:41:07,591 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 155 transitions. Word has length 30 [2024-11-07 16:41:07,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:41:07,592 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 155 transitions. [2024-11-07 16:41:07,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 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:41:07,592 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2024-11-07 16:41:07,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-07 16:41:07,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:41:07,592 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:41:07,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-07 16:41:07,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:41:07,796 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-07 16:41:07,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:41:07,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1012334864, now seen corresponding path program 1 times [2024-11-07 16:41:07,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:41:07,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614588265] [2024-11-07 16:41:07,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:07,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:41:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:07,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:41:07,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:41:07,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614588265] [2024-11-07 16:41:07,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614588265] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:41:07,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211519962] [2024-11-07 16:41:07,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:07,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:41:07,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:41:07,868 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:41:07,868 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:41:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:07,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 16:41:07,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:41:07,987 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 13 treesize of output 9 [2024-11-07 16:41:08,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:41:08,000 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:41:08,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:41:08,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211519962] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:41:08,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:41:08,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-11-07 16:41:08,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299490093] [2024-11-07 16:41:08,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:41:08,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:41:08,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:41:08,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:41:08,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:41:08,033 INFO L87 Difference]: Start difference. First operand 144 states and 155 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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:41:08,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:41:08,128 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2024-11-07 16:41:08,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:41:08,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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 31 [2024-11-07 16:41:08,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:41:08,129 INFO L225 Difference]: With dead ends: 152 [2024-11-07 16:41:08,129 INFO L226 Difference]: Without dead ends: 129 [2024-11-07 16:41:08,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:41:08,129 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:41:08,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 281 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:41:08,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-07 16:41:08,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-07 16:41:08,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 106 states have (on average 1.2830188679245282) internal successors, (136), 127 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:08,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2024-11-07 16:41:08,132 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 31 [2024-11-07 16:41:08,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:41:08,132 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2024-11-07 16:41:08,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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:41:08,132 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2024-11-07 16:41:08,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-07 16:41:08,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:41:08,132 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:41:08,148 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:41:08,333 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,SelfDestructingSolverStorable22 [2024-11-07 16:41:08,333 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-07 16:41:08,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:41:08,334 INFO L85 PathProgramCache]: Analyzing trace with hash 372056056, now seen corresponding path program 1 times [2024-11-07 16:41:08,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:41:08,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748178224] [2024-11-07 16:41:08,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:08,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:41:08,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:08,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:41:08,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:41:08,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748178224] [2024-11-07 16:41:08,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748178224] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:41:08,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503362097] [2024-11-07 16:41:08,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:08,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:41:08,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:41:08,678 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:41:08,682 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:41:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:08,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-07 16:41:08,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:41:08,774 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:41:08,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 16:41:08,818 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:41:08,819 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:41:08,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:41:08,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-07 16:41:08,841 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 15 treesize of output 1 [2024-11-07 16:41:08,901 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:41:08,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-07 16:41:08,904 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 24 treesize of output 11 [2024-11-07 16:41:08,923 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 16 treesize of output 8 [2024-11-07 16:41:08,933 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 16 treesize of output 11 [2024-11-07 16:41:08,948 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 16 treesize of output 11 [2024-11-07 16:41:08,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:41:08,983 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:41:09,019 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_906 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_906) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-11-07 16:41:09,057 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_906 (Array Int Int))) (= (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_906) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-11-07 16:41:09,067 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_904 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_906 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_903) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_904) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_906) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-11-07 16:41:09,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:41:09,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2024-11-07 16:41:09,121 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 60 treesize of output 52 [2024-11-07 16:41:09,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 24 treesize of output 22 [2024-11-07 16:41:09,171 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (forall ((v_ArrVal_901 (Array Int Int))) (or (forall ((v_ArrVal_906 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_901))) (or (forall ((v_ArrVal_903 (Array Int Int)) (v_arrayElimCell_23 Int)) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_903) v_arrayElimCell_23 v_ArrVal_906) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_906) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (not (= v_ArrVal_901 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_901 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (or .cse3 (forall ((v_ArrVal_901 (Array Int Int)) (v_ArrVal_906 (Array Int Int))) (or (not (= v_ArrVal_901 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_901 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_901) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_906) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (or (not .cse3) (forall ((v_ArrVal_901 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_906 (Array Int Int)) (v_arrayElimCell_23 Int)) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_901) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_903) v_arrayElimCell_23 v_ArrVal_906) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= v_ArrVal_901 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_901 |c_ULTIMATE.start_main_~end~0#1.offset|))))))))) is different from false [2024-11-07 16:41:11,981 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 12 treesize of output 8 [2024-11-07 16:41:11,983 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 11 treesize of output 7 [2024-11-07 16:41:11,986 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:41:11,987 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 47 treesize of output 45 [2024-11-07 16:41:11,991 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 7 treesize of output 3 [2024-11-07 16:41:11,993 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:41:11,994 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:41:11,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2024-11-07 16:41:11,997 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:41:11,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-07 16:41:12,001 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:41:12,002 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:41:12,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2024-11-07 16:41:12,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:41:12,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503362097] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:41:12,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:41:12,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 25 [2024-11-07 16:41:12,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486016703] [2024-11-07 16:41:12,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:41:12,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-07 16:41:12,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:41:12,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-07 16:41:12,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=333, Unknown=18, NotChecked=164, Total=600 [2024-11-07 16:41:12,028 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 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:41:13,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:41:13,259 INFO L93 Difference]: Finished difference Result 209 states and 228 transitions. [2024-11-07 16:41:13,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 16:41:13,260 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 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 37 [2024-11-07 16:41:13,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:41:13,261 INFO L225 Difference]: With dead ends: 209 [2024-11-07 16:41:13,261 INFO L226 Difference]: Without dead ends: 209 [2024-11-07 16:41:13,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=287, Invalid=899, Unknown=20, NotChecked=276, Total=1482 [2024-11-07 16:41:13,262 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 383 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 54 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 1790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 750 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 16:41:13,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 694 Invalid, 1790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 979 Invalid, 7 Unknown, 750 Unchecked, 0.7s Time] [2024-11-07 16:41:13,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-07 16:41:13,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 155. [2024-11-07 16:41:13,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 132 states have (on average 1.2424242424242424) internal successors, (164), 153 states have internal predecessors, (164), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:13,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 167 transitions. [2024-11-07 16:41:13,265 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 167 transitions. Word has length 37 [2024-11-07 16:41:13,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:41:13,265 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 167 transitions. [2024-11-07 16:41:13,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 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:41:13,265 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 167 transitions. [2024-11-07 16:41:13,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-07 16:41:13,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:41:13,265 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:41:13,278 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:41:13,469 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,SelfDestructingSolverStorable23 [2024-11-07 16:41:13,469 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-07 16:41:13,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:41:13,470 INFO L85 PathProgramCache]: Analyzing trace with hash 764553448, now seen corresponding path program 1 times [2024-11-07 16:41:13,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:41:13,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307302867] [2024-11-07 16:41:13,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:13,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:41:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:13,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:41:13,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:41:13,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307302867] [2024-11-07 16:41:13,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307302867] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:41:13,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503188554] [2024-11-07 16:41:13,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:13,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:41:13,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:41:13,776 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:41:13,782 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:41:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:13,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-07 16:41:13,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:41:13,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 16:41:13,942 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:41:13,943 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:41:13,968 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 15 treesize of output 1 [2024-11-07 16:41:14,033 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:41:14,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-11-07 16:41:14,098 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-07 16:41:14,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-07 16:41:14,154 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:41:14,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-07 16:41:14,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-07 16:41:14,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:41:14,274 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:41:14,477 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2024-11-07 16:41:14,478 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 19 treesize of output 18 [2024-11-07 16:41:14,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:41:14,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 36 [2024-11-07 16:41:14,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:41:14,787 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 408 treesize of output 343 [2024-11-07 16:41:14,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:41:14,822 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 287 treesize of output 263 [2024-11-07 16:41:14,829 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 255 treesize of output 239 [2024-11-07 16:41:15,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:41:15,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503188554] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:41:15,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:41:15,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 35 [2024-11-07 16:41:15,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893680531] [2024-11-07 16:41:15,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:41:15,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-07 16:41:15,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:41:15,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-07 16:41:15,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1118, Unknown=26, NotChecked=0, Total=1260 [2024-11-07 16:41:15,228 INFO L87 Difference]: Start difference. First operand 155 states and 167 transitions. Second operand has 36 states, 35 states have (on average 3.3714285714285714) internal successors, (118), 36 states have internal predecessors, (118), 0 states have call successors, (0), 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:41:16,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:41:16,232 INFO L93 Difference]: Finished difference Result 242 states and 264 transitions. [2024-11-07 16:41:16,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 16:41:16,232 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.3714285714285714) internal successors, (118), 36 states have internal predecessors, (118), 0 states have call successors, (0), 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 42 [2024-11-07 16:41:16,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:41:16,233 INFO L225 Difference]: With dead ends: 242 [2024-11-07 16:41:16,233 INFO L226 Difference]: Without dead ends: 242 [2024-11-07 16:41:16,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=276, Invalid=1860, Unknown=26, NotChecked=0, Total=2162 [2024-11-07 16:41:16,234 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 444 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 1599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 16:41:16,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 750 Invalid, 1599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1539 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 16:41:16,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-07 16:41:16,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 189. [2024-11-07 16:41:16,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 166 states have (on average 1.216867469879518) internal successors, (202), 187 states have internal predecessors, (202), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:16,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 205 transitions. [2024-11-07 16:41:16,238 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 205 transitions. Word has length 42 [2024-11-07 16:41:16,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:41:16,238 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 205 transitions. [2024-11-07 16:41:16,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.3714285714285714) internal successors, (118), 36 states have internal predecessors, (118), 0 states have call successors, (0), 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:41:16,238 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 205 transitions. [2024-11-07 16:41:16,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-07 16:41:16,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:41:16,238 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:41:16,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-07 16:41:16,442 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,SelfDestructingSolverStorable24 [2024-11-07 16:41:16,443 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-07 16:41:16,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:41:16,443 INFO L85 PathProgramCache]: Analyzing trace with hash 764553449, now seen corresponding path program 1 times [2024-11-07 16:41:16,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:41:16,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657197571] [2024-11-07 16:41:16,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:16,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:41:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:16,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:41:16,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:41:16,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657197571] [2024-11-07 16:41:16,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657197571] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:41:16,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588918617] [2024-11-07 16:41:16,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:16,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:41:16,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:41:16,898 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:41:16,901 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:41:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:17,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-07 16:41:17,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:41:17,017 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:41:17,088 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:41:17,088 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:41:17,115 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:41:17,121 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 15 treesize of output 1 [2024-11-07 16:41:17,196 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:41:17,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-07 16:41:17,201 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 24 treesize of output 11 [2024-11-07 16:41:17,287 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-07 16:41:17,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-07 16:41:17,301 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-07 16:41:17,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-07 16:41:17,360 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:41:17,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-07 16:41:17,363 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 24 treesize of output 11 [2024-11-07 16:41:17,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-07 16:41:17,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-07 16:41:17,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:41:17,590 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:41:17,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:41:17,906 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 56 treesize of output 60 [2024-11-07 16:41:17,968 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1107 (Array Int Int)) (v_prenex_5 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_5) |c_ULTIMATE.start_main_~end~0#1.base|) (< v_prenex_5 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_5))) (forall ((v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (or (< v_prenex_5 0) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_6) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_5) (+ |c_ULTIMATE.start_main_~end~0#1.offset| 1)) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_5))) (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_94| Int) (v_ArrVal_1106 (Array Int Int))) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1106) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_94|) 9)) (< |v_ULTIMATE.start_main_~end~0#1.offset_94| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_94|)))) is different from false [2024-11-07 16:41:18,056 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1107 (Array Int Int)) (v_prenex_5 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_5) |c_ULTIMATE.start_main_~end~0#1.base|) (< v_prenex_5 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_5))) (forall ((v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (or (< v_prenex_5 0) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_6) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_5) 1) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_5))) (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_94| Int) (v_ArrVal_1106 (Array Int Int))) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1106) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_94|) 9)) (< |v_ULTIMATE.start_main_~end~0#1.offset_94| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_94|)))) is different from false [2024-11-07 16:41:18,400 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_prenex_5 Int) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_prenex_6 (Array Int Int))) (or (< v_prenex_5 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_5) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1102) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1103) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_prenex_6) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_5) 1))) (forall ((v_ArrVal_1107 (Array Int Int)) (v_prenex_5 Int) (v_ArrVal_1103 (Array Int Int))) (or (< v_prenex_5 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_5) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1103))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (= (select (select (store .cse1 .cse2 v_ArrVal_1107) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_5) .cse2))))) (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_94| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1102 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1102) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1103) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1106) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_94|) 9)) (< |v_ULTIMATE.start_main_~end~0#1.offset_94| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_94|))))) is different from false [2024-11-07 16:41:18,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:41:18,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2024-11-07 16:41:18,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:41:18,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2024-11-07 16:41:18,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2024-11-07 16:41:18,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:41:18,443 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 100 treesize of output 99 [2024-11-07 16:41:18,448 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 60 treesize of output 52 [2024-11-07 16:41:18,452 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 76 treesize of output 70 [2024-11-07 16:41:18,455 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 48 treesize of output 46 [2024-11-07 16:41:18,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:41:18,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2024-11-07 16:41:18,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:41:18,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2024-11-07 16:41:18,523 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:41:18,525 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 28 treesize of output 20 [2024-11-07 16:41:18,527 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:41:18,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:41:18,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:41:18,530 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-07 16:41:18,538 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-07 16:41:18,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2024-11-07 16:41:18,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:41:18,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588918617] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:41:18,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:41:18,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 39 [2024-11-07 16:41:18,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556412039] [2024-11-07 16:41:18,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:41:18,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-07 16:41:18,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:41:18,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-07 16:41:18,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1198, Unknown=29, NotChecked=216, Total=1560 [2024-11-07 16:41:18,696 INFO L87 Difference]: Start difference. First operand 189 states and 205 transitions. Second operand has 40 states, 39 states have (on average 3.1794871794871793) internal successors, (124), 40 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:20,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:41:20,221 INFO L93 Difference]: Finished difference Result 245 states and 267 transitions. [2024-11-07 16:41:20,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 16:41:20,222 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 3.1794871794871793) internal successors, (124), 40 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-07 16:41:20,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:41:20,223 INFO L225 Difference]: With dead ends: 245 [2024-11-07 16:41:20,223 INFO L226 Difference]: Without dead ends: 245 [2024-11-07 16:41:20,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=359, Invalid=2485, Unknown=30, NotChecked=318, Total=3192 [2024-11-07 16:41:20,223 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 473 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 1963 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 2650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 619 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 16:41:20,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 1006 Invalid, 2650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1963 Invalid, 0 Unknown, 619 Unchecked, 0.9s Time] [2024-11-07 16:41:20,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-07 16:41:20,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 192. [2024-11-07 16:41:20,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 169 states have (on average 1.21301775147929) internal successors, (205), 190 states have internal predecessors, (205), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:20,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 208 transitions. [2024-11-07 16:41:20,236 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 208 transitions. Word has length 42 [2024-11-07 16:41:20,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:41:20,236 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 208 transitions. [2024-11-07 16:41:20,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 3.1794871794871793) internal successors, (124), 40 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:41:20,236 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 208 transitions. [2024-11-07 16:41:20,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-07 16:41:20,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:41:20,237 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:41:20,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-07 16:41:20,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:41:20,439 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-07 16:41:20,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:41:20,442 INFO L85 PathProgramCache]: Analyzing trace with hash -87872669, now seen corresponding path program 1 times [2024-11-07 16:41:20,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:41:20,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668618672] [2024-11-07 16:41:20,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:20,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:41:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:21,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:41:21,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:41:21,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668618672] [2024-11-07 16:41:21,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668618672] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:41:21,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268721803] [2024-11-07 16:41:21,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:41:21,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:41:21,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:41:21,051 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:41:21,052 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:41:21,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:41:21,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-07 16:41:21,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:41:21,181 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:41:21,191 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:41:21,242 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:41:21,243 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:41:21,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:41:21,283 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 23 treesize of output 11 [2024-11-07 16:41:21,291 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 15 treesize of output 1 [2024-11-07 16:41:21,346 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:41:21,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-07 16:41:21,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 24 treesize of output 11 [2024-11-07 16:41:21,361 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 16 treesize of output 8 [2024-11-07 16:41:21,382 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 16 treesize of output 11 [2024-11-07 16:41:21,412 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 16 treesize of output 11 [2024-11-07 16:41:21,422 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:41:21,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:41:21,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:41:21,456 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 16 treesize of output 11 [2024-11-07 16:41:21,460 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 15 treesize of output 1 [2024-11-07 16:41:21,538 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:41:21,539 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-11-07 16:41:21,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-07 16:41:21,562 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-07 16:41:21,562 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 1 case distinctions, treesize of input 24 treesize of output 19 [2024-11-07 16:41:21,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-07 16:41:21,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2024-11-07 16:41:21,655 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-07 16:41:21,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2024-11-07 16:41:21,692 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-07 16:41:21,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2024-11-07 16:41:21,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:41:21,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:41:21,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:41:21,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2024-11-07 16:41:22,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:41:22,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2024-11-07 16:41:22,067 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 60 treesize of output 52 [2024-11-07 16:41:22,071 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 24 treesize of output 22 [2024-11-07 16:41:22,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:41:22,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-07 16:41:22,081 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 30 treesize of output 22 [2024-11-07 16:41:22,085 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 11 treesize of output 9 [2024-11-07 16:41:22,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:41:22,651 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 85 treesize of output 103 [2024-11-07 16:41:22,736 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_prenex_12 Int) (v_prenex_13 (Array Int Int)) (v_prenex_11 (Array Int Int))) (or (= v_prenex_12 |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_13) v_prenex_12 v_prenex_11) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (not (= (select v_prenex_11 8) 1)))) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_arrayElimCell_81 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1261 (Array Int Int))) (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1261))) (or (not (= (select v_arrayElimArr_8 8) 1)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store .cse1 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_81 v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (= (select (select (store .cse1 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)))))) is different from false [2024-11-07 16:41:22,753 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_prenex_12 Int) (v_prenex_13 (Array Int Int)) (v_prenex_11 (Array Int Int))) (or (= v_prenex_12 |c_ULTIMATE.start_main_#t~mem5#1.base|) (not (= (select v_prenex_11 8) 1)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem5#1.base| v_prenex_13) v_prenex_12 v_prenex_11) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1))) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_arrayElimCell_81 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1261 (Array Int Int))) (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1261))) (or (not (= (select v_arrayElimArr_8 8) 1)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~mem5#1.base|) (= (select (select (store (store .cse1 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_81 v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (= (select (select (store .cse1 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)))))) is different from false [2024-11-07 16:41:22,772 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_arrayElimArr_8 (Array Int Int)) (v_arrayElimCell_81 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1261 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| .cse2 v_ArrVal_1261))) (or (not (= (select v_arrayElimArr_8 8) 1)) (= (select (select (store .cse0 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse0 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_81 v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| .cse2)))) (forall ((v_prenex_12 Int) (v_prenex_13 (Array Int Int)) (v_prenex_11 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| .cse2 v_prenex_13) v_prenex_12 v_prenex_11) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= (select v_prenex_11 8) 1)) (= .cse2 v_prenex_12))))) is different from false [2024-11-07 16:41:22,807 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1257 (Array Int Int)) (v_arrayElimCell_81 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1261 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1257) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse0 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1258) .cse2 v_ArrVal_1261))) (or (not (= (select v_arrayElimArr_8 8) 1)) (= (select (select (store (store .cse0 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_81 v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store .cse0 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| .cse2))))) (forall ((v_prenex_12 Int) (v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1257 (Array Int Int)) (v_prenex_13 (Array Int Int)) (v_prenex_11 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1257) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= (select v_prenex_11 8) 1)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1258) .cse3 v_prenex_13) v_prenex_12 v_prenex_11) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= .cse3 v_prenex_12)))))) is different from false [2024-11-07 16:41:22,829 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1257 (Array Int Int)) (v_arrayElimCell_81 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1261 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_1257) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse0 (store (store |c_#memory_int#1| .cse3 v_ArrVal_1258) .cse2 v_ArrVal_1261))) (or (not (= (select v_arrayElimArr_8 8) 1)) (= (select (select (store (store .cse0 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_81 v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= 1 (select (select (store .cse0 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| .cse2))))) (forall ((v_prenex_12 Int) (v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1257 (Array Int Int)) (v_prenex_13 (Array Int Int)) (v_prenex_11 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_1257) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (= .cse4 v_prenex_12) (not (= (select v_prenex_11 8) 1)) (= (select (select (store (store (store |c_#memory_int#1| .cse3 v_ArrVal_1258) .cse4 v_prenex_13) v_prenex_12 v_prenex_11) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))))) is different from false [2024-11-07 16:41:22,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:41:22,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 162 treesize of output 131 [2024-11-07 16:41:22,861 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 243 treesize of output 219 [2024-11-07 16:41:22,865 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 205 treesize of output 199 [2024-11-07 16:41:22,868 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 199 treesize of output 195 [2024-11-07 16:41:23,568 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (let ((.cse0 (not .cse7)) (.cse1 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (or .cse0 (and (forall ((v_ArrVal_1255 (Array Int Int))) (or (not (= v_ArrVal_1255 (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1255 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_arrayElimCell_88 Int)) (or (forall ((v_arrayElimArr_8 (Array Int Int))) (or (not (= (select v_arrayElimArr_8 8) 1)) (forall ((v_arrayElimCell_81 Int) (v_ArrVal_1266 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_ArrVal_1261 (Array Int Int))) (let ((.cse4 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1255))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1261))) (or (= (select (select (store .cse2 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store (store (store .cse4 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_arrayElimCell_88 v_ArrVal_1261) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store (store .cse2 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_81 v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1))))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_88))))) (forall ((v_ArrVal_1255 (Array Int Int))) (or (not (= v_ArrVal_1255 (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1255 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_arrayElimCell_81 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1266 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_ArrVal_1261 (Array Int Int)) (v_arrayElimCell_88 Int)) (let ((.cse5 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1255))) (or (not (= (select v_arrayElimArr_8 8) 1)) (= (select (select (store (store (store .cse5 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_arrayElimCell_88 v_ArrVal_1261) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store (store (store .cse5 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1261) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_81 v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_88)))))) (forall ((v_ArrVal_1255 (Array Int Int))) (or (not (= v_ArrVal_1255 (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1255 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_arrayElimCell_81 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1266 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_ArrVal_1261 (Array Int Int)) (v_arrayElimCell_88 Int)) (let ((.cse6 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1255) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_arrayElimCell_88 v_ArrVal_1261))) (or (not (= (select v_arrayElimArr_8 8) 1)) (= (select (select (store .cse6 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store (store .cse6 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_81 v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_88)))))))) (or .cse7 (forall ((v_prenex_12 Int) (v_ArrVal_1255 (Array Int Int)) (v_prenex_13 (Array Int Int)) (v_prenex_11 (Array Int Int))) (or (not (= v_ArrVal_1255 (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1255 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (not (= (select v_prenex_11 8) 1)) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1255) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) v_prenex_12 v_prenex_11) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1)))) (or .cse0 (and (forall ((v_ArrVal_1255 (Array Int Int))) (or (forall ((v_prenex_12 Int) (v_arrayElimCell_89 Int)) (or (= v_prenex_12 v_arrayElimCell_89) (forall ((v_prenex_11 (Array Int Int))) (or (forall ((v_ArrVal_1258 (Array Int Int)) (v_prenex_13 (Array Int Int))) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1255))) (or (= (select (select (store (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1258) v_arrayElimCell_89 v_prenex_13) v_prenex_12 v_prenex_11) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) v_prenex_12 v_prenex_11) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1)))) (not (= (select v_prenex_11 8) 1)))))) (not (= v_ArrVal_1255 (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1255 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (forall ((v_ArrVal_1255 (Array Int Int))) (or (not (= v_ArrVal_1255 (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1255 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_prenex_12 Int) (v_ArrVal_1258 (Array Int Int)) (v_prenex_13 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_arrayElimCell_89 Int)) (or (= v_prenex_12 v_arrayElimCell_89) (not (= (select v_prenex_11 8) 1)) (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1255) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1258) v_arrayElimCell_89 v_prenex_13) v_prenex_12 v_prenex_11) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1))))))) (or .cse7 (and (forall ((v_ArrVal_1255 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_arrayElimCell_81 Int) (v_ArrVal_1266 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_ArrVal_1261 (Array Int Int)) (v_arrayElimCell_88 Int)) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1255))) (or (not (= (select v_arrayElimArr_8 8) 1)) (= (select (select (store (store .cse9 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1261) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store (store (store (store .cse9 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_arrayElimCell_88 v_ArrVal_1261) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_81 v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1)))))) (not (= v_ArrVal_1255 (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1255 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (forall ((v_ArrVal_1255 (Array Int Int))) (or (not (= v_ArrVal_1255 (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1255 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_arrayElimArr_8 (Array Int Int)) (v_arrayElimCell_81 Int) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1261 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1255) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1261))) (or (not (= (select v_arrayElimArr_8 8) 1)) (= (select (select (store .cse10 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store (store .cse10 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_81 v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1)))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (forall ((v_ArrVal_1255 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_arrayElimArr_8 (Array Int Int)) (v_arrayElimCell_88 Int)) (or (not (= (select v_arrayElimArr_8 8) 1)) (forall ((v_arrayElimCell_81 Int) (v_ArrVal_1266 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_ArrVal_1261 (Array Int Int))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1255))) (let ((.cse11 (store .cse12 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1261))) (or (= (select (select (store .cse11 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_arrayElimCell_88 v_ArrVal_1261) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store (store .cse11 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_81 v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1))))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= v_ArrVal_1255 (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1255 |c_ULTIMATE.start_main_~end~0#1.offset|)))))))) (forall ((v_ArrVal_1255 (Array Int Int))) (or (not (= v_ArrVal_1255 (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1255 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_prenex_12 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) (forall ((v_arrayElimCell_89 Int)) (or (= v_prenex_12 v_arrayElimCell_89) (forall ((v_prenex_11 (Array Int Int))) (or (forall ((v_ArrVal_1258 (Array Int Int)) (v_prenex_13 (Array Int Int))) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1255))) (or (= (select (select (store (store (store .cse13 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1258) v_arrayElimCell_89 v_prenex_13) v_prenex_12 v_prenex_11) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store (store .cse13 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) v_prenex_12 v_prenex_11) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1)))) (not (= (select v_prenex_11 8) 1)))))))))) (or .cse0 (forall ((v_prenex_12 Int) (v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1255 (Array Int Int)) (v_prenex_13 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_arrayElimCell_89 Int)) (or (= v_prenex_12 v_arrayElimCell_89) (not (= v_ArrVal_1255 (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1255 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (not (= (select v_prenex_11 8) 1)) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1255) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1258) v_arrayElimCell_89 v_prenex_13) v_prenex_12 v_prenex_11) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1)))) (or .cse7 (forall ((v_arrayElimArr_8 (Array Int Int)) (v_arrayElimCell_81 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1261 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1255) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1261))) (or (not (= (select v_arrayElimArr_8 8) 1)) (= (select (select (store .cse14 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (not (= v_ArrVal_1255 (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1255 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse14 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_81 v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1))))) (or .cse7 (and (forall ((v_ArrVal_1255 (Array Int Int))) (or (not (= v_ArrVal_1255 (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1255 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_prenex_12 Int)) (or (forall ((v_prenex_11 (Array Int Int)) (v_arrayElimCell_89 Int)) (or (forall ((v_ArrVal_1258 (Array Int Int)) (v_prenex_13 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1255))) (or (= (select (select (store (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1258) v_arrayElimCell_89 v_prenex_13) v_prenex_12 v_prenex_11) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) v_prenex_12 v_prenex_11) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1)))) (not (= (select v_prenex_11 8) 1)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12))))) (forall ((v_ArrVal_1255 (Array Int Int))) (or (not (= v_ArrVal_1255 (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1255 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_prenex_12 Int)) (or (forall ((v_prenex_13 (Array Int Int)) (v_prenex_11 (Array Int Int))) (or (not (= (select v_prenex_11 8) 1)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1255) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) v_prenex_12 v_prenex_11) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12))))))) (or .cse0 (forall ((v_arrayElimArr_8 (Array Int Int)) (v_arrayElimCell_81 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1266 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_ArrVal_1261 (Array Int Int)) (v_arrayElimCell_88 Int)) (let ((.cse16 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1255) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_arrayElimCell_88 v_ArrVal_1261))) (or (not (= (select v_arrayElimArr_8 8) 1)) (= (select (select (store .cse16 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (not (= v_ArrVal_1255 (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1255 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (select (select (store (store .cse16 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_81 v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_88))))) (or (forall ((v_arrayElimArr_8 (Array Int Int)) (v_arrayElimCell_81 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1266 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_ArrVal_1261 (Array Int Int)) (v_arrayElimCell_88 Int)) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1255))) (or (not (= (select v_arrayElimArr_8 8) 1)) (= (select (select (store (store .cse17 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1261) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (not (= v_ArrVal_1255 (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1255 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (select (select (store (store (store (store .cse17 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_arrayElimCell_88 v_ArrVal_1261) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_81 v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_88)))) .cse7) (or .cse0 (forall ((v_arrayElimArr_8 (Array Int Int)) (v_arrayElimCell_81 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1266 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_ArrVal_1261 (Array Int Int)) (v_arrayElimCell_88 Int)) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1255))) (or (not (= (select v_arrayElimArr_8 8) 1)) (= (select (select (store (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_arrayElimCell_88 v_ArrVal_1261) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (not (= v_ArrVal_1255 (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1255 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1261) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_81 v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_88))))) (forall ((v_ArrVal_1255 (Array Int Int))) (or (not (= v_ArrVal_1255 (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1255 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_arrayElimCell_88 Int)) (or (forall ((v_arrayElimArr_8 (Array Int Int))) (or (not (= (select v_arrayElimArr_8 8) 1)) (forall ((v_arrayElimCell_81 Int) (v_ArrVal_1266 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_ArrVal_1261 (Array Int Int))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1255))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1261))) (or (= (select (select (store .cse19 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_arrayElimCell_88 v_ArrVal_1261) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store (store .cse19 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_81 v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1))))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_88)))))))))) is different from false [2024-11-07 16:41:34,240 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:41:34,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 220 [2024-11-07 16:41:34,253 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:41:34,261 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-07 16:41:34,261 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 14 treesize of output 11 [2024-11-07 16:41:34,263 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 7 treesize of output 3 [2024-11-07 16:41:34,269 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:41:34,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:41:34,278 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 64 treesize of output 62 [2024-11-07 16:41:34,282 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 36 treesize of output 28 [2024-11-07 16:41:34,285 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 38 treesize of output 30 [2024-11-07 16:41:34,295 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:41:34,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 301 treesize of output 299 [2024-11-07 16:41:34,305 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 62 treesize of output 58 [2024-11-07 16:41:34,310 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 122 treesize of output 114 [2024-11-07 16:41:34,320 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-07 16:41:34,320 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 131 treesize of output 112 [2024-11-07 16:41:34,330 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:41:34,337 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:41:34,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2024-11-07 16:41:34,343 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:41:34,351 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-07 16:41:34,351 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 14 treesize of output 11 [2024-11-07 16:41:34,355 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:41:34,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 163 [2024-11-07 16:41:34,364 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:41:34,371 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-07 16:41:34,371 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 14 treesize of output 11 [2024-11-07 16:41:34,374 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 7 treesize of output 3 [2024-11-07 16:41:34,379 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:41:34,382 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 222 treesize of output 220 [2024-11-07 16:41:34,390 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:41:34,397 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-07 16:41:34,398 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 14 treesize of output 11 [2024-11-07 16:41:34,400 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 7 treesize of output 3 [2024-11-07 16:41:34,405 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:41:34,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2024-11-07 16:41:34,411 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:41:34,419 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-07 16:41:34,419 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 14 treesize of output 11 [2024-11-07 16:41:34,423 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:41:34,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 95 [2024-11-07 16:41:34,432 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:41:34,440 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-07 16:41:34,440 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 14 treesize of output 11 [2024-11-07 16:41:34,444 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:41:34,446 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 97 treesize of output 95 [2024-11-07 16:41:34,453 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:41:34,461 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-07 16:41:34,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2024-11-07 16:41:34,468 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:41:34,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 301 treesize of output 299 [2024-11-07 16:41:34,478 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 62 treesize of output 58 [2024-11-07 16:41:34,489 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:41:34,497 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-07 16:41:34,497 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 14 treesize of output 11 [2024-11-07 16:41:34,502 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 32 treesize of output 24 [2024-11-07 16:41:34,505 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:41:34,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 163 [2024-11-07 16:41:34,514 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:41:34,520 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-07 16:41:34,520 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 14 treesize of output 11 [2024-11-07 16:41:34,523 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 7 treesize of output 3 [2024-11-07 16:41:40,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:41:40,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268721803] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:41:40,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:41:40,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 22] total 53 [2024-11-07 16:41:40,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849449592] [2024-11-07 16:41:40,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:41:40,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-07 16:41:40,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:41:40,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-07 16:41:40,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=1850, Unknown=19, NotChecked=570, Total=2756 [2024-11-07 16:41:40,020 INFO L87 Difference]: Start difference. First operand 192 states and 208 transitions. Second operand has 53 states, 53 states have (on average 2.169811320754717) internal successors, (115), 53 states have internal predecessors, (115), 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:41:53,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-07 16:41:55,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-07 16:41:59,287 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 [1] [2024-11-07 16:42:02,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-07 16:42:06,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-07 16:42:09,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-07 16:42:32,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-07 16:42:36,667 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 [1]