./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/stack_longest-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/pthread/stack_longest-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', '529fe0895c01c52d9b18b51c32204a307faf547c0c07b22bc1a431308affcf90'] 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/pthread/stack_longest-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 529fe0895c01c52d9b18b51c32204a307faf547c0c07b22bc1a431308affcf90 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:06:28,157 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:06:28,243 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-07 19:06:28,248 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:06:28,248 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:06:28,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:06:28,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:06:28,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:06:28,274 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:06:28,274 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:06:28,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:06:28,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:06:28,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:06:28,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:06:28,276 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:06:28,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:06:28,276 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:06:28,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:06:28,276 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:06:28,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:06:28,276 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:06:28,276 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:06:28,276 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:06:28,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:06:28,277 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:06:28,277 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:06:28,277 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:06:28,277 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:06:28,277 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:06:28,277 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:06:28,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:06:28,277 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:06:28,277 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:06:28,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:06:28,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:06:28,278 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:06:28,278 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 19:06:28,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 19:06:28,278 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:06:28,278 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:06:28,278 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:06:28,278 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:06:28,278 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 -> 529fe0895c01c52d9b18b51c32204a307faf547c0c07b22bc1a431308affcf90 [2024-11-07 19:06:28,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:06:28,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:06:28,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:06:28,531 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:06:28,532 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:06:28,534 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack_longest-1.i [2024-11-07 19:06:29,705 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:06:29,989 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:06:29,990 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/stack_longest-1.i [2024-11-07 19:06:30,006 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59cc225ca/62b50ebefd4c4b4fab53533df09a5877/FLAG7b94c29ee [2024-11-07 19:06:30,285 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59cc225ca/62b50ebefd4c4b4fab53533df09a5877 [2024-11-07 19:06:30,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:06:30,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:06:30,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:06:30,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:06:30,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:06:30,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:06:30" (1/1) ... [2024-11-07 19:06:30,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@142e8c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:30, skipping insertion in model container [2024-11-07 19:06:30,294 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:06:30" (1/1) ... [2024-11-07 19:06:30,321 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:06:30,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:06:30,618 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:06:30,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:06:30,777 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:06:30,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:30 WrapperNode [2024-11-07 19:06:30,778 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:06:30,779 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:06:30,779 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:06:30,779 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:06:30,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:30" (1/1) ... [2024-11-07 19:06:30,807 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:30" (1/1) ... [2024-11-07 19:06:30,879 INFO L138 Inliner]: procedures = 277, calls = 832, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 956 [2024-11-07 19:06:30,880 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:06:30,880 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:06:30,880 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:06:30,880 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:06:30,889 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:30" (1/1) ... [2024-11-07 19:06:30,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:30" (1/1) ... [2024-11-07 19:06:30,901 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:30" (1/1) ... [2024-11-07 19:06:30,934 INFO L175 MemorySlicer]: Split 809 memory accesses to 3 slices as follows [2, 802, 5]. 99 percent of accesses are in the largest equivalence class. The 807 initializations are split as follows [2, 800, 5]. The 1 writes are split as follows [0, 1, 0]. [2024-11-07 19:06:30,935 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:30" (1/1) ... [2024-11-07 19:06:30,935 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:30" (1/1) ... [2024-11-07 19:06:30,953 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:30" (1/1) ... [2024-11-07 19:06:30,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:30" (1/1) ... [2024-11-07 19:06:30,959 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:30" (1/1) ... [2024-11-07 19:06:30,962 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:30" (1/1) ... [2024-11-07 19:06:30,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:06:30,967 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:06:30,967 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:06:30,967 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:06:30,968 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:30" (1/1) ... [2024-11-07 19:06:30,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:06:30,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:06:31,001 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 19:06:31,007 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 19:06:31,022 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-07 19:06:31,022 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-07 19:06:31,022 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-07 19:06:31,022 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-07 19:06:31,022 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-07 19:06:31,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 19:06:31,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 19:06:31,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 19:06:31,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 19:06:31,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 19:06:31,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 19:06:31,022 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-07 19:06:31,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:06:31,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 19:06:31,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 19:06:31,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 19:06:31,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:06:31,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:06:31,024 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-07 19:06:31,167 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:06:31,168 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:06:32,230 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 19:06:32,230 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:06:42,259 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:06:42,259 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 19:06:42,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:06:42 BoogieIcfgContainer [2024-11-07 19:06:42,260 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:06:42,261 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:06:42,261 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:06:42,264 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:06:42,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:06:30" (1/3) ... [2024-11-07 19:06:42,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1051ec43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:06:42, skipping insertion in model container [2024-11-07 19:06:42,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:30" (2/3) ... [2024-11-07 19:06:42,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1051ec43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:06:42, skipping insertion in model container [2024-11-07 19:06:42,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:06:42" (3/3) ... [2024-11-07 19:06:42,270 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longest-1.i [2024-11-07 19:06:42,280 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:06:42,281 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-07 19:06:42,281 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 19:06:42,338 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-07 19:06:42,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 55 transitions, 124 flow [2024-11-07 19:06:42,410 INFO L124 PetriNetUnfolderBase]: 9/53 cut-off events. [2024-11-07 19:06:42,413 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 19:06:42,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 53 events. 9/53 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 135 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 48. Up to 3 conditions per place. [2024-11-07 19:06:42,416 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 55 transitions, 124 flow [2024-11-07 19:06:42,419 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 52 transitions, 116 flow [2024-11-07 19:06:42,428 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:06:42,441 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3b0bb1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:06:42,441 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-07 19:06:42,465 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:06:42,466 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2024-11-07 19:06:42,466 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 19:06:42,466 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:06:42,466 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:06:42,467 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:06:42,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:06:42,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1668128280, now seen corresponding path program 1 times [2024-11-07 19:06:42,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:06:42,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747696577] [2024-11-07 19:06:42,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:06:42,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:06:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:06:43,230 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 19:06:43,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:06:43,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747696577] [2024-11-07 19:06:43,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747696577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:06:43,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:06:43,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:06:43,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496199122] [2024-11-07 19:06:43,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:06:43,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:06:43,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:06:43,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:06:43,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:06:43,279 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-07 19:06:43,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 52 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 19:06:43,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:06:43,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-07 19:06:43,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:06:43,557 INFO L124 PetriNetUnfolderBase]: 459/880 cut-off events. [2024-11-07 19:06:43,558 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-11-07 19:06:43,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1652 conditions, 880 events. 459/880 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4527 event pairs, 245 based on Foata normal form. 94/846 useless extension candidates. Maximal degree in co-relation 1574. Up to 520 conditions per place. [2024-11-07 19:06:43,568 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 43 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2024-11-07 19:06:43,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 227 flow [2024-11-07 19:06:43,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:06:43,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:06:43,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2024-11-07 19:06:43,579 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5318181818181819 [2024-11-07 19:06:43,580 INFO L175 Difference]: Start difference. First operand has 50 places, 52 transitions, 116 flow. Second operand 4 states and 117 transitions. [2024-11-07 19:06:43,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 227 flow [2024-11-07 19:06:43,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 217 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 19:06:43,587 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 100 flow [2024-11-07 19:06:43,588 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2024-11-07 19:06:43,591 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2024-11-07 19:06:43,591 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 100 flow [2024-11-07 19:06:43,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 19:06:43,591 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:06:43,591 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:06:43,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 19:06:43,592 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:06:43,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:06:43,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1668128281, now seen corresponding path program 1 times [2024-11-07 19:06:43,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:06:43,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643470473] [2024-11-07 19:06:43,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:06:43,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:06:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:06:44,288 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 19:06:44,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:06:44,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643470473] [2024-11-07 19:06:44,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643470473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:06:44,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:06:44,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:06:44,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101839029] [2024-11-07 19:06:44,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:06:44,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:06:44,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:06:44,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:06:44,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:06:44,308 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-07 19:06:44,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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 19:06:44,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:06:44,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-07 19:06:44,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:06:44,668 INFO L124 PetriNetUnfolderBase]: 755/1387 cut-off events. [2024-11-07 19:06:44,668 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2024-11-07 19:06:44,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2685 conditions, 1387 events. 755/1387 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7466 event pairs, 125 based on Foata normal form. 0/1207 useless extension candidates. Maximal degree in co-relation 810. Up to 848 conditions per place. [2024-11-07 19:06:44,676 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 87 selfloop transitions, 8 changer transitions 0/108 dead transitions. [2024-11-07 19:06:44,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 108 transitions, 423 flow [2024-11-07 19:06:44,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:06:44,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:06:44,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2024-11-07 19:06:44,679 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5878787878787879 [2024-11-07 19:06:44,679 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 100 flow. Second operand 6 states and 194 transitions. [2024-11-07 19:06:44,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 108 transitions, 423 flow [2024-11-07 19:06:44,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 108 transitions, 415 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:06:44,682 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 153 flow [2024-11-07 19:06:44,682 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=153, PETRI_PLACES=52, PETRI_TRANSITIONS=53} [2024-11-07 19:06:44,683 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2024-11-07 19:06:44,683 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 153 flow [2024-11-07 19:06:44,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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 19:06:44,683 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:06:44,683 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:06:44,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 19:06:44,683 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:06:44,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:06:44,684 INFO L85 PathProgramCache]: Analyzing trace with hash 491241438, now seen corresponding path program 1 times [2024-11-07 19:06:44,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:06:44,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108728838] [2024-11-07 19:06:44,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:06:44,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:06:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:06:44,969 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 19:06:44,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:06:44,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108728838] [2024-11-07 19:06:44,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108728838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:06:44,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:06:44,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:06:44,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617284039] [2024-11-07 19:06:44,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:06:44,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:06:44,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:06:44,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:06:44,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:06:44,972 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-07 19:06:44,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 53 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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 19:06:44,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:06:44,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-07 19:06:44,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:06:45,214 INFO L124 PetriNetUnfolderBase]: 668/1270 cut-off events. [2024-11-07 19:06:45,215 INFO L125 PetriNetUnfolderBase]: For 163/163 co-relation queries the response was YES. [2024-11-07 19:06:45,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2683 conditions, 1270 events. 668/1270 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6582 event pairs, 181 based on Foata normal form. 34/1183 useless extension candidates. Maximal degree in co-relation 2598. Up to 721 conditions per place. [2024-11-07 19:06:45,221 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 67 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2024-11-07 19:06:45,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 87 transitions, 376 flow [2024-11-07 19:06:45,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:06:45,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:06:45,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2024-11-07 19:06:45,223 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5818181818181818 [2024-11-07 19:06:45,223 INFO L175 Difference]: Start difference. First operand has 52 places, 53 transitions, 153 flow. Second operand 5 states and 160 transitions. [2024-11-07 19:06:45,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 87 transitions, 376 flow [2024-11-07 19:06:45,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 87 transitions, 374 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-07 19:06:45,226 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 161 flow [2024-11-07 19:06:45,227 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=161, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2024-11-07 19:06:45,227 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2024-11-07 19:06:45,227 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 161 flow [2024-11-07 19:06:45,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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 19:06:45,228 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:06:45,228 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:06:45,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 19:06:45,228 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:06:45,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:06:45,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1667638626, now seen corresponding path program 1 times [2024-11-07 19:06:45,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:06:45,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673958621] [2024-11-07 19:06:45,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:06:45,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:06:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:06:45,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:06:45,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:06:45,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673958621] [2024-11-07 19:06:45,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673958621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:06:45,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:06:45,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:06:45,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728584189] [2024-11-07 19:06:45,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:06:45,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:06:45,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:06:45,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:06:45,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:06:45,411 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-07 19:06:45,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 19:06:45,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:06:45,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-07 19:06:45,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:06:45,699 INFO L124 PetriNetUnfolderBase]: 976/1831 cut-off events. [2024-11-07 19:06:45,699 INFO L125 PetriNetUnfolderBase]: For 351/351 co-relation queries the response was YES. [2024-11-07 19:06:45,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4033 conditions, 1831 events. 976/1831 cut-off events. For 351/351 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 9772 event pairs, 469 based on Foata normal form. 0/1699 useless extension candidates. Maximal degree in co-relation 3362. Up to 1060 conditions per place. [2024-11-07 19:06:45,711 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 73 selfloop transitions, 6 changer transitions 0/93 dead transitions. [2024-11-07 19:06:45,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 93 transitions, 429 flow [2024-11-07 19:06:45,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:06:45,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:06:45,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2024-11-07 19:06:45,712 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6318181818181818 [2024-11-07 19:06:45,712 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 161 flow. Second operand 4 states and 139 transitions. [2024-11-07 19:06:45,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 93 transitions, 429 flow [2024-11-07 19:06:45,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 93 transitions, 429 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 19:06:45,716 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 197 flow [2024-11-07 19:06:45,716 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=197, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2024-11-07 19:06:45,717 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2024-11-07 19:06:45,717 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 197 flow [2024-11-07 19:06:45,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 19:06:45,717 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:06:45,717 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:06:45,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 19:06:45,718 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:06:45,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:06:45,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1862289814, now seen corresponding path program 1 times [2024-11-07 19:06:45,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:06:45,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295633628] [2024-11-07 19:06:45,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:06:45,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:06:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:06:45,848 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 19:06:45,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:06:45,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295633628] [2024-11-07 19:06:45,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295633628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:06:45,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:06:45,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:06:45,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9257652] [2024-11-07 19:06:45,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:06:45,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:06:45,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:06:45,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:06:45,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:06:45,851 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-07 19:06:45,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 19:06:45,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:06:45,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-07 19:06:45,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:06:46,115 INFO L124 PetriNetUnfolderBase]: 1100/2025 cut-off events. [2024-11-07 19:06:46,115 INFO L125 PetriNetUnfolderBase]: For 573/573 co-relation queries the response was YES. [2024-11-07 19:06:46,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4879 conditions, 2025 events. 1100/2025 cut-off events. For 573/573 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 10913 event pairs, 511 based on Foata normal form. 22/1918 useless extension candidates. Maximal degree in co-relation 4019. Up to 1290 conditions per place. [2024-11-07 19:06:46,129 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 62 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2024-11-07 19:06:46,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 78 transitions, 397 flow [2024-11-07 19:06:46,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:06:46,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:06:46,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-11-07 19:06:46,131 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2024-11-07 19:06:46,131 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 197 flow. Second operand 3 states and 106 transitions. [2024-11-07 19:06:46,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 78 transitions, 397 flow [2024-11-07 19:06:46,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 78 transitions, 391 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-07 19:06:46,137 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 203 flow [2024-11-07 19:06:46,137 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=203, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2024-11-07 19:06:46,138 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places. [2024-11-07 19:06:46,138 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 203 flow [2024-11-07 19:06:46,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 19:06:46,138 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:06:46,138 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:06:46,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 19:06:46,138 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:06:46,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:06:46,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1621197331, now seen corresponding path program 1 times [2024-11-07 19:06:46,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:06:46,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529204320] [2024-11-07 19:06:46,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:06:46,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:06:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:06:46,348 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 19:06:46,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:06:46,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529204320] [2024-11-07 19:06:46,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529204320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:06:46,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:06:46,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:06:46,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084129334] [2024-11-07 19:06:46,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:06:46,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:06:46,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:06:46,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:06:46,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:06:46,352 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-07 19:06:46,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 203 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 19:06:46,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:06:46,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-07 19:06:46,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:06:46,609 INFO L124 PetriNetUnfolderBase]: 1006/1847 cut-off events. [2024-11-07 19:06:46,609 INFO L125 PetriNetUnfolderBase]: For 474/474 co-relation queries the response was YES. [2024-11-07 19:06:46,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4361 conditions, 1847 events. 1006/1847 cut-off events. For 474/474 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 9843 event pairs, 361 based on Foata normal form. 12/1735 useless extension candidates. Maximal degree in co-relation 3862. Up to 1410 conditions per place. [2024-11-07 19:06:46,620 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 49 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-11-07 19:06:46,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 64 transitions, 313 flow [2024-11-07 19:06:46,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:06:46,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:06:46,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-11-07 19:06:46,622 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5818181818181818 [2024-11-07 19:06:46,622 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 203 flow. Second operand 3 states and 96 transitions. [2024-11-07 19:06:46,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 64 transitions, 313 flow [2024-11-07 19:06:46,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 64 transitions, 303 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-07 19:06:46,626 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 180 flow [2024-11-07 19:06:46,627 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2024-11-07 19:06:46,627 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2024-11-07 19:06:46,627 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 180 flow [2024-11-07 19:06:46,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 19:06:46,628 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:06:46,628 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:06:46,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 19:06:46,628 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:06:46,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:06:46,628 INFO L85 PathProgramCache]: Analyzing trace with hash 952426321, now seen corresponding path program 1 times [2024-11-07 19:06:46,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:06:46,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365542212] [2024-11-07 19:06:46,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:06:46,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:06:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:06:47,308 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:06:47,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:06:47,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365542212] [2024-11-07 19:06:47,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365542212] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:06:47,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869224997] [2024-11-07 19:06:47,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:06:47,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:06:47,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:06:47,311 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 19:06:47,313 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 19:06:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:06:47,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 1758 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-07 19:06:47,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:06:47,862 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:06:47,862 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:06:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:06:48,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869224997] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:06:48,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 19:06:48,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2024-11-07 19:06:48,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066258034] [2024-11-07 19:06:48,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 19:06:48,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 19:06:48,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:06:48,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 19:06:48,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-07 19:06:48,075 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-07 19:06:48,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 180 flow. Second operand has 15 states, 15 states have (on average 19.0) internal successors, (285), 15 states have internal predecessors, (285), 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 19:06:48,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:06:48,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-07 19:06:48,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:06:49,604 INFO L124 PetriNetUnfolderBase]: 4128/7712 cut-off events. [2024-11-07 19:06:49,604 INFO L125 PetriNetUnfolderBase]: For 2487/2487 co-relation queries the response was YES. [2024-11-07 19:06:49,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17854 conditions, 7712 events. 4128/7712 cut-off events. For 2487/2487 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 50391 event pairs, 309 based on Foata normal form. 192/7387 useless extension candidates. Maximal degree in co-relation 7413. Up to 1423 conditions per place. [2024-11-07 19:06:49,651 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 327 selfloop transitions, 45 changer transitions 0/386 dead transitions. [2024-11-07 19:06:49,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 386 transitions, 1892 flow [2024-11-07 19:06:49,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 19:06:49,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-11-07 19:06:49,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 685 transitions. [2024-11-07 19:06:49,653 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2024-11-07 19:06:49,653 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 180 flow. Second operand 20 states and 685 transitions. [2024-11-07 19:06:49,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 386 transitions, 1892 flow [2024-11-07 19:06:49,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 386 transitions, 1850 flow, removed 19 selfloop flow, removed 2 redundant places. [2024-11-07 19:06:49,663 INFO L231 Difference]: Finished difference. Result has 92 places, 98 transitions, 592 flow [2024-11-07 19:06:49,663 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=592, PETRI_PLACES=92, PETRI_TRANSITIONS=98} [2024-11-07 19:06:49,664 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 42 predicate places. [2024-11-07 19:06:49,664 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 98 transitions, 592 flow [2024-11-07 19:06:49,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 19.0) internal successors, (285), 15 states have internal predecessors, (285), 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 19:06:49,664 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:06:49,664 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:06:49,680 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 19:06:49,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:06:49,869 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:06:49,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:06:49,869 INFO L85 PathProgramCache]: Analyzing trace with hash 402194878, now seen corresponding path program 1 times [2024-11-07 19:06:49,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:06:49,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672197586] [2024-11-07 19:06:49,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:06:49,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:06:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:06:50,212 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 19:06:50,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:06:50,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672197586] [2024-11-07 19:06:50,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672197586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:06:50,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:06:50,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:06:50,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820027005] [2024-11-07 19:06:50,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:06:50,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:06:50,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:06:50,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:06:50,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:06:50,214 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-07 19:06:50,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 98 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 19:06:50,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:06:50,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-07 19:06:50,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:06:50,515 INFO L124 PetriNetUnfolderBase]: 1833/3824 cut-off events. [2024-11-07 19:06:50,515 INFO L125 PetriNetUnfolderBase]: For 2280/2280 co-relation queries the response was YES. [2024-11-07 19:06:50,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9375 conditions, 3824 events. 1833/3824 cut-off events. For 2280/2280 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 22372 event pairs, 372 based on Foata normal form. 234/3899 useless extension candidates. Maximal degree in co-relation 9173. Up to 2311 conditions per place. [2024-11-07 19:06:50,540 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 70 selfloop transitions, 4 changer transitions 0/89 dead transitions. [2024-11-07 19:06:50,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 89 transitions, 609 flow [2024-11-07 19:06:50,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:06:50,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:06:50,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-11-07 19:06:50,541 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5696969696969697 [2024-11-07 19:06:50,541 INFO L175 Difference]: Start difference. First operand has 92 places, 98 transitions, 592 flow. Second operand 3 states and 94 transitions. [2024-11-07 19:06:50,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 89 transitions, 609 flow [2024-11-07 19:06:50,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 89 transitions, 561 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-11-07 19:06:50,551 INFO L231 Difference]: Finished difference. Result has 83 places, 78 transitions, 389 flow [2024-11-07 19:06:50,551 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=389, PETRI_PLACES=83, PETRI_TRANSITIONS=78} [2024-11-07 19:06:50,552 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2024-11-07 19:06:50,552 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 78 transitions, 389 flow [2024-11-07 19:06:50,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 19:06:50,552 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:06:50,552 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:06:50,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 19:06:50,552 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:06:50,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:06:50,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1021159314, now seen corresponding path program 1 times [2024-11-07 19:06:50,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:06:50,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649815412] [2024-11-07 19:06:50,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:06:50,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:06:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:06:50,727 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 19:06:50,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:06:50,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649815412] [2024-11-07 19:06:50,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649815412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:06:50,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:06:50,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:06:50,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479314725] [2024-11-07 19:06:50,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:06:50,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:06:50,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:06:50,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:06:50,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:06:50,743 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-07 19:06:50,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 78 transitions, 389 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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 19:06:50,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:06:50,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-07 19:06:50,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:06:51,054 INFO L124 PetriNetUnfolderBase]: 1838/3722 cut-off events. [2024-11-07 19:06:51,054 INFO L125 PetriNetUnfolderBase]: For 1504/1504 co-relation queries the response was YES. [2024-11-07 19:06:51,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9355 conditions, 3722 events. 1838/3722 cut-off events. For 1504/1504 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 21481 event pairs, 1002 based on Foata normal form. 0/3593 useless extension candidates. Maximal degree in co-relation 7886. Up to 2166 conditions per place. [2024-11-07 19:06:51,075 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 56 selfloop transitions, 18 changer transitions 0/88 dead transitions. [2024-11-07 19:06:51,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 88 transitions, 565 flow [2024-11-07 19:06:51,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:06:51,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:06:51,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2024-11-07 19:06:51,076 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44363636363636366 [2024-11-07 19:06:51,076 INFO L175 Difference]: Start difference. First operand has 83 places, 78 transitions, 389 flow. Second operand 5 states and 122 transitions. [2024-11-07 19:06:51,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 88 transitions, 565 flow [2024-11-07 19:06:51,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 88 transitions, 561 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:06:51,084 INFO L231 Difference]: Finished difference. Result has 85 places, 77 transitions, 419 flow [2024-11-07 19:06:51,084 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=419, PETRI_PLACES=85, PETRI_TRANSITIONS=77} [2024-11-07 19:06:51,085 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 35 predicate places. [2024-11-07 19:06:51,085 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 77 transitions, 419 flow [2024-11-07 19:06:51,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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 19:06:51,086 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:06:51,086 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:06:51,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 19:06:51,086 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:06:51,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:06:51,086 INFO L85 PathProgramCache]: Analyzing trace with hash -2146835729, now seen corresponding path program 1 times [2024-11-07 19:06:51,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:06:51,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668162378] [2024-11-07 19:06:51,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:06:51,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:06:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:06:51,554 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 19:06:51,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:06:51,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668162378] [2024-11-07 19:06:51,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668162378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:06:51,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:06:51,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:06:51,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457206947] [2024-11-07 19:06:51,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:06:51,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 19:06:51,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:06:51,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 19:06:51,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:06:51,581 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-07 19:06:51,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 77 transitions, 419 flow. Second operand has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 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 19:06:51,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:06:51,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-07 19:06:51,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:06:52,018 INFO L124 PetriNetUnfolderBase]: 1961/3989 cut-off events. [2024-11-07 19:06:52,018 INFO L125 PetriNetUnfolderBase]: For 2208/2208 co-relation queries the response was YES. [2024-11-07 19:06:52,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10043 conditions, 3989 events. 1961/3989 cut-off events. For 2208/2208 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 23119 event pairs, 461 based on Foata normal form. 0/3825 useless extension candidates. Maximal degree in co-relation 8539. Up to 2936 conditions per place. [2024-11-07 19:06:52,040 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 105 selfloop transitions, 8 changer transitions 0/126 dead transitions. [2024-11-07 19:06:52,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 126 transitions, 806 flow [2024-11-07 19:06:52,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 19:06:52,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-07 19:06:52,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 197 transitions. [2024-11-07 19:06:52,041 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5116883116883116 [2024-11-07 19:06:52,041 INFO L175 Difference]: Start difference. First operand has 85 places, 77 transitions, 419 flow. Second operand 7 states and 197 transitions. [2024-11-07 19:06:52,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 126 transitions, 806 flow [2024-11-07 19:06:52,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 126 transitions, 762 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 19:06:52,050 INFO L231 Difference]: Finished difference. Result has 90 places, 82 transitions, 440 flow [2024-11-07 19:06:52,050 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=440, PETRI_PLACES=90, PETRI_TRANSITIONS=82} [2024-11-07 19:06:52,051 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 40 predicate places. [2024-11-07 19:06:52,051 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 82 transitions, 440 flow [2024-11-07 19:06:52,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 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 19:06:52,051 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:06:52,051 INFO L204 CegarLoopForPetriNet]: 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] [2024-11-07 19:06:52,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 19:06:52,051 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:06:52,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:06:52,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1064566788, now seen corresponding path program 1 times [2024-11-07 19:06:52,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:06:52,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045229677] [2024-11-07 19:06:52,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:06:52,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:06:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:06:52,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:06:52,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:06:52,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045229677] [2024-11-07 19:06:52,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045229677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:06:52,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:06:52,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:06:52,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052162205] [2024-11-07 19:06:52,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:06:52,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:06:52,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:06:52,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:06:52,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:06:52,145 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-07 19:06:52,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 82 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 19:06:52,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:06:52,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-07 19:06:52,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:06:52,563 INFO L124 PetriNetUnfolderBase]: 2879/6062 cut-off events. [2024-11-07 19:06:52,563 INFO L125 PetriNetUnfolderBase]: For 3110/3110 co-relation queries the response was YES. [2024-11-07 19:06:52,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15006 conditions, 6062 events. 2879/6062 cut-off events. For 3110/3110 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 40536 event pairs, 1373 based on Foata normal form. 137/5973 useless extension candidates. Maximal degree in co-relation 12979. Up to 3403 conditions per place. [2024-11-07 19:06:52,602 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 124 selfloop transitions, 2 changer transitions 0/140 dead transitions. [2024-11-07 19:06:52,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 140 transitions, 1050 flow [2024-11-07 19:06:52,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:06:52,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:06:52,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-11-07 19:06:52,603 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6484848484848484 [2024-11-07 19:06:52,603 INFO L175 Difference]: Start difference. First operand has 90 places, 82 transitions, 440 flow. Second operand 3 states and 107 transitions. [2024-11-07 19:06:52,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 140 transitions, 1050 flow [2024-11-07 19:06:52,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 140 transitions, 1038 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:06:52,616 INFO L231 Difference]: Finished difference. Result has 90 places, 83 transitions, 445 flow [2024-11-07 19:06:52,617 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=445, PETRI_PLACES=90, PETRI_TRANSITIONS=83} [2024-11-07 19:06:52,617 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 40 predicate places. [2024-11-07 19:06:52,617 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 83 transitions, 445 flow [2024-11-07 19:06:52,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 19:06:52,617 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:06:52,618 INFO L204 CegarLoopForPetriNet]: 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 19:06:52,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 19:06:52,618 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:06:52,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:06:52,618 INFO L85 PathProgramCache]: Analyzing trace with hash -26869291, now seen corresponding path program 1 times [2024-11-07 19:06:52,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:06:52,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853811883] [2024-11-07 19:06:52,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:06:52,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:06:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:06:52,755 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 19:06:52,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:06:52,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853811883] [2024-11-07 19:06:52,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853811883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:06:52,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:06:52,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:06:52,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867158339] [2024-11-07 19:06:52,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:06:52,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:06:52,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:06:52,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:06:52,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:06:52,756 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-07 19:06:52,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 83 transitions, 445 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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 19:06:52,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:06:52,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-07 19:06:52,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:06:53,378 INFO L124 PetriNetUnfolderBase]: 3194/6486 cut-off events. [2024-11-07 19:06:53,378 INFO L125 PetriNetUnfolderBase]: For 4318/4318 co-relation queries the response was YES. [2024-11-07 19:06:53,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17919 conditions, 6486 events. 3194/6486 cut-off events. For 4318/4318 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 42431 event pairs, 475 based on Foata normal form. 105/6409 useless extension candidates. Maximal degree in co-relation 14839. Up to 2632 conditions per place. [2024-11-07 19:06:53,424 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 109 selfloop transitions, 10 changer transitions 0/133 dead transitions. [2024-11-07 19:06:53,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 133 transitions, 930 flow [2024-11-07 19:06:53,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:06:53,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:06:53,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2024-11-07 19:06:53,425 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5527272727272727 [2024-11-07 19:06:53,426 INFO L175 Difference]: Start difference. First operand has 90 places, 83 transitions, 445 flow. Second operand 5 states and 152 transitions. [2024-11-07 19:06:53,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 133 transitions, 930 flow [2024-11-07 19:06:53,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 133 transitions, 923 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-07 19:06:53,442 INFO L231 Difference]: Finished difference. Result has 96 places, 88 transitions, 519 flow [2024-11-07 19:06:53,442 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=519, PETRI_PLACES=96, PETRI_TRANSITIONS=88} [2024-11-07 19:06:53,442 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 46 predicate places. [2024-11-07 19:06:53,442 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 88 transitions, 519 flow [2024-11-07 19:06:53,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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 19:06:53,443 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:06:53,446 INFO L204 CegarLoopForPetriNet]: 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] [2024-11-07 19:06:53,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 19:06:53,446 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:06:53,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:06:53,447 INFO L85 PathProgramCache]: Analyzing trace with hash -716823146, now seen corresponding path program 1 times [2024-11-07 19:06:53,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:06:53,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787558780] [2024-11-07 19:06:53,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:06:53,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:06:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:06:54,815 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 19:06:54,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:06:54,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787558780] [2024-11-07 19:06:54,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787558780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:06:54,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:06:54,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 19:06:54,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757174177] [2024-11-07 19:06:54,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:06:54,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 19:06:54,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:06:54,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 19:06:54,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-07 19:06:54,855 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-07 19:06:54,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 519 flow. Second operand has 10 states, 10 states have (on average 18.9) internal successors, (189), 10 states have internal predecessors, (189), 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 19:06:54,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:06:54,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-07 19:06:54,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:06:55,832 INFO L124 PetriNetUnfolderBase]: 4726/9653 cut-off events. [2024-11-07 19:06:55,832 INFO L125 PetriNetUnfolderBase]: For 8702/8702 co-relation queries the response was YES. [2024-11-07 19:06:55,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26990 conditions, 9653 events. 4726/9653 cut-off events. For 8702/8702 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 67192 event pairs, 1022 based on Foata normal form. 24/9463 useless extension candidates. Maximal degree in co-relation 21485. Up to 4678 conditions per place. [2024-11-07 19:06:55,900 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 181 selfloop transitions, 24 changer transitions 0/219 dead transitions. [2024-11-07 19:06:55,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 219 transitions, 1565 flow [2024-11-07 19:06:55,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 19:06:55,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-07 19:06:55,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 316 transitions. [2024-11-07 19:06:55,901 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5223140495867769 [2024-11-07 19:06:55,902 INFO L175 Difference]: Start difference. First operand has 96 places, 88 transitions, 519 flow. Second operand 11 states and 316 transitions. [2024-11-07 19:06:55,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 219 transitions, 1565 flow [2024-11-07 19:06:55,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 219 transitions, 1563 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:06:55,926 INFO L231 Difference]: Finished difference. Result has 111 places, 105 transitions, 733 flow [2024-11-07 19:06:55,926 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=733, PETRI_PLACES=111, PETRI_TRANSITIONS=105} [2024-11-07 19:06:55,927 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 61 predicate places. [2024-11-07 19:06:55,927 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 105 transitions, 733 flow [2024-11-07 19:06:55,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.9) internal successors, (189), 10 states have internal predecessors, (189), 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 19:06:55,927 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:06:55,927 INFO L204 CegarLoopForPetriNet]: 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 19:06:55,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 19:06:55,927 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:06:55,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:06:55,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1731689586, now seen corresponding path program 1 times [2024-11-07 19:06:55,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:06:55,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917389146] [2024-11-07 19:06:55,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:06:55,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:06:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:06:56,024 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 19:06:56,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:06:56,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917389146] [2024-11-07 19:06:56,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917389146] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:06:56,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108637483] [2024-11-07 19:06:56,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:06:56,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:06:56,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:06:56,026 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 19:06:56,032 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 19:06:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:06:56,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 1794 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 19:06:56,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:06:56,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 19:06:56,308 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:06:56,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108637483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:06:56,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 19:06:56,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2024-11-07 19:06:56,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75828312] [2024-11-07 19:06:56,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:06:56,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:06:56,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:06:56,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:06:56,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:06:56,312 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-07 19:06:56,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 105 transitions, 733 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 19:06:56,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:06:56,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-07 19:06:56,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:06:57,030 INFO L124 PetriNetUnfolderBase]: 4723/9547 cut-off events. [2024-11-07 19:06:57,030 INFO L125 PetriNetUnfolderBase]: For 11746/11746 co-relation queries the response was YES. [2024-11-07 19:06:57,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28269 conditions, 9547 events. 4723/9547 cut-off events. For 11746/11746 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 67477 event pairs, 3763 based on Foata normal form. 31/9348 useless extension candidates. Maximal degree in co-relation 22580. Up to 8111 conditions per place. [2024-11-07 19:06:57,101 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 89 selfloop transitions, 1 changer transitions 2/104 dead transitions. [2024-11-07 19:06:57,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 104 transitions, 913 flow [2024-11-07 19:06:57,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:06:57,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:06:57,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-11-07 19:06:57,102 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2024-11-07 19:06:57,102 INFO L175 Difference]: Start difference. First operand has 111 places, 105 transitions, 733 flow. Second operand 3 states and 80 transitions. [2024-11-07 19:06:57,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 104 transitions, 913 flow [2024-11-07 19:06:57,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 104 transitions, 895 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-11-07 19:06:57,134 INFO L231 Difference]: Finished difference. Result has 109 places, 102 transitions, 710 flow [2024-11-07 19:06:57,134 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=710, PETRI_PLACES=109, PETRI_TRANSITIONS=102} [2024-11-07 19:06:57,134 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 59 predicate places. [2024-11-07 19:06:57,134 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 102 transitions, 710 flow [2024-11-07 19:06:57,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 19:06:57,134 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:06:57,134 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:06:57,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 19:06:57,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:06:57,335 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:06:57,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:06:57,335 INFO L85 PathProgramCache]: Analyzing trace with hash -243320473, now seen corresponding path program 1 times [2024-11-07 19:06:57,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:06:57,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935852561] [2024-11-07 19:06:57,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:06:57,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:06:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:06:57,844 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:06:57,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:06:57,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935852561] [2024-11-07 19:06:57,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935852561] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:06:57,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368620558] [2024-11-07 19:06:57,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:06:57,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:06:57,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:06:57,846 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 19:06:57,848 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 19:06:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:06:58,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 1839 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-07 19:06:58,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:06:58,276 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:06:58,276 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:06:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:06:58,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368620558] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:06:58,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 19:06:58,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2024-11-07 19:06:58,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738772036] [2024-11-07 19:06:58,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 19:06:58,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 19:06:58,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:06:58,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 19:06:58,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-11-07 19:06:58,533 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-07 19:06:58,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 102 transitions, 710 flow. Second operand has 18 states, 18 states have (on average 20.166666666666668) internal successors, (363), 18 states have internal predecessors, (363), 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 19:06:58,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:06:58,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-07 19:06:58,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:07:01,132 INFO L124 PetriNetUnfolderBase]: 9891/19922 cut-off events. [2024-11-07 19:07:01,133 INFO L125 PetriNetUnfolderBase]: For 24100/24100 co-relation queries the response was YES. [2024-11-07 19:07:01,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58590 conditions, 19922 events. 9891/19922 cut-off events. For 24100/24100 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 154721 event pairs, 1511 based on Foata normal form. 181/19617 useless extension candidates. Maximal degree in co-relation 58548. Up to 3188 conditions per place. [2024-11-07 19:07:01,311 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 357 selfloop transitions, 91 changer transitions 0/459 dead transitions. [2024-11-07 19:07:01,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 459 transitions, 3593 flow [2024-11-07 19:07:01,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-07 19:07:01,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-07 19:07:01,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 638 transitions. [2024-11-07 19:07:01,314 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2024-11-07 19:07:01,314 INFO L175 Difference]: Start difference. First operand has 109 places, 102 transitions, 710 flow. Second operand 21 states and 638 transitions. [2024-11-07 19:07:01,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 459 transitions, 3593 flow [2024-11-07 19:07:01,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 459 transitions, 3590 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-07 19:07:01,393 INFO L231 Difference]: Finished difference. Result has 142 places, 167 transitions, 1658 flow [2024-11-07 19:07:01,394 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1658, PETRI_PLACES=142, PETRI_TRANSITIONS=167} [2024-11-07 19:07:01,394 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 92 predicate places. [2024-11-07 19:07:01,394 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 167 transitions, 1658 flow [2024-11-07 19:07:01,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 20.166666666666668) internal successors, (363), 18 states have internal predecessors, (363), 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 19:07:01,394 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:07:01,395 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:07:01,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 19:07:01,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:07:01,595 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:07:01,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:07:01,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1208330688, now seen corresponding path program 1 times [2024-11-07 19:07:01,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:07:01,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498595082] [2024-11-07 19:07:01,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:07:01,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:07:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:07:01,900 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:07:01,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:07:01,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498595082] [2024-11-07 19:07:01,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498595082] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:07:01,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913787617] [2024-11-07 19:07:01,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:07:01,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:07:01,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:07:01,903 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 19:07:01,904 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 19:07:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:07:02,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 1836 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 19:07:02,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:07:02,279 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:07:02,279 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:07:02,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:07:02,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913787617] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:07:02,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 19:07:02,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-07 19:07:02,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908593602] [2024-11-07 19:07:02,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 19:07:02,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:07:02,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:07:02,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:07:02,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:07:02,320 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-07 19:07:02,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 167 transitions, 1658 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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 19:07:02,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:07:02,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-07 19:07:02,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:07:04,595 INFO L124 PetriNetUnfolderBase]: 8507/17296 cut-off events. [2024-11-07 19:07:04,595 INFO L125 PetriNetUnfolderBase]: For 38133/38133 co-relation queries the response was YES. [2024-11-07 19:07:04,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55240 conditions, 17296 events. 8507/17296 cut-off events. For 38133/38133 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 127468 event pairs, 2450 based on Foata normal form. 14/16895 useless extension candidates. Maximal degree in co-relation 55181. Up to 12999 conditions per place. [2024-11-07 19:07:04,743 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 171 selfloop transitions, 13 changer transitions 0/196 dead transitions. [2024-11-07 19:07:04,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 196 transitions, 2058 flow [2024-11-07 19:07:04,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:07:04,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:07:04,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2024-11-07 19:07:04,745 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-11-07 19:07:04,745 INFO L175 Difference]: Start difference. First operand has 142 places, 167 transitions, 1658 flow. Second operand 5 states and 165 transitions. [2024-11-07 19:07:04,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 196 transitions, 2058 flow [2024-11-07 19:07:04,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 196 transitions, 1957 flow, removed 46 selfloop flow, removed 3 redundant places. [2024-11-07 19:07:04,864 INFO L231 Difference]: Finished difference. Result has 145 places, 152 transitions, 1446 flow [2024-11-07 19:07:04,865 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1377, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1446, PETRI_PLACES=145, PETRI_TRANSITIONS=152} [2024-11-07 19:07:04,865 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 95 predicate places. [2024-11-07 19:07:04,865 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 152 transitions, 1446 flow [2024-11-07 19:07:04,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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 19:07:04,865 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:07:04,865 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:07:04,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 19:07:05,065 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,SelfDestructingSolverStorable15 [2024-11-07 19:07:05,066 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:07:05,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:07:05,066 INFO L85 PathProgramCache]: Analyzing trace with hash -184443234, now seen corresponding path program 1 times [2024-11-07 19:07:05,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:07:05,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965160004] [2024-11-07 19:07:05,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:07:05,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:07:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:07:05,185 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:07:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:07:05,282 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 19:07:05,282 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:07:05,283 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2024-11-07 19:07:05,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2024-11-07 19:07:05,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2024-11-07 19:07:05,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2024-11-07 19:07:05,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2024-11-07 19:07:05,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2024-11-07 19:07:05,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2024-11-07 19:07:05,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2024-11-07 19:07:05,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2024-11-07 19:07:05,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2024-11-07 19:07:05,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2024-11-07 19:07:05,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2024-11-07 19:07:05,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2024-11-07 19:07:05,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2024-11-07 19:07:05,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2024-11-07 19:07:05,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 19:07:05,285 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:07:05,352 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 19:07:05,353 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 19:07:05,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:07:05 BasicIcfg [2024-11-07 19:07:05,358 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 19:07:05,359 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 19:07:05,359 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 19:07:05,359 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 19:07:05,360 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:06:42" (3/4) ... [2024-11-07 19:07:05,361 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 19:07:05,362 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 19:07:05,363 INFO L158 Benchmark]: Toolchain (without parser) took 35074.44ms. Allocated memory was 117.4MB in the beginning and 8.2GB in the end (delta: 8.1GB). Free memory was 89.6MB in the beginning and 7.8GB in the end (delta: -7.7GB). Peak memory consumption was 313.3MB. Max. memory is 16.1GB. [2024-11-07 19:07:05,364 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:07:05,364 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.51ms. Allocated memory is still 117.4MB. Free memory was 89.5MB in the beginning and 52.0MB in the end (delta: 37.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-07 19:07:05,364 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.64ms. Allocated memory is still 117.4MB. Free memory was 52.0MB in the beginning and 85.7MB in the end (delta: -33.6MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2024-11-07 19:07:05,364 INFO L158 Benchmark]: Boogie Preprocessor took 86.73ms. Allocated memory is still 117.4MB. Free memory was 85.7MB in the beginning and 78.0MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 19:07:05,365 INFO L158 Benchmark]: RCFGBuilder took 11292.66ms. Allocated memory was 117.4MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 77.5MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-07 19:07:05,365 INFO L158 Benchmark]: TraceAbstraction took 23097.44ms. Allocated memory was 2.9GB in the beginning and 8.2GB in the end (delta: 5.3GB). Free memory was 1.5GB in the beginning and 7.8GB in the end (delta: -6.4GB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:07:05,365 INFO L158 Benchmark]: Witness Printer took 3.17ms. Allocated memory is still 8.2GB. Free memory was 7.8GB in the beginning and 7.8GB in the end (delta: 158.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:07:05,366 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 489.51ms. Allocated memory is still 117.4MB. Free memory was 89.5MB in the beginning and 52.0MB in the end (delta: 37.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.64ms. Allocated memory is still 117.4MB. Free memory was 52.0MB in the beginning and 85.7MB in the end (delta: -33.6MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.73ms. Allocated memory is still 117.4MB. Free memory was 85.7MB in the beginning and 78.0MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 11292.66ms. Allocated memory was 117.4MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 77.5MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * TraceAbstraction took 23097.44ms. Allocated memory was 2.9GB in the beginning and 8.2GB in the end (delta: 5.3GB). Free memory was 1.5GB in the beginning and 7.8GB in the end (delta: -6.4GB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.17ms. Allocated memory is still 8.2GB. Free memory was 7.8GB in the beginning and 7.8GB in the end (delta: 158.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 20. Possible FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1020] 0 pthread_t id1, id2; [L1022] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-3, m={4:0}, top=0] [L989] 1 int i; [L990] 1 unsigned int tmp; [L991] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L991] COND TRUE 1 i<(800) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1023] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-3, id2=-2, m={4:0}, top=0] [L1005] 2 int i; [L1006] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L994] 1 tmp = __VERIFIER_nondet_uint() [L995] CALL 1 assume_abort_if_not(tmp < (800)) [L23] COND FALSE 1 !(!cond) [L995] RET 1 assume_abort_if_not(tmp < (800)) [L996] CALL, EXPR 1 push(arr,tmp) [L961] COND FALSE 1 !(top==(800)) [L968] CALL, EXPR 1 get_top() [L953] 1 return top; [L968] RET, EXPR 1 get_top() [L968] 1 stack[get_top()] = x [L969] CALL 1 inc_top() [L945] 1 top++ [L969] RET 1 inc_top() [L971] 1 return 0; VAL [\old(stack)={3:0}, \old(x)=799, \result=0, arr={3:0}, flag=0, m={4:0}, stack={3:0}, top=1, x=799] [L1006] COND TRUE 2 i<(800) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=1] [L996] RET, EXPR 1 push(arr,tmp) [L996] COND FALSE 1 !(push(arr,tmp)==(-1)) [L998] 1 flag=(1) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=799, top=1] [L1009] COND TRUE 2 \read(flag) [L1011] CALL, EXPR 2 pop(arr) [L975] CALL, EXPR 2 get_top() [L953] 2 return top; [L975] RET, EXPR 2 get_top() [L975] COND FALSE 2 !(get_top()==0) [L982] CALL 2 dec_top() [L949] 2 top-- [L982] RET 2 dec_top() [L983] CALL, EXPR 2 get_top() [L953] 2 return top; [L983] RET, EXPR 2 get_top() [L983] EXPR 2 stack[get_top()] [L983] 2 return stack[get_top()]; [L1011] RET, EXPR 2 pop(arr) [L1011] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1006] 2 i++ VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1006] COND TRUE 2 i<(800) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1009] COND TRUE 2 \read(flag) [L1011] CALL, EXPR 2 pop(arr) [L975] CALL, EXPR 2 get_top() [L953] 2 return top; [L975] RET, EXPR 2 get_top() [L975] COND TRUE 2 get_top()==0 [L978] 2 return (-2); VAL [\old(stack)={3:0}, \result=-2, arr={3:0}, flag=1, m={4:0}, stack={3:0}, top=0] [L1011] RET, EXPR 2 pop(arr) [L1011] COND TRUE 2 !(pop(arr)!=(-2)) [L1012] CALL 2 error() [L941] CALL 2 reach_error() [L20] COND FALSE 2 !(0) VAL [arr={3:0}, flag=1, m={4:0}, top=0] [L20] 2 __assert_fail ("0", "stack_longest-1.c", 3, __extension__ __PRETTY_FUNCTION__) VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1018]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 85 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 22.9s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1508 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1454 mSDsluCounter, 181 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 168 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4550 IncrementalHoareTripleChecker+Invalid, 4593 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 13 mSDtfsCounter, 4550 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 289 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1658occurred in iteration=15, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 452 NumberOfCodeBlocks, 452 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 3911 SizeOfPredicates, 14 NumberOfNonLiveVariables, 7227 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 23 InterpolantComputations, 13 PerfectInterpolantSequences, 7/65 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 19:07:05,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/pthread/stack_longest-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 529fe0895c01c52d9b18b51c32204a307faf547c0c07b22bc1a431308affcf90 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:07:08,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:07:08,099 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-07 19:07:08,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:07:08,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:07:08,129 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:07:08,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:07:08,131 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:07:08,132 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:07:08,132 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:07:08,133 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:07:08,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:07:08,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:07:08,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:07:08,133 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:07:08,133 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:07:08,133 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:07:08,134 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:07:08,134 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:07:08,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:07:08,134 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:07:08,134 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:07:08,134 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:07:08,134 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:07:08,134 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:07:08,135 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 19:07:08,135 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:07:08,135 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 19:07:08,135 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:07:08,135 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:07:08,135 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:07:08,135 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:07:08,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:07:08,135 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:07:08,136 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:07:08,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:07:08,136 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:07:08,136 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:07:08,136 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 19:07:08,136 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 19:07:08,136 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:07:08,136 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:07:08,137 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:07:08,137 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:07:08,137 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 -> 529fe0895c01c52d9b18b51c32204a307faf547c0c07b22bc1a431308affcf90 [2024-11-07 19:07:08,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:07:08,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:07:08,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:07:08,391 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:07:08,392 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:07:08,393 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack_longest-1.i [2024-11-07 19:07:09,573 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:07:09,843 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:07:09,844 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/stack_longest-1.i [2024-11-07 19:07:09,861 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6de791d87/605a901d69b4465ba22a3c6e0f25e37e/FLAGf7bfac337 [2024-11-07 19:07:10,151 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6de791d87/605a901d69b4465ba22a3c6e0f25e37e [2024-11-07 19:07:10,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:07:10,154 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:07:10,156 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:07:10,156 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:07:10,159 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:07:10,160 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:07:10" (1/1) ... [2024-11-07 19:07:10,162 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2792a018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:10, skipping insertion in model container [2024-11-07 19:07:10,162 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:07:10" (1/1) ... [2024-11-07 19:07:10,198 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:07:10,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:07:10,485 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:07:10,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:07:10,623 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:07:10,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:10 WrapperNode [2024-11-07 19:07:10,624 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:07:10,625 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:07:10,625 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:07:10,625 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:07:10,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:10" (1/1) ... [2024-11-07 19:07:10,663 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:10" (1/1) ... [2024-11-07 19:07:10,740 INFO L138 Inliner]: procedures = 281, calls = 832, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 952 [2024-11-07 19:07:10,741 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:07:10,741 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:07:10,741 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:07:10,741 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:07:10,749 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:10" (1/1) ... [2024-11-07 19:07:10,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:10" (1/1) ... [2024-11-07 19:07:10,757 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:10" (1/1) ... [2024-11-07 19:07:10,788 INFO L175 MemorySlicer]: Split 809 memory accesses to 3 slices as follows [2, 802, 5]. 99 percent of accesses are in the largest equivalence class. The 807 initializations are split as follows [2, 800, 5]. The 1 writes are split as follows [0, 1, 0]. [2024-11-07 19:07:10,789 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:10" (1/1) ... [2024-11-07 19:07:10,789 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:10" (1/1) ... [2024-11-07 19:07:10,817 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:10" (1/1) ... [2024-11-07 19:07:10,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:10" (1/1) ... [2024-11-07 19:07:10,833 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:10" (1/1) ... [2024-11-07 19:07:10,838 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:10" (1/1) ... [2024-11-07 19:07:10,845 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:07:10,845 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:07:10,845 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:07:10,846 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:07:10,846 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:10" (1/1) ... [2024-11-07 19:07:10,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:07:10,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:07:10,874 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 19:07:10,879 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 19:07:10,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 19:07:10,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 19:07:10,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-07 19:07:10,894 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-07 19:07:10,894 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-07 19:07:10,894 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-07 19:07:10,894 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-07 19:07:10,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 19:07:10,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 19:07:10,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-07 19:07:10,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 19:07:10,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 19:07:10,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-07 19:07:10,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-07 19:07:10,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-07 19:07:10,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-07 19:07:10,894 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-07 19:07:10,894 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-07 19:07:10,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:07:10,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:07:10,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:07:10,896 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-07 19:07:11,015 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:07:11,016 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:07:12,179 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 19:07:12,179 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:07:28,783 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:07:28,785 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 19:07:28,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:07:28 BoogieIcfgContainer [2024-11-07 19:07:28,786 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:07:28,787 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:07:28,788 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:07:28,790 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:07:28,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:07:10" (1/3) ... [2024-11-07 19:07:28,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a574f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:07:28, skipping insertion in model container [2024-11-07 19:07:28,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:10" (2/3) ... [2024-11-07 19:07:28,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a574f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:07:28, skipping insertion in model container [2024-11-07 19:07:28,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:07:28" (3/3) ... [2024-11-07 19:07:28,792 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longest-1.i [2024-11-07 19:07:28,802 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:07:28,802 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-07 19:07:28,803 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 19:07:28,870 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-07 19:07:28,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 55 transitions, 124 flow [2024-11-07 19:07:28,942 INFO L124 PetriNetUnfolderBase]: 9/53 cut-off events. [2024-11-07 19:07:28,945 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 19:07:28,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 53 events. 9/53 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 130 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 48. Up to 3 conditions per place. [2024-11-07 19:07:28,949 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 55 transitions, 124 flow [2024-11-07 19:07:28,952 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 52 transitions, 116 flow [2024-11-07 19:07:28,960 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:07:28,969 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;@34d2b319, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:07:28,970 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-07 19:07:28,994 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:07:28,994 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2024-11-07 19:07:28,994 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 19:07:28,994 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:07:28,995 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:07:28,995 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:07:28,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:07:28,999 INFO L85 PathProgramCache]: Analyzing trace with hash 120974649, now seen corresponding path program 1 times [2024-11-07 19:07:29,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:07:29,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [254501337] [2024-11-07 19:07:29,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:07:29,011 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:07:29,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:07:29,013 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:07:29,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 19:07:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:07:29,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 19:07:29,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:07:29,385 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 19:07:29,387 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:07:29,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:07:29,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [254501337] [2024-11-07 19:07:29,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [254501337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:07:29,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:07:29,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:07:29,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131992558] [2024-11-07 19:07:29,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:07:29,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:07:29,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:07:29,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:07:29,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:07:29,434 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-07 19:07:29,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 52 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 19:07:29,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:07:29,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-07 19:07:29,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:07:29,777 INFO L124 PetriNetUnfolderBase]: 459/880 cut-off events. [2024-11-07 19:07:29,777 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-11-07 19:07:29,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1652 conditions, 880 events. 459/880 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4540 event pairs, 245 based on Foata normal form. 94/846 useless extension candidates. Maximal degree in co-relation 1574. Up to 520 conditions per place. [2024-11-07 19:07:29,783 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 43 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2024-11-07 19:07:29,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 227 flow [2024-11-07 19:07:29,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:07:29,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:07:29,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2024-11-07 19:07:29,794 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5318181818181819 [2024-11-07 19:07:29,795 INFO L175 Difference]: Start difference. First operand has 50 places, 52 transitions, 116 flow. Second operand 4 states and 117 transitions. [2024-11-07 19:07:29,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 227 flow [2024-11-07 19:07:29,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 217 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 19:07:29,804 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 100 flow [2024-11-07 19:07:29,807 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2024-11-07 19:07:29,809 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2024-11-07 19:07:29,810 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 100 flow [2024-11-07 19:07:29,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 19:07:29,810 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:07:29,810 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:07:29,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-07 19:07:30,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:07:30,012 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:07:30,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:07:30,012 INFO L85 PathProgramCache]: Analyzing trace with hash 120974650, now seen corresponding path program 1 times [2024-11-07 19:07:30,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:07:30,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080363946] [2024-11-07 19:07:30,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:07:30,014 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:07:30,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:07:30,016 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:07:30,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 19:07:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:07:30,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 19:07:30,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:07:30,363 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 19:07:30,364 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:07:30,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:07:30,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080363946] [2024-11-07 19:07:30,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080363946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:07:30,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:07:30,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:07:30,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417860167] [2024-11-07 19:07:30,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:07:30,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:07:30,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:07:30,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:07:30,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:07:30,393 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-07 19:07:30,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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 19:07:30,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:07:30,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-07 19:07:30,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:07:30,829 INFO L124 PetriNetUnfolderBase]: 755/1387 cut-off events. [2024-11-07 19:07:30,829 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2024-11-07 19:07:30,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2685 conditions, 1387 events. 755/1387 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7439 event pairs, 125 based on Foata normal form. 0/1207 useless extension candidates. Maximal degree in co-relation 810. Up to 848 conditions per place. [2024-11-07 19:07:30,840 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 87 selfloop transitions, 8 changer transitions 0/108 dead transitions. [2024-11-07 19:07:30,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 108 transitions, 423 flow [2024-11-07 19:07:30,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:07:30,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:07:30,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2024-11-07 19:07:30,842 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5878787878787879 [2024-11-07 19:07:30,842 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 100 flow. Second operand 6 states and 194 transitions. [2024-11-07 19:07:30,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 108 transitions, 423 flow [2024-11-07 19:07:30,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 108 transitions, 415 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:07:30,846 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 153 flow [2024-11-07 19:07:30,846 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=153, PETRI_PLACES=52, PETRI_TRANSITIONS=53} [2024-11-07 19:07:30,847 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2024-11-07 19:07:30,847 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 153 flow [2024-11-07 19:07:30,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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 19:07:30,849 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:07:30,849 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:07:30,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-07 19:07:31,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:07:31,050 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:07:31,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:07:31,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1251699229, now seen corresponding path program 1 times [2024-11-07 19:07:31,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:07:31,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106800761] [2024-11-07 19:07:31,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:07:31,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:07:31,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:07:31,054 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:07:31,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 19:07:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:07:31,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 19:07:31,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:07:31,281 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 19:07:31,281 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:07:31,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:07:31,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106800761] [2024-11-07 19:07:31,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2106800761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:07:31,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:07:31,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:07:31,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303430439] [2024-11-07 19:07:31,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:07:31,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:07:31,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:07:31,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:07:31,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:07:31,285 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 55 [2024-11-07 19:07:31,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 53 transitions, 153 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:07:31,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:07:31,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 55 [2024-11-07 19:07:31,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:07:31,538 INFO L124 PetriNetUnfolderBase]: 793/1518 cut-off events. [2024-11-07 19:07:31,538 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2024-11-07 19:07:31,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3136 conditions, 1518 events. 793/1518 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7890 event pairs, 348 based on Foata normal form. 0/1370 useless extension candidates. Maximal degree in co-relation 3051. Up to 734 conditions per place. [2024-11-07 19:07:31,545 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 56 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2024-11-07 19:07:31,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 303 flow [2024-11-07 19:07:31,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:07:31,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:07:31,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-11-07 19:07:31,547 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2024-11-07 19:07:31,547 INFO L175 Difference]: Start difference. First operand has 52 places, 53 transitions, 153 flow. Second operand 3 states and 102 transitions. [2024-11-07 19:07:31,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 303 flow [2024-11-07 19:07:31,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 301 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-07 19:07:31,550 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 148 flow [2024-11-07 19:07:31,551 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2024-11-07 19:07:31,551 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2024-11-07 19:07:31,551 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 148 flow [2024-11-07 19:07:31,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:07:31,552 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:07:31,552 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:07:31,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 19:07:31,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:07:31,752 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:07:31,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:07:31,753 INFO L85 PathProgramCache]: Analyzing trace with hash 2003824447, now seen corresponding path program 1 times [2024-11-07 19:07:31,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:07:31,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626930979] [2024-11-07 19:07:31,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:07:31,754 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:07:31,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:07:31,756 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:07:31,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 19:07:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:07:31,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:07:31,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:07:31,986 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 19:07:31,986 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:07:31,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:07:31,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1626930979] [2024-11-07 19:07:31,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1626930979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:07:31,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:07:31,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:07:31,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875589645] [2024-11-07 19:07:31,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:07:31,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:07:31,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:07:31,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:07:31,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:07:31,987 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-07 19:07:31,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 19:07:31,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:07:31,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-07 19:07:31,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:07:32,329 INFO L124 PetriNetUnfolderBase]: 1096/2098 cut-off events. [2024-11-07 19:07:32,329 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2024-11-07 19:07:32,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4357 conditions, 2098 events. 1096/2098 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 12125 event pairs, 518 based on Foata normal form. 0/1954 useless extension candidates. Maximal degree in co-relation 1577. Up to 1077 conditions per place. [2024-11-07 19:07:32,339 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 68 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2024-11-07 19:07:32,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 89 transitions, 386 flow [2024-11-07 19:07:32,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:07:32,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:07:32,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2024-11-07 19:07:32,340 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6318181818181818 [2024-11-07 19:07:32,340 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 148 flow. Second operand 4 states and 139 transitions. [2024-11-07 19:07:32,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 89 transitions, 386 flow [2024-11-07 19:07:32,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 89 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:07:32,344 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 175 flow [2024-11-07 19:07:32,344 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2024-11-07 19:07:32,345 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2024-11-07 19:07:32,345 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 175 flow [2024-11-07 19:07:32,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 19:07:32,345 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:07:32,345 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:07:32,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-07 19:07:32,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:07:32,546 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:07:32,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:07:32,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1145046265, now seen corresponding path program 1 times [2024-11-07 19:07:32,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:07:32,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328630351] [2024-11-07 19:07:32,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:07:32,547 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:07:32,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:07:32,549 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:07:32,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 19:07:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:07:32,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 19:07:32,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:07:32,761 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 19:07:32,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:07:32,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:07:32,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328630351] [2024-11-07 19:07:32,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328630351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:07:32,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:07:32,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:07:32,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733679559] [2024-11-07 19:07:32,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:07:32,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:07:32,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:07:32,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:07:32,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:07:32,765 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-07 19:07:32,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 175 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 19:07:32,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:07:32,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-07 19:07:32,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:07:33,029 INFO L124 PetriNetUnfolderBase]: 1171/2183 cut-off events. [2024-11-07 19:07:33,029 INFO L125 PetriNetUnfolderBase]: For 310/310 co-relation queries the response was YES. [2024-11-07 19:07:33,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4967 conditions, 2183 events. 1171/2183 cut-off events. For 310/310 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 12583 event pairs, 599 based on Foata normal form. 12/2061 useless extension candidates. Maximal degree in co-relation 2248. Up to 1568 conditions per place. [2024-11-07 19:07:33,039 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 55 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2024-11-07 19:07:33,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 73 transitions, 342 flow [2024-11-07 19:07:33,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:07:33,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:07:33,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-11-07 19:07:33,041 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2024-11-07 19:07:33,041 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 175 flow. Second operand 3 states and 106 transitions. [2024-11-07 19:07:33,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 73 transitions, 342 flow [2024-11-07 19:07:33,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 73 transitions, 337 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-07 19:07:33,047 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 182 flow [2024-11-07 19:07:33,047 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2024-11-07 19:07:33,048 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 9 predicate places. [2024-11-07 19:07:33,048 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 182 flow [2024-11-07 19:07:33,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 19:07:33,048 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:07:33,049 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:07:33,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-07 19:07:33,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:07:33,250 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:07:33,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:07:33,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1315697714, now seen corresponding path program 1 times [2024-11-07 19:07:33,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:07:33,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300828070] [2024-11-07 19:07:33,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:07:33,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:07:33,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:07:33,254 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:07:33,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-07 19:07:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:07:33,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 19:07:33,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:07:33,649 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:07:33,649 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:07:33,875 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:07:33,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:07:33,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300828070] [2024-11-07 19:07:33,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300828070] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:07:33,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 19:07:33,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-11-07 19:07:33,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003356949] [2024-11-07 19:07:33,875 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 19:07:33,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 19:07:33,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:07:33,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 19:07:33,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-07 19:07:33,975 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-07 19:07:33,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 182 flow. Second operand has 10 states, 10 states have (on average 19.0) internal successors, (190), 10 states have internal predecessors, (190), 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 19:07:33,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:07:33,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-07 19:07:33,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:07:37,739 INFO L124 PetriNetUnfolderBase]: 5619/10718 cut-off events. [2024-11-07 19:07:37,739 INFO L125 PetriNetUnfolderBase]: For 2730/2730 co-relation queries the response was YES. [2024-11-07 19:07:37,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24293 conditions, 10718 events. 5619/10718 cut-off events. For 2730/2730 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 76155 event pairs, 736 based on Foata normal form. 264/10346 useless extension candidates. Maximal degree in co-relation 10831. Up to 1905 conditions per place. [2024-11-07 19:07:37,816 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 327 selfloop transitions, 45 changer transitions 0/387 dead transitions. [2024-11-07 19:07:37,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 387 transitions, 1861 flow [2024-11-07 19:07:37,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 19:07:37,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-11-07 19:07:37,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 685 transitions. [2024-11-07 19:07:37,819 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2024-11-07 19:07:37,819 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 182 flow. Second operand 20 states and 685 transitions. [2024-11-07 19:07:37,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 387 transitions, 1861 flow [2024-11-07 19:07:37,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 387 transitions, 1856 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:07:37,835 INFO L231 Difference]: Finished difference. Result has 92 places, 99 transitions, 598 flow [2024-11-07 19:07:37,835 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=598, PETRI_PLACES=92, PETRI_TRANSITIONS=99} [2024-11-07 19:07:37,837 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 42 predicate places. [2024-11-07 19:07:37,837 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 99 transitions, 598 flow [2024-11-07 19:07:37,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.0) internal successors, (190), 10 states have internal predecessors, (190), 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 19:07:37,837 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:07:37,838 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:07:37,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-07 19:07:38,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:07:38,038 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:07:38,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:07:38,038 INFO L85 PathProgramCache]: Analyzing trace with hash 789164903, now seen corresponding path program 1 times [2024-11-07 19:07:38,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:07:38,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317829079] [2024-11-07 19:07:38,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:07:38,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:07:38,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:07:38,041 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:07:38,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-07 19:07:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:07:38,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:07:38,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:07:38,259 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 9 [2024-11-07 19:07:38,275 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 19:07:38,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:07:38,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:07:38,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [317829079] [2024-11-07 19:07:38,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [317829079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:07:38,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:07:38,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:07:38,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455138741] [2024-11-07 19:07:38,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:07:38,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:07:38,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:07:38,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:07:38,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:07:38,276 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-07 19:07:38,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 99 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 19:07:38,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:07:38,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-07 19:07:38,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:07:38,822 INFO L124 PetriNetUnfolderBase]: 2678/5616 cut-off events. [2024-11-07 19:07:38,822 INFO L125 PetriNetUnfolderBase]: For 3568/3568 co-relation queries the response was YES. [2024-11-07 19:07:38,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13890 conditions, 5616 events. 2678/5616 cut-off events. For 3568/3568 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 36064 event pairs, 589 based on Foata normal form. 364/5797 useless extension candidates. Maximal degree in co-relation 13556. Up to 3210 conditions per place. [2024-11-07 19:07:38,860 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 70 selfloop transitions, 4 changer transitions 0/90 dead transitions. [2024-11-07 19:07:38,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 90 transitions, 615 flow [2024-11-07 19:07:38,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:07:38,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:07:38,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-11-07 19:07:38,861 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5696969696969697 [2024-11-07 19:07:38,861 INFO L175 Difference]: Start difference. First operand has 92 places, 99 transitions, 598 flow. Second operand 3 states and 94 transitions. [2024-11-07 19:07:38,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 90 transitions, 615 flow [2024-11-07 19:07:38,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 90 transitions, 567 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-11-07 19:07:38,878 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 395 flow [2024-11-07 19:07:38,879 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=395, PETRI_PLACES=83, PETRI_TRANSITIONS=79} [2024-11-07 19:07:38,879 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2024-11-07 19:07:38,879 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 395 flow [2024-11-07 19:07:38,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 19:07:38,880 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:07:38,880 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:07:38,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-07 19:07:39,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:07:39,080 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:07:39,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:07:39,081 INFO L85 PathProgramCache]: Analyzing trace with hash -2115802199, now seen corresponding path program 1 times [2024-11-07 19:07:39,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:07:39,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609280378] [2024-11-07 19:07:39,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:07:39,082 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:07:39,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:07:39,084 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:07:39,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-07 19:07:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:07:39,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 19:07:39,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:07:39,408 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 19:07:39,408 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:07:39,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:07:39,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1609280378] [2024-11-07 19:07:39,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1609280378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:07:39,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:07:39,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:07:39,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848584508] [2024-11-07 19:07:39,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:07:39,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:07:39,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:07:39,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:07:39,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:07:39,422 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-07 19:07:39,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 395 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 19:07:39,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:07:39,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-07 19:07:39,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:07:39,971 INFO L124 PetriNetUnfolderBase]: 2633/5401 cut-off events. [2024-11-07 19:07:39,971 INFO L125 PetriNetUnfolderBase]: For 2283/2283 co-relation queries the response was YES. [2024-11-07 19:07:39,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13634 conditions, 5401 events. 2633/5401 cut-off events. For 2283/2283 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 34363 event pairs, 1881 based on Foata normal form. 0/5240 useless extension candidates. Maximal degree in co-relation 11203. Up to 4039 conditions per place. [2024-11-07 19:07:40,017 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 65 selfloop transitions, 3 changer transitions 0/83 dead transitions. [2024-11-07 19:07:40,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 83 transitions, 546 flow [2024-11-07 19:07:40,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:07:40,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:07:40,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2024-11-07 19:07:40,020 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-11-07 19:07:40,020 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 395 flow. Second operand 4 states and 100 transitions. [2024-11-07 19:07:40,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 83 transitions, 546 flow [2024-11-07 19:07:40,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 83 transitions, 542 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:07:40,037 INFO L231 Difference]: Finished difference. Result has 84 places, 78 transitions, 395 flow [2024-11-07 19:07:40,037 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=395, PETRI_PLACES=84, PETRI_TRANSITIONS=78} [2024-11-07 19:07:40,040 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 34 predicate places. [2024-11-07 19:07:40,040 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 78 transitions, 395 flow [2024-11-07 19:07:40,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 19:07:40,041 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:07:40,041 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:07:40,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-07 19:07:40,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:07:40,241 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:07:40,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:07:40,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1467685320, now seen corresponding path program 1 times [2024-11-07 19:07:40,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:07:40,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966381780] [2024-11-07 19:07:40,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:07:40,243 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:07:40,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:07:40,246 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:07:40,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-07 19:07:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:07:40,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 19:07:40,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:07:40,714 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 19:07:40,714 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:07:40,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:07:40,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [966381780] [2024-11-07 19:07:40,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [966381780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:07:40,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:07:40,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:07:40,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996355168] [2024-11-07 19:07:40,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:07:40,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:07:40,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:07:40,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:07:40,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:07:40,733 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-07 19:07:40,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 78 transitions, 395 flow. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 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 19:07:40,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:07:40,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-07 19:07:40,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:07:41,426 INFO L124 PetriNetUnfolderBase]: 2709/5578 cut-off events. [2024-11-07 19:07:41,427 INFO L125 PetriNetUnfolderBase]: For 2652/2652 co-relation queries the response was YES. [2024-11-07 19:07:41,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13817 conditions, 5578 events. 2709/5578 cut-off events. For 2652/2652 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 35240 event pairs, 859 based on Foata normal form. 0/5396 useless extension candidates. Maximal degree in co-relation 11387. Up to 3583 conditions per place. [2024-11-07 19:07:41,455 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 107 selfloop transitions, 9 changer transitions 0/130 dead transitions. [2024-11-07 19:07:41,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 130 transitions, 792 flow [2024-11-07 19:07:41,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:07:41,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:07:41,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 185 transitions. [2024-11-07 19:07:41,457 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2024-11-07 19:07:41,457 INFO L175 Difference]: Start difference. First operand has 84 places, 78 transitions, 395 flow. Second operand 6 states and 185 transitions. [2024-11-07 19:07:41,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 130 transitions, 792 flow [2024-11-07 19:07:41,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 130 transitions, 778 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:07:41,469 INFO L231 Difference]: Finished difference. Result has 89 places, 81 transitions, 433 flow [2024-11-07 19:07:41,469 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=433, PETRI_PLACES=89, PETRI_TRANSITIONS=81} [2024-11-07 19:07:41,469 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 39 predicate places. [2024-11-07 19:07:41,470 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 81 transitions, 433 flow [2024-11-07 19:07:41,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 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 19:07:41,470 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:07:41,470 INFO L204 CegarLoopForPetriNet]: 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] [2024-11-07 19:07:41,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-07 19:07:41,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:07:41,671 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:07:41,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:07:41,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1572535323, now seen corresponding path program 1 times [2024-11-07 19:07:41,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:07:41,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711286844] [2024-11-07 19:07:41,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:07:41,672 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:07:41,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:07:41,674 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:07:41,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-07 19:07:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:07:41,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 19:07:41,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:07:41,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:07:41,904 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:07:41,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:07:41,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711286844] [2024-11-07 19:07:41,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1711286844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:07:41,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:07:41,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:07:41,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925692335] [2024-11-07 19:07:41,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:07:41,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:07:41,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:07:41,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:07:41,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:07:41,906 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-07 19:07:41,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 81 transitions, 433 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 19:07:41,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:07:41,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-07 19:07:41,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand