./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.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-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.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', '390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6']
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-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.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 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 19:16:50,412 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 19:16:50,510 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:16:50,518 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 19:16:50,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 19:16:50,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 19:16:50,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 19:16:50,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 19:16:50,552 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 19:16:50,552 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 19:16:50,552 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 19:16:50,553 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 19:16:50,554 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 19:16:50,554 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 19:16:50,554 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 19:16:50,554 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 19:16:50,554 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 19:16:50,554 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 19:16:50,554 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 19:16:50,554 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 19:16:50,554 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-07 19:16:50,554 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-07 19:16:50,554 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2024-11-07 19:16:50,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 19:16:50,554 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-07 19:16:50,555 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 19:16:50,555 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-07 19:16:50,555 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 19:16:50,555 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 19:16:50,555 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 19:16:50,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 19:16:50,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 19:16:50,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 19:16:50,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 19:16:50,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 19:16:50,555 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 19:16:50,555 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 19:16:50,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 19:16:50,555 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 19:16:50,555 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 19:16:50,555 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 19:16:50,556 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 19:16:50,556 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 -> 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6
[2024-11-07 19:16:50,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 19:16:50,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 19:16:50,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 19:16:50,860 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 19:16:50,861 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 19:16:50,862 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i
[2024-11-07 19:16:52,264 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 19:16:52,612 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 19:16:52,612 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i
[2024-11-07 19:16:52,633 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/955a4315f/c323e619466342d5b48ec5e734d2fb59/FLAG823433f70
[2024-11-07 19:16:52,655 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/955a4315f/c323e619466342d5b48ec5e734d2fb59
[2024-11-07 19:16:52,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 19:16:52,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 19:16:52,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 19:16:52,664 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 19:16:52,669 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 19:16:52,670 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:16:52" (1/1) ...
[2024-11-07 19:16:52,671 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8271b3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:16:52, skipping insertion in model container
[2024-11-07 19:16:52,673 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:16:52" (1/1) ...
[2024-11-07 19:16:52,720 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 19:16:53,045 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 19:16:53,055 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 19:16:53,115 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 19:16:53,151 INFO L204 MainTranslator]: Completed translation
[2024-11-07 19:16:53,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:16:53 WrapperNode
[2024-11-07 19:16:53,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 19:16:53,153 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 19:16:53,154 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 19:16:53,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 19:16:53,160 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:16:53" (1/1) ...
[2024-11-07 19:16:53,180 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:16:53" (1/1) ...
[2024-11-07 19:16:53,209 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 119
[2024-11-07 19:16:53,209 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 19:16:53,210 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 19:16:53,210 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 19:16:53,210 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 19:16:53,221 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:16:53" (1/1) ...
[2024-11-07 19:16:53,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:16:53" (1/1) ...
[2024-11-07 19:16:53,224 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:16:53" (1/1) ...
[2024-11-07 19:16:53,245 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-07 19:16:53,246 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:16:53" (1/1) ...
[2024-11-07 19:16:53,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:16:53" (1/1) ...
[2024-11-07 19:16:53,259 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:16:53" (1/1) ...
[2024-11-07 19:16:53,261 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:16:53" (1/1) ...
[2024-11-07 19:16:53,266 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:16:53" (1/1) ...
[2024-11-07 19:16:53,268 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:16:53" (1/1) ...
[2024-11-07 19:16:53,271 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 19:16:53,273 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 19:16:53,274 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 19:16:53,274 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 19:16:53,275 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:16:53" (1/1) ...
[2024-11-07 19:16:53,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 19:16:53,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 19:16:53,309 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:16:53,313 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:16:53,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-07 19:16:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 19:16:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-11-07 19:16:53,337 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-11-07 19:16:53,338 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-11-07 19:16:53,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-11-07 19:16:53,338 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2024-11-07 19:16:53,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2024-11-07 19:16:53,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 19:16:53,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-07 19:16:53,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 19:16:53,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 19:16:53,340 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:16:53,470 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 19:16:53,471 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 19:16:53,818 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-07 19:16:53,818 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 19:16:54,023 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 19:16:54,023 INFO L316 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-07 19:16:54,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:16:54 BoogieIcfgContainer
[2024-11-07 19:16:54,024 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 19:16:54,026 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 19:16:54,026 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 19:16:54,030 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 19:16:54,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:16:52" (1/3) ...
[2024-11-07 19:16:54,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a12a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:16:54, skipping insertion in model container
[2024-11-07 19:16:54,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:16:53" (2/3) ...
[2024-11-07 19:16:54,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a12a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:16:54, skipping insertion in model container
[2024-11-07 19:16:54,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:16:54" (3/3) ...
[2024-11-07 19:16:54,034 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i
[2024-11-07 19:16:54,049 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 19:16:54,050 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-11-07 19:16:54,050 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-07 19:16:54,117 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-07 19:16:54,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow
[2024-11-07 19:16:54,186 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events.
[2024-11-07 19:16:54,191 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-07 19:16:54,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 76 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place.
[2024-11-07 19:16:54,196 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow
[2024-11-07 19:16:54,199 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow
[2024-11-07 19:16:54,212 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 19:16:54,223 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;@be65c97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 19:16:54,224 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-11-07 19:16:54,233 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-07 19:16:54,233 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events.
[2024-11-07 19:16:54,233 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-07 19:16:54,235 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 19:16:54,235 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-11-07 19:16:54,236 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-07 19:16:54,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:16:54,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1620878703, now seen corresponding path program 1 times
[2024-11-07 19:16:54,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:16:54,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075978874]
[2024-11-07 19:16:54,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:16:54,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:16:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:16:54,811 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:16:54,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:16:54,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075978874]
[2024-11-07 19:16:54,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075978874] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:16:54,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:16:54,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-07 19:16:54,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191190721]
[2024-11-07 19:16:54,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:16:54,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 19:16:54,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:16:54,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 19:16:54,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 19:16:54,856 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 44
[2024-11-07 19:16:54,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:16:54,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 19:16:54,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 44
[2024-11-07 19:16:54,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 19:16:55,269 INFO L124 PetriNetUnfolderBase]: 603/1151 cut-off events.
[2024-11-07 19:16:55,270 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES.
[2024-11-07 19:16:55,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2110 conditions, 1151 events. 603/1151 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7355 event pairs, 96 based on Foata normal form. 72/1207 useless extension candidates. Maximal degree in co-relation 2099. Up to 742 conditions per place.
[2024-11-07 19:16:55,287 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 29 selfloop transitions, 2 changer transitions 2/50 dead transitions.
[2024-11-07 19:16:55,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 50 transitions, 178 flow
[2024-11-07 19:16:55,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 19:16:55,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-07 19:16:55,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions.
[2024-11-07 19:16:55,299 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7424242424242424
[2024-11-07 19:16:55,301 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 98 transitions.
[2024-11-07 19:16:55,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 50 transitions, 178 flow
[2024-11-07 19:16:55,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 50 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-11-07 19:16:55,309 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow
[2024-11-07 19:16:55,311 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36}
[2024-11-07 19:16:55,317 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places.
[2024-11-07 19:16:55,318 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow
[2024-11-07 19:16:55,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:16:55,318 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 19:16:55,318 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 19:16:55,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 19:16:55,319 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-07 19:16:55,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:16:55,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1836076042, now seen corresponding path program 1 times
[2024-11-07 19:16:55,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:16:55,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961834463]
[2024-11-07 19:16:55,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:16:55,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:16:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:16:55,405 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:16:55,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:16:55,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961834463]
[2024-11-07 19:16:55,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961834463] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:16:55,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:16:55,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-07 19:16:55,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659590235]
[2024-11-07 19:16:55,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:16:55,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 19:16:55,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:16:55,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 19:16:55,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 19:16:55,408 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44
[2024-11-07 19:16:55,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:16:55,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 19:16:55,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44
[2024-11-07 19:16:55,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 19:16:55,609 INFO L124 PetriNetUnfolderBase]: 528/1052 cut-off events.
[2024-11-07 19:16:55,609 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES.
[2024-11-07 19:16:55,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1968 conditions, 1052 events. 528/1052 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6805 event pairs, 528 based on Foata normal form. 36/1042 useless extension candidates. Maximal degree in co-relation 1958. Up to 811 conditions per place.
[2024-11-07 19:16:55,618 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 17 selfloop transitions, 1 changer transitions 1/35 dead transitions.
[2024-11-07 19:16:55,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 118 flow
[2024-11-07 19:16:55,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 19:16:55,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-07 19:16:55,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions.
[2024-11-07 19:16:55,620 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334
[2024-11-07 19:16:55,620 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 77 transitions.
[2024-11-07 19:16:55,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 118 flow
[2024-11-07 19:16:55,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-07 19:16:55,621 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow
[2024-11-07 19:16:55,621 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34}
[2024-11-07 19:16:55,626 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places.
[2024-11-07 19:16:55,626 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow
[2024-11-07 19:16:55,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:16:55,627 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 19:16:55,627 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 19:16:55,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-07 19:16:55,627 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-07 19:16:55,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:16:55,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1836076025, now seen corresponding path program 1 times
[2024-11-07 19:16:55,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:16:55,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50980746]
[2024-11-07 19:16:55,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:16:55,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:16:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:16:55,872 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:16:55,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:16:55,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50980746]
[2024-11-07 19:16:55,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50980746] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:16:55,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:16:55,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 19:16:55,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72468114]
[2024-11-07 19:16:55,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:16:55,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 19:16:55,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:16:55,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 19:16:55,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 19:16:55,885 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44
[2024-11-07 19:16:55,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 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:16:55,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 19:16:55,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44
[2024-11-07 19:16:55,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 19:16:56,275 INFO L124 PetriNetUnfolderBase]: 1213/2139 cut-off events.
[2024-11-07 19:16:56,275 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-07 19:16:56,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4035 conditions, 2139 events. 1213/2139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 13484 event pairs, 147 based on Foata normal form. 80/2186 useless extension candidates. Maximal degree in co-relation 4029. Up to 1081 conditions per place.
[2024-11-07 19:16:56,290 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 39 selfloop transitions, 5 changer transitions 1/57 dead transitions.
[2024-11-07 19:16:56,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 216 flow
[2024-11-07 19:16:56,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 19:16:56,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-07 19:16:56,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions.
[2024-11-07 19:16:56,292 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6306818181818182
[2024-11-07 19:16:56,292 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 4 states and 111 transitions.
[2024-11-07 19:16:56,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 216 flow
[2024-11-07 19:16:56,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-07 19:16:56,298 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 109 flow
[2024-11-07 19:16:56,298 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=47, PETRI_TRANSITIONS=37}
[2024-11-07 19:16:56,299 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places.
[2024-11-07 19:16:56,299 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 109 flow
[2024-11-07 19:16:56,299 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:16:56,299 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 19:16:56,299 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:16:56,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-07 19:16:56,300 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-07 19:16:56,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:16:56,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1690076340, now seen corresponding path program 1 times
[2024-11-07 19:16:56,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:16:56,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894540367]
[2024-11-07 19:16:56,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:16:56,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:16:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:16:56,645 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:16:56,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:16:56,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894540367]
[2024-11-07 19:16:56,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894540367] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:16:56,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:16:56,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 19:16:56,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240386116]
[2024-11-07 19:16:56,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:16:56,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 19:16:56,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:16:56,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 19:16:56,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-07 19:16:56,660 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44
[2024-11-07 19:16:56,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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:16:56,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 19:16:56,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44
[2024-11-07 19:16:56,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 19:16:57,013 INFO L124 PetriNetUnfolderBase]: 809/1435 cut-off events.
[2024-11-07 19:16:57,014 INFO L125 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES.
[2024-11-07 19:16:57,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3242 conditions, 1435 events. 809/1435 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7917 event pairs, 73 based on Foata normal form. 68/1477 useless extension candidates. Maximal degree in co-relation 3233. Up to 521 conditions per place.
[2024-11-07 19:16:57,024 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 49 selfloop transitions, 8 changer transitions 1/70 dead transitions.
[2024-11-07 19:16:57,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 70 transitions, 312 flow
[2024-11-07 19:16:57,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 19:16:57,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-07 19:16:57,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions.
[2024-11-07 19:16:57,028 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364
[2024-11-07 19:16:57,028 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 109 flow. Second operand 5 states and 140 transitions.
[2024-11-07 19:16:57,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 70 transitions, 312 flow
[2024-11-07 19:16:57,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 302 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-11-07 19:16:57,033 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 149 flow
[2024-11-07 19:16:57,034 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=51, PETRI_TRANSITIONS=40}
[2024-11-07 19:16:57,034 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places.
[2024-11-07 19:16:57,035 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 149 flow
[2024-11-07 19:16:57,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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:16:57,035 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 19:16:57,035 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:16:57,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-07 19:16:57,036 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-07 19:16:57,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:16:57,039 INFO L85 PathProgramCache]: Analyzing trace with hash -2041591845, now seen corresponding path program 1 times
[2024-11-07 19:16:57,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:16:57,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926282157]
[2024-11-07 19:16:57,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:16:57,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:16:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:16:57,395 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:16:57,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:16:57,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926282157]
[2024-11-07 19:16:57,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926282157] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:16:57,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:16:57,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 19:16:57,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300373515]
[2024-11-07 19:16:57,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:16:57,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 19:16:57,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:16:57,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 19:16:57,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-07 19:16:57,399 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44
[2024-11-07 19:16:57,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 149 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:16:57,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 19:16:57,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44
[2024-11-07 19:16:57,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 19:16:57,653 INFO L124 PetriNetUnfolderBase]: 477/819 cut-off events.
[2024-11-07 19:16:57,653 INFO L125 PetriNetUnfolderBase]: For 680/680 co-relation queries the response was YES.
[2024-11-07 19:16:57,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2132 conditions, 819 events. 477/819 cut-off events. For 680/680 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3690 event pairs, 59 based on Foata normal form. 36/831 useless extension candidates. Maximal degree in co-relation 2121. Up to 268 conditions per place.
[2024-11-07 19:16:57,660 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 43 selfloop transitions, 11 changer transitions 1/67 dead transitions.
[2024-11-07 19:16:57,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 323 flow
[2024-11-07 19:16:57,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 19:16:57,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-07 19:16:57,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions.
[2024-11-07 19:16:57,664 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5795454545454546
[2024-11-07 19:16:57,664 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 149 flow. Second operand 6 states and 153 transitions.
[2024-11-07 19:16:57,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 323 flow
[2024-11-07 19:16:57,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 298 flow, removed 4 selfloop flow, removed 4 redundant places.
[2024-11-07 19:16:57,670 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 163 flow
[2024-11-07 19:16:57,670 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=54, PETRI_TRANSITIONS=40}
[2024-11-07 19:16:57,672 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places.
[2024-11-07 19:16:57,672 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 163 flow
[2024-11-07 19:16:57,672 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:16:57,672 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 19:16:57,672 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, 1]
[2024-11-07 19:16:57,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-07 19:16:57,672 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-07 19:16:57,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:16:57,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1713089101, now seen corresponding path program 1 times
[2024-11-07 19:16:57,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:16:57,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237712531]
[2024-11-07 19:16:57,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:16:57,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:16:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:16:58,112 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:16:58,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:16:58,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237712531]
[2024-11-07 19:16:58,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237712531] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:16:58,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:16:58,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-07 19:16:58,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879975939]
[2024-11-07 19:16:58,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:16:58,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 19:16:58,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:16:58,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 19:16:58,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-11-07 19:16:58,133 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44
[2024-11-07 19:16:58,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 163 flow. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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:16:58,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 19:16:58,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44
[2024-11-07 19:16:58,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 19:16:58,589 INFO L124 PetriNetUnfolderBase]: 1136/2070 cut-off events.
[2024-11-07 19:16:58,589 INFO L125 PetriNetUnfolderBase]: For 946/964 co-relation queries the response was YES.
[2024-11-07 19:16:58,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4797 conditions, 2070 events. 1136/2070 cut-off events. For 946/964 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 12105 event pairs, 249 based on Foata normal form. 16/2029 useless extension candidates. Maximal degree in co-relation 4785. Up to 620 conditions per place.
[2024-11-07 19:16:58,600 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 41 selfloop transitions, 8 changer transitions 25/91 dead transitions.
[2024-11-07 19:16:58,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 91 transitions, 433 flow
[2024-11-07 19:16:58,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-07 19:16:58,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-11-07 19:16:58,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 211 transitions.
[2024-11-07 19:16:58,603 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5328282828282829
[2024-11-07 19:16:58,603 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 163 flow. Second operand 9 states and 211 transitions.
[2024-11-07 19:16:58,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 91 transitions, 433 flow
[2024-11-07 19:16:58,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 91 transitions, 361 flow, removed 18 selfloop flow, removed 8 redundant places.
[2024-11-07 19:16:58,619 INFO L231 Difference]: Finished difference. Result has 62 places, 46 transitions, 173 flow
[2024-11-07 19:16:58,619 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=173, PETRI_PLACES=62, PETRI_TRANSITIONS=46}
[2024-11-07 19:16:58,620 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places.
[2024-11-07 19:16:58,620 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 46 transitions, 173 flow
[2024-11-07 19:16:58,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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:16:58,620 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 19:16:58,620 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, 1]
[2024-11-07 19:16:58,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-07 19:16:58,621 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-07 19:16:58,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:16:58,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1117080783, now seen corresponding path program 2 times
[2024-11-07 19:16:58,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:16:58,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187467734]
[2024-11-07 19:16:58,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:16:58,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:16:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:16:58,970 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:16:58,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:16:58,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187467734]
[2024-11-07 19:16:58,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187467734] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:16:58,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:16:58,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 19:16:58,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795222647]
[2024-11-07 19:16:58,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:16:58,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 19:16:58,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:16:58,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 19:16:58,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-07 19:16:58,999 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44
[2024-11-07 19:16:58,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 46 transitions, 173 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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:16:58,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 19:16:58,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44
[2024-11-07 19:16:59,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 19:16:59,301 INFO L124 PetriNetUnfolderBase]: 826/1521 cut-off events.
[2024-11-07 19:16:59,303 INFO L125 PetriNetUnfolderBase]: For 442/460 co-relation queries the response was YES.
[2024-11-07 19:16:59,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3502 conditions, 1521 events. 826/1521 cut-off events. For 442/460 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 8688 event pairs, 267 based on Foata normal form. 8/1422 useless extension candidates. Maximal degree in co-relation 3486. Up to 697 conditions per place.
[2024-11-07 19:16:59,314 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 29 selfloop transitions, 4 changer transitions 19/70 dead transitions.
[2024-11-07 19:16:59,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 70 transitions, 347 flow
[2024-11-07 19:16:59,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 19:16:59,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-07 19:16:59,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions.
[2024-11-07 19:16:59,315 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454
[2024-11-07 19:16:59,315 INFO L175 Difference]: Start difference. First operand has 62 places, 46 transitions, 173 flow. Second operand 6 states and 144 transitions.
[2024-11-07 19:16:59,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 70 transitions, 347 flow
[2024-11-07 19:16:59,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 70 transitions, 328 flow, removed 8 selfloop flow, removed 5 redundant places.
[2024-11-07 19:16:59,320 INFO L231 Difference]: Finished difference. Result has 61 places, 43 transitions, 162 flow
[2024-11-07 19:16:59,321 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=61, PETRI_TRANSITIONS=43}
[2024-11-07 19:16:59,321 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places.
[2024-11-07 19:16:59,321 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 162 flow
[2024-11-07 19:16:59,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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:16:59,322 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 19:16:59,322 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, 1]
[2024-11-07 19:16:59,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-07 19:16:59,322 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-07 19:16:59,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:16:59,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1914730847, now seen corresponding path program 3 times
[2024-11-07 19:16:59,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:16:59,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043339381]
[2024-11-07 19:16:59,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:16:59,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:16:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:16:59,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 19:16:59,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:16:59,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043339381]
[2024-11-07 19:16:59,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043339381] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:16:59,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:16:59,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 19:16:59,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399340398]
[2024-11-07 19:16:59,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:16:59,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 19:16:59,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:16:59,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 19:16:59,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-11-07 19:16:59,763 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44
[2024-11-07 19:16:59,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 43 transitions, 162 flow. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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:16:59,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 19:16:59,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44
[2024-11-07 19:16:59,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 19:17:00,065 INFO L124 PetriNetUnfolderBase]: 567/1084 cut-off events.
[2024-11-07 19:17:00,066 INFO L125 PetriNetUnfolderBase]: For 299/301 co-relation queries the response was YES.
[2024-11-07 19:17:00,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2502 conditions, 1084 events. 567/1084 cut-off events. For 299/301 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5456 event pairs, 107 based on Foata normal form. 9/1063 useless extension candidates. Maximal degree in co-relation 2486. Up to 335 conditions per place.
[2024-11-07 19:17:00,074 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 26 selfloop transitions, 3 changer transitions 29/75 dead transitions.
[2024-11-07 19:17:00,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 75 transitions, 363 flow
[2024-11-07 19:17:00,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-07 19:17:00,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-07 19:17:00,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions.
[2024-11-07 19:17:00,077 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5028409090909091
[2024-11-07 19:17:00,077 INFO L175 Difference]: Start difference. First operand has 61 places, 43 transitions, 162 flow. Second operand 8 states and 177 transitions.
[2024-11-07 19:17:00,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 75 transitions, 363 flow
[2024-11-07 19:17:00,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 75 transitions, 333 flow, removed 9 selfloop flow, removed 7 redundant places.
[2024-11-07 19:17:00,082 INFO L231 Difference]: Finished difference. Result has 63 places, 40 transitions, 137 flow
[2024-11-07 19:17:00,083 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=137, PETRI_PLACES=63, PETRI_TRANSITIONS=40}
[2024-11-07 19:17:00,084 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places.
[2024-11-07 19:17:00,085 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 40 transitions, 137 flow
[2024-11-07 19:17:00,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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:17:00,085 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 19:17:00,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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 19:17:00,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-07 19:17:00,086 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-07 19:17:00,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:17:00,086 INFO L85 PathProgramCache]: Analyzing trace with hash 286915651, now seen corresponding path program 4 times
[2024-11-07 19:17:00,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:17:00,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413729174]
[2024-11-07 19:17:00,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:17:00,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:17:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:17:01,420 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:17:01,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:17:01,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413729174]
[2024-11-07 19:17:01,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413729174] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:17:01,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:17:01,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-07 19:17:01,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178933773]
[2024-11-07 19:17:01,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:17:01,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-07 19:17:01,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:17:01,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-07 19:17:01,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2024-11-07 19:17:01,436 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44
[2024-11-07 19:17:01,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 40 transitions, 137 flow. Second operand has 9 states, 9 states have (on average 20.77777777777778) internal successors, (187), 9 states have internal predecessors, (187), 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:17:01,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 19:17:01,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44
[2024-11-07 19:17:01,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 19:17:01,815 INFO L124 PetriNetUnfolderBase]: 300/626 cut-off events.
[2024-11-07 19:17:01,816 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES.
[2024-11-07 19:17:01,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1290 conditions, 626 events. 300/626 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2853 event pairs, 94 based on Foata normal form. 8/601 useless extension candidates. Maximal degree in co-relation 1275. Up to 230 conditions per place.
[2024-11-07 19:17:01,820 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 22 selfloop transitions, 3 changer transitions 23/69 dead transitions.
[2024-11-07 19:17:01,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 69 transitions, 301 flow
[2024-11-07 19:17:01,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-07 19:17:01,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-07 19:17:01,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions.
[2024-11-07 19:17:01,822 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5710227272727273
[2024-11-07 19:17:01,822 INFO L175 Difference]: Start difference. First operand has 63 places, 40 transitions, 137 flow. Second operand 8 states and 201 transitions.
[2024-11-07 19:17:01,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 69 transitions, 301 flow
[2024-11-07 19:17:01,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 69 transitions, 275 flow, removed 9 selfloop flow, removed 8 redundant places.
[2024-11-07 19:17:01,824 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 133 flow
[2024-11-07 19:17:01,825 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=133, PETRI_PLACES=61, PETRI_TRANSITIONS=40}
[2024-11-07 19:17:01,825 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places.
[2024-11-07 19:17:01,825 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 133 flow
[2024-11-07 19:17:01,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.77777777777778) internal successors, (187), 9 states have internal predecessors, (187), 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:17:01,826 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 19:17:01,826 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, 1]
[2024-11-07 19:17:01,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-07 19:17:01,826 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-07 19:17:01,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:17:01,827 INFO L85 PathProgramCache]: Analyzing trace with hash 69236421, now seen corresponding path program 5 times
[2024-11-07 19:17:01,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:17:01,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563267905]
[2024-11-07 19:17:01,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:17:01,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:17:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 19:17:01,883 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 19:17:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 19:17:01,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 19:17:01,988 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-07 19:17:01,989 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining)
[2024-11-07 19:17:01,994 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining)
[2024-11-07 19:17:01,994 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining)
[2024-11-07 19:17:01,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining)
[2024-11-07 19:17:01,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining)
[2024-11-07 19:17:01,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining)
[2024-11-07 19:17:01,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining)
[2024-11-07 19:17:01,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-07 19:17:01,998 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1]
[2024-11-07 19:17:02,086 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-07 19:17:02,087 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 19:17:02,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:17:02 BasicIcfg
[2024-11-07 19:17:02,092 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 19:17:02,093 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 19:17:02,093 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 19:17:02,093 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 19:17:02,094 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:16:54" (3/4) ...
[2024-11-07 19:17:02,096 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-07 19:17:02,096 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 19:17:02,097 INFO L158 Benchmark]: Toolchain (without parser) took 9437.45ms. Allocated memory was 117.4MB in the beginning and 310.4MB in the end (delta: 192.9MB). Free memory was 90.7MB in the beginning and 157.6MB in the end (delta: -66.9MB). Peak memory consumption was 127.0MB. Max. memory is 16.1GB.
[2024-11-07 19:17:02,098 INFO L158 Benchmark]: CDTParser took 0.84ms. Allocated memory is still 117.4MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 19:17:02,098 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.69ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 67.9MB in the end (delta: 22.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 19:17:02,098 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.87ms. Allocated memory is still 117.4MB. Free memory was 67.9MB in the beginning and 65.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 19:17:02,098 INFO L158 Benchmark]: Boogie Preprocessor took 62.85ms. Allocated memory is still 117.4MB. Free memory was 65.6MB in the beginning and 62.8MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 19:17:02,098 INFO L158 Benchmark]: RCFGBuilder took 750.47ms. Allocated memory is still 117.4MB. Free memory was 62.8MB in the beginning and 61.5MB in the end (delta: 1.3MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB.
[2024-11-07 19:17:02,098 INFO L158 Benchmark]: TraceAbstraction took 8066.72ms. Allocated memory was 117.4MB in the beginning and 310.4MB in the end (delta: 192.9MB). Free memory was 61.0MB in the beginning and 157.7MB in the end (delta: -96.7MB). Peak memory consumption was 96.9MB. Max. memory is 16.1GB.
[2024-11-07 19:17:02,099 INFO L158 Benchmark]: Witness Printer took 3.53ms. Allocated memory is still 310.4MB. Free memory was 157.7MB in the beginning and 157.6MB in the end (delta: 78.8kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 19:17:02,100 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.84ms. Allocated memory is still 117.4MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 489.69ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 67.9MB in the end (delta: 22.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 55.87ms. Allocated memory is still 117.4MB. Free memory was 67.9MB in the beginning and 65.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 62.85ms. Allocated memory is still 117.4MB. Free memory was 65.6MB in the beginning and 62.8MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 750.47ms. Allocated memory is still 117.4MB. Free memory was 62.8MB in the beginning and 61.5MB in the end (delta: 1.3MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB.
* TraceAbstraction took 8066.72ms. Allocated memory was 117.4MB in the beginning and 310.4MB in the end (delta: 192.9MB). Free memory was 61.0MB in the beginning and 157.7MB in the end (delta: -96.7MB). Peak memory consumption was 96.9MB. Max. memory is 16.1GB.
* Witness Printer took 3.53ms. Allocated memory is still 310.4MB. Free memory was 157.7MB in the beginning and 157.6MB in the end (delta: 78.8kB). There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: overapproximation of memtrack at line 18.
Possible FailurePath:
[L710] 0 int __unbuffered_cnt = 0;
[L712] 0 int __unbuffered_p0_EAX = 0;
[L714] 0 int __unbuffered_p0_EBX = 0;
[L716] 0 int __unbuffered_p2_EAX = 0;
[L717] 0 _Bool main$tmp_guard0;
[L718] 0 _Bool main$tmp_guard1;
[L720] 0 int x = 0;
[L721] 0 _Bool x$flush_delayed;
[L722] 0 int x$mem_tmp;
[L723] 0 _Bool x$r_buff0_thd0;
[L724] 0 _Bool x$r_buff0_thd1;
[L725] 0 _Bool x$r_buff0_thd2;
[L726] 0 _Bool x$r_buff0_thd3;
[L727] 0 _Bool x$r_buff1_thd0;
[L728] 0 _Bool x$r_buff1_thd1;
[L729] 0 _Bool x$r_buff1_thd2;
[L730] 0 _Bool x$r_buff1_thd3;
[L731] 0 _Bool x$read_delayed;
[L732] 0 int *x$read_delayed_var;
[L733] 0 int x$w_buff0;
[L734] 0 _Bool x$w_buff0_used;
[L735] 0 int x$w_buff1;
[L736] 0 _Bool x$w_buff1_used;
[L738] 0 int y = 0;
[L739] 0 _Bool weak$$choice0;
[L740] 0 _Bool weak$$choice2;
[L829] 0 pthread_t t1828;
[L830] FCALL, FORK 0 pthread_create(&t1828, ((void *)0), P0, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1828=-3, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L831] 0 pthread_t t1829;
[L832] FCALL, FORK 0 pthread_create(&t1829, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1828=-3, t1829=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L833] 0 pthread_t t1830;
[L834] FCALL, FORK 0 pthread_create(&t1830, ((void *)0), P2, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1828=-3, t1829=-2, t1830=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L772] 2 x$w_buff1 = x$w_buff0
[L773] 2 x$w_buff0 = 1
[L774] 2 x$w_buff1_used = x$w_buff0_used
[L775] 2 x$w_buff0_used = (_Bool)1
[L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L19] COND FALSE 2 !(!expression)
[L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0
[L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1
[L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2
[L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3
[L781] 2 x$r_buff0_thd2 = (_Bool)1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L784] 2 y = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1]
[L801] 3 __unbuffered_p2_EAX = y
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1]
[L804] 3 y = 2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2]
[L807] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L809] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L811] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2]
[L744] 1 __unbuffered_p0_EAX = y
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2]
[L747] 1 weak$$choice0 = __VERIFIER_nondet_bool()
[L748] 1 weak$$choice2 = __VERIFIER_nondet_bool()
[L749] 1 x$flush_delayed = weak$$choice2
[L750] 1 x$mem_tmp = x
[L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L758] 1 __unbuffered_p0_EBX = x
[L759] 1 x = x$flush_delayed ? x$mem_tmp : x
[L760] 1 x$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2]
[L787] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L789] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
[L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
[L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
[L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
[L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828=-3, t1829=-2, t1830=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
[L838] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L4] COND FALSE 0 !(!cond)
[L838] RET 0 assume_abort_if_not(main$tmp_guard0)
[L840] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L842] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L844] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828=-3, t1829=-2, t1830=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
[L847] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828=-3, t1829=-2, t1830=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
[L849] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L19] COND TRUE 0 !expression
[L19] CALL 0 reach_error()
[L18] COND FALSE 0 !(0)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
[L18] 0 __assert_fail ("0", "safe002_power.opt_pso.oepc_pso.opt_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
- UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 827]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 830]: 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: 832]: 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: 834]: 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.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 7 procedures, 68 locations, 7 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: 7.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 387 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 364 mSDsluCounter, 123 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 104 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 970 IncrementalHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 19 mSDtfsCounter, 970 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173occurred in iteration=6, InterpolantAutomatonStates: 52, 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.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 953 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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:17:02,131 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-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.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 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 19:17:04,427 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 19:17:04,513 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:17:04,518 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 19:17:04,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 19:17:04,538 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 19:17:04,539 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 19:17:04,539 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 19:17:04,539 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 19:17:04,539 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 19:17:04,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 19:17:04,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 19:17:04,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 19:17:04,540 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 19:17:04,540 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 19:17:04,540 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 19:17:04,540 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 19:17:04,540 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 19:17:04,540 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 19:17:04,540 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 19:17:04,540 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-07 19:17:04,540 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-07 19:17:04,540 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2024-11-07 19:17:04,540 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 19:17:04,541 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-07 19:17:04,541 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-07 19:17:04,541 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 19:17:04,541 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-07 19:17:04,541 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-07 19:17:04,541 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 19:17:04,541 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 19:17:04,541 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 19:17:04,541 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 19:17:04,541 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 19:17:04,541 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 19:17:04,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 19:17:04,541 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 19:17:04,542 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 19:17:04,542 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2024-11-07 19:17:04,542 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-07 19:17:04,542 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 19:17:04,542 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 19:17:04,542 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 19:17:04,542 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 19:17:04,542 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 -> 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6
[2024-11-07 19:17:04,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 19:17:04,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 19:17:04,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 19:17:04,814 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 19:17:04,815 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 19:17:04,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i
[2024-11-07 19:17:06,225 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 19:17:06,519 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 19:17:06,519 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i
[2024-11-07 19:17:06,537 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5cfd40df0/3a4878e895a246ab9b07af212d7c34ae/FLAG98bd6716c
[2024-11-07 19:17:06,801 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5cfd40df0/3a4878e895a246ab9b07af212d7c34ae
[2024-11-07 19:17:06,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 19:17:06,806 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 19:17:06,809 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 19:17:06,809 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 19:17:06,813 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 19:17:06,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:17:06" (1/1) ...
[2024-11-07 19:17:06,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b33339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:17:06, skipping insertion in model container
[2024-11-07 19:17:06,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:17:06" (1/1) ...
[2024-11-07 19:17:06,855 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 19:17:07,211 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 19:17:07,230 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 19:17:07,290 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 19:17:07,334 INFO L204 MainTranslator]: Completed translation
[2024-11-07 19:17:07,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:17:07 WrapperNode
[2024-11-07 19:17:07,335 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 19:17:07,336 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 19:17:07,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 19:17:07,337 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 19:17:07,345 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:17:07" (1/1) ...
[2024-11-07 19:17:07,370 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:17:07" (1/1) ...
[2024-11-07 19:17:07,404 INFO L138 Inliner]: procedures = 176, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 120
[2024-11-07 19:17:07,407 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 19:17:07,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 19:17:07,409 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 19:17:07,409 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 19:17:07,418 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:17:07" (1/1) ...
[2024-11-07 19:17:07,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:17:07" (1/1) ...
[2024-11-07 19:17:07,423 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:17:07" (1/1) ...
[2024-11-07 19:17:07,447 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-07 19:17:07,447 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:17:07" (1/1) ...
[2024-11-07 19:17:07,448 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:17:07" (1/1) ...
[2024-11-07 19:17:07,460 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:17:07" (1/1) ...
[2024-11-07 19:17:07,465 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:17:07" (1/1) ...
[2024-11-07 19:17:07,471 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:17:07" (1/1) ...
[2024-11-07 19:17:07,472 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:17:07" (1/1) ...
[2024-11-07 19:17:07,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 19:17:07,480 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 19:17:07,483 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 19:17:07,483 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 19:17:07,484 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:17:07" (1/1) ...
[2024-11-07 19:17:07,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 19:17:07,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 19:17:07,524 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:17:07,527 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:17:07,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-07 19:17:07,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 19:17:07,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-07 19:17:07,552 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-11-07 19:17:07,552 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-11-07 19:17:07,552 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-11-07 19:17:07,552 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-11-07 19:17:07,552 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2024-11-07 19:17:07,552 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2024-11-07 19:17:07,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-07 19:17:07,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 19:17:07,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 19:17:07,554 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:17:07,703 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 19:17:07,705 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 19:17:08,094 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-07 19:17:08,095 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 19:17:08,339 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 19:17:08,339 INFO L316 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-07 19:17:08,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:17:08 BoogieIcfgContainer
[2024-11-07 19:17:08,340 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 19:17:08,342 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 19:17:08,343 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 19:17:08,347 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 19:17:08,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:17:06" (1/3) ...
[2024-11-07 19:17:08,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb5441f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:17:08, skipping insertion in model container
[2024-11-07 19:17:08,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:17:07" (2/3) ...
[2024-11-07 19:17:08,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb5441f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:17:08, skipping insertion in model container
[2024-11-07 19:17:08,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:17:08" (3/3) ...
[2024-11-07 19:17:08,350 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i
[2024-11-07 19:17:08,364 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 19:17:08,365 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-11-07 19:17:08,365 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-07 19:17:08,433 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-07 19:17:08,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow
[2024-11-07 19:17:08,517 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events.
[2024-11-07 19:17:08,519 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-07 19:17:08,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 77 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place.
[2024-11-07 19:17:08,525 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow
[2024-11-07 19:17:08,530 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow
[2024-11-07 19:17:08,540 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 19:17:08,551 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;@721aff01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 19:17:08,552 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-11-07 19:17:08,559 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-07 19:17:08,559 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events.
[2024-11-07 19:17:08,559 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-07 19:17:08,559 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 19:17:08,561 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-11-07 19:17:08,562 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-07 19:17:08,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:17:08,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1559868593, now seen corresponding path program 1 times
[2024-11-07 19:17:08,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 19:17:08,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1996044415]
[2024-11-07 19:17:08,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:17:08,581 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:17:08,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 19:17:08,583 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:17:08,584 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:17:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:17:08,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-07 19:17:08,708 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 19:17:08,745 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:17:08,745 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 19:17:08,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 19:17:08,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1996044415]
[2024-11-07 19:17:08,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1996044415] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:17:08,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:17:08,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-07 19:17:08,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116679798]
[2024-11-07 19:17:08,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:17:08,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 19:17:08,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 19:17:08,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 19:17:08,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 19:17:08,783 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 44
[2024-11-07 19:17:08,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:17:08,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 19:17:08,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 44
[2024-11-07 19:17:08,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 19:17:09,203 INFO L124 PetriNetUnfolderBase]: 603/1151 cut-off events.
[2024-11-07 19:17:09,204 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES.
[2024-11-07 19:17:09,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2110 conditions, 1151 events. 603/1151 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7364 event pairs, 96 based on Foata normal form. 72/1211 useless extension candidates. Maximal degree in co-relation 2099. Up to 742 conditions per place.
[2024-11-07 19:17:09,219 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 29 selfloop transitions, 2 changer transitions 2/50 dead transitions.
[2024-11-07 19:17:09,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 50 transitions, 178 flow
[2024-11-07 19:17:09,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 19:17:09,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-07 19:17:09,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions.
[2024-11-07 19:17:09,239 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7424242424242424
[2024-11-07 19:17:09,241 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 98 transitions.
[2024-11-07 19:17:09,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 50 transitions, 178 flow
[2024-11-07 19:17:09,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 50 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-11-07 19:17:09,252 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow
[2024-11-07 19:17:09,255 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36}
[2024-11-07 19:17:09,259 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places.
[2024-11-07 19:17:09,259 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow
[2024-11-07 19:17:09,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:17:09,259 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 19:17:09,260 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 19:17:09,264 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 (2)] Ended with exit code 0
[2024-11-07 19:17:09,462 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:17:09,463 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-07 19:17:09,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:17:09,464 INFO L85 PathProgramCache]: Analyzing trace with hash -691097012, now seen corresponding path program 1 times
[2024-11-07 19:17:09,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 19:17:09,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1918276792]
[2024-11-07 19:17:09,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:17:09,464 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:17:09,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 19:17:09,467 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:17:09,468 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:17:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:17:09,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-07 19:17:09,547 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 19:17:09,585 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:17:09,585 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 19:17:09,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 19:17:09,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1918276792]
[2024-11-07 19:17:09,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1918276792] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:17:09,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:17:09,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 19:17:09,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776332930]
[2024-11-07 19:17:09,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:17:09,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 19:17:09,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 19:17:09,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 19:17:09,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 19:17:09,600 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44
[2024-11-07 19:17:09,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 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:17:09,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 19:17:09,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44
[2024-11-07 19:17:09,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 19:17:10,086 INFO L124 PetriNetUnfolderBase]: 1361/2423 cut-off events.
[2024-11-07 19:17:10,087 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES.
[2024-11-07 19:17:10,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4663 conditions, 2423 events. 1361/2423 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 15627 event pairs, 147 based on Foata normal form. 80/2475 useless extension candidates. Maximal degree in co-relation 4653. Up to 1297 conditions per place.
[2024-11-07 19:17:10,109 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 40 selfloop transitions, 5 changer transitions 1/59 dead transitions.
[2024-11-07 19:17:10,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 59 transitions, 228 flow
[2024-11-07 19:17:10,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 19:17:10,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-07 19:17:10,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions.
[2024-11-07 19:17:10,114 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364
[2024-11-07 19:17:10,114 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 4 states and 112 transitions.
[2024-11-07 19:17:10,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 59 transitions, 228 flow
[2024-11-07 19:17:10,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 59 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-07 19:17:10,119 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 112 flow
[2024-11-07 19:17:10,120 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=48, PETRI_TRANSITIONS=39}
[2024-11-07 19:17:10,120 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places.
[2024-11-07 19:17:10,121 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 112 flow
[2024-11-07 19:17:10,121 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:17:10,121 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 19:17:10,121 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:17:10,125 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 (3)] Ended with exit code 0
[2024-11-07 19:17:10,322 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:17:10,322 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-07 19:17:10,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:17:10,323 INFO L85 PathProgramCache]: Analyzing trace with hash -225536607, now seen corresponding path program 1 times
[2024-11-07 19:17:10,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 19:17:10,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961203876]
[2024-11-07 19:17:10,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:17:10,323 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:17:10,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 19:17:10,325 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:17:10,327 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:17:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:17:10,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-07 19:17:10,427 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 19:17:10,480 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:17:10,480 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 19:17:10,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 19:17:10,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961203876]
[2024-11-07 19:17:10,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1961203876] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:17:10,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:17:10,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 19:17:10,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714686184]
[2024-11-07 19:17:10,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:17:10,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 19:17:10,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 19:17:10,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 19:17:10,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 19:17:10,490 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44
[2024-11-07 19:17:10,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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:17:10,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 19:17:10,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44
[2024-11-07 19:17:10,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 19:17:10,868 INFO L124 PetriNetUnfolderBase]: 877/1575 cut-off events.
[2024-11-07 19:17:10,868 INFO L125 PetriNetUnfolderBase]: For 378/378 co-relation queries the response was YES.
[2024-11-07 19:17:10,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3497 conditions, 1575 events. 877/1575 cut-off events. For 378/378 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 8915 event pairs, 73 based on Foata normal form. 68/1622 useless extension candidates. Maximal degree in co-relation 3485. Up to 625 conditions per place.
[2024-11-07 19:17:10,881 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 50 selfloop transitions, 8 changer transitions 1/72 dead transitions.
[2024-11-07 19:17:10,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 72 transitions, 317 flow
[2024-11-07 19:17:10,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 19:17:10,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-07 19:17:10,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions.
[2024-11-07 19:17:10,883 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6409090909090909
[2024-11-07 19:17:10,883 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 112 flow. Second operand 5 states and 141 transitions.
[2024-11-07 19:17:10,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 72 transitions, 317 flow
[2024-11-07 19:17:10,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 72 transitions, 307 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-11-07 19:17:10,888 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 152 flow
[2024-11-07 19:17:10,888 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=52, PETRI_TRANSITIONS=42}
[2024-11-07 19:17:10,889 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places.
[2024-11-07 19:17:10,889 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 152 flow
[2024-11-07 19:17:10,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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:17:10,889 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 19:17:10,889 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:17:10,895 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 (4)] Forceful destruction successful, exit code 0
[2024-11-07 19:17:11,090 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:17:11,090 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-07 19:17:11,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:17:11,091 INFO L85 PathProgramCache]: Analyzing trace with hash -31959824, now seen corresponding path program 1 times
[2024-11-07 19:17:11,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 19:17:11,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [828855839]
[2024-11-07 19:17:11,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:17:11,091 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:17:11,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 19:17:11,095 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:17:11,096 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:17:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:17:11,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-07 19:17:11,195 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 19:17:11,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 19:17:11,255 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 19:17:11,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 19:17:11,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [828855839]
[2024-11-07 19:17:11,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [828855839] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:17:11,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:17:11,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 19:17:11,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466180049]
[2024-11-07 19:17:11,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:17:11,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 19:17:11,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 19:17:11,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 19:17:11,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-07 19:17:11,272 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44
[2024-11-07 19:17:11,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 152 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:17:11,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 19:17:11,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44
[2024-11-07 19:17:11,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 19:17:11,568 INFO L124 PetriNetUnfolderBase]: 489/847 cut-off events.
[2024-11-07 19:17:11,568 INFO L125 PetriNetUnfolderBase]: For 680/680 co-relation queries the response was YES.
[2024-11-07 19:17:11,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2179 conditions, 847 events. 489/847 cut-off events. For 680/680 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3843 event pairs, 59 based on Foata normal form. 36/862 useless extension candidates. Maximal degree in co-relation 2165. Up to 268 conditions per place.
[2024-11-07 19:17:11,573 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 44 selfloop transitions, 11 changer transitions 1/69 dead transitions.
[2024-11-07 19:17:11,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 69 transitions, 328 flow
[2024-11-07 19:17:11,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 19:17:11,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-07 19:17:11,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions.
[2024-11-07 19:17:11,575 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334
[2024-11-07 19:17:11,575 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 152 flow. Second operand 6 states and 154 transitions.
[2024-11-07 19:17:11,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 69 transitions, 328 flow
[2024-11-07 19:17:11,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 69 transitions, 303 flow, removed 4 selfloop flow, removed 4 redundant places.
[2024-11-07 19:17:11,580 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 166 flow
[2024-11-07 19:17:11,580 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=166, PETRI_PLACES=55, PETRI_TRANSITIONS=42}
[2024-11-07 19:17:11,580 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places.
[2024-11-07 19:17:11,581 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 166 flow
[2024-11-07 19:17:11,581 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:17:11,581 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 19:17:11,581 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, 1]
[2024-11-07 19:17:11,586 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 (5)] Ended with exit code 0
[2024-11-07 19:17:11,781 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:17:11,782 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-07 19:17:11,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:17:11,783 INFO L85 PathProgramCache]: Analyzing trace with hash -2140680088, now seen corresponding path program 1 times
[2024-11-07 19:17:11,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 19:17:11,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568435976]
[2024-11-07 19:17:11,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:17:11,783 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:17:11,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 19:17:11,786 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:17:11,788 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:17:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:17:11,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-07 19:17:11,885 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 19:17:11,946 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:17:11,947 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 19:17:11,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 19:17:11,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568435976]
[2024-11-07 19:17:11,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1568435976] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:17:11,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:17:11,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-07 19:17:11,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097431389]
[2024-11-07 19:17:11,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:17:11,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 19:17:11,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 19:17:11,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 19:17:11,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 19:17:11,953 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44
[2024-11-07 19:17:11,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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:17:11,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 19:17:11,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44
[2024-11-07 19:17:11,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 19:17:12,051 INFO L124 PetriNetUnfolderBase]: 247/525 cut-off events.
[2024-11-07 19:17:12,052 INFO L125 PetriNetUnfolderBase]: For 161/167 co-relation queries the response was YES.
[2024-11-07 19:17:12,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 525 events. 247/525 cut-off events. For 161/167 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2567 event pairs, 237 based on Foata normal form. 8/485 useless extension candidates. Maximal degree in co-relation 1116. Up to 402 conditions per place.
[2024-11-07 19:17:12,056 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 17 selfloop transitions, 1 changer transitions 1/41 dead transitions.
[2024-11-07 19:17:12,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 41 transitions, 202 flow
[2024-11-07 19:17:12,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 19:17:12,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-07 19:17:12,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions.
[2024-11-07 19:17:12,058 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334
[2024-11-07 19:17:12,058 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 166 flow. Second operand 3 states and 77 transitions.
[2024-11-07 19:17:12,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 41 transitions, 202 flow
[2024-11-07 19:17:12,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 41 transitions, 146 flow, removed 10 selfloop flow, removed 8 redundant places.
[2024-11-07 19:17:12,060 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 108 flow
[2024-11-07 19:17:12,060 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=48, PETRI_TRANSITIONS=40}
[2024-11-07 19:17:12,061 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places.
[2024-11-07 19:17:12,061 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 108 flow
[2024-11-07 19:17:12,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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:17:12,063 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 19:17:12,063 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, 1]
[2024-11-07 19:17:12,068 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:17:12,263 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:17:12,264 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-07 19:17:12,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:17:12,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1620134743, now seen corresponding path program 1 times
[2024-11-07 19:17:12,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 19:17:12,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273664382]
[2024-11-07 19:17:12,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:17:12,265 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:17:12,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 19:17:12,267 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:17:12,270 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:17:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:17:12,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-07 19:17:12,361 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 19:17:12,432 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:17:12,432 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 19:17:12,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 19:17:12,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273664382]
[2024-11-07 19:17:12,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273664382] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:17:12,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:17:12,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 19:17:12,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020315189]
[2024-11-07 19:17:12,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:17:12,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 19:17:12,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 19:17:12,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 19:17:12,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-07 19:17:12,454 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44
[2024-11-07 19:17:12,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 108 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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:17:12,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 19:17:12,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44
[2024-11-07 19:17:12,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 19:17:12,732 INFO L124 PetriNetUnfolderBase]: 804/1505 cut-off events.
[2024-11-07 19:17:12,732 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-07 19:17:12,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2982 conditions, 1505 events. 804/1505 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8374 event pairs, 195 based on Foata normal form. 8/1460 useless extension candidates. Maximal degree in co-relation 2975. Up to 543 conditions per place.
[2024-11-07 19:17:12,742 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 34 selfloop transitions, 4 changer transitions 15/71 dead transitions.
[2024-11-07 19:17:12,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 71 transitions, 280 flow
[2024-11-07 19:17:12,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 19:17:12,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-07 19:17:12,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions.
[2024-11-07 19:17:12,744 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182
[2024-11-07 19:17:12,744 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 108 flow. Second operand 6 states and 150 transitions.
[2024-11-07 19:17:12,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 71 transitions, 280 flow
[2024-11-07 19:17:12,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 71 transitions, 279 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-07 19:17:12,747 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 135 flow
[2024-11-07 19:17:12,748 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=135, PETRI_PLACES=55, PETRI_TRANSITIONS=42}
[2024-11-07 19:17:12,749 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places.
[2024-11-07 19:17:12,750 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 135 flow
[2024-11-07 19:17:12,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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:17:12,750 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 19:17:12,750 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, 1]
[2024-11-07 19:17:12,755 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:17:12,954 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:17:12,955 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-07 19:17:12,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:17:12,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1475812175, now seen corresponding path program 2 times
[2024-11-07 19:17:12,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 19:17:12,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916972532]
[2024-11-07 19:17:12,956 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-07 19:17:12,956 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:17:12,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 19:17:12,958 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:17:12,959 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:17:13,051 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-07 19:17:13,051 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 19:17:13,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-07 19:17:13,056 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 19:17:13,131 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:17:13,131 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 19:17:13,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 19:17:13,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1916972532]
[2024-11-07 19:17:13,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1916972532] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:17:13,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:17:13,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 19:17:13,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965794792]
[2024-11-07 19:17:13,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:17:13,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 19:17:13,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 19:17:13,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 19:17:13,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-07 19:17:13,152 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44
[2024-11-07 19:17:13,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 135 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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:17:13,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 19:17:13,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44
[2024-11-07 19:17:13,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 19:17:13,377 INFO L124 PetriNetUnfolderBase]: 587/1098 cut-off events.
[2024-11-07 19:17:13,378 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES.
[2024-11-07 19:17:13,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2310 conditions, 1098 events. 587/1098 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5806 event pairs, 179 based on Foata normal form. 8/1038 useless extension candidates. Maximal degree in co-relation 2298. Up to 472 conditions per place.
[2024-11-07 19:17:13,384 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 27 selfloop transitions, 3 changer transitions 17/65 dead transitions.
[2024-11-07 19:17:13,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 65 transitions, 283 flow
[2024-11-07 19:17:13,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 19:17:13,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-07 19:17:13,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions.
[2024-11-07 19:17:13,385 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454
[2024-11-07 19:17:13,385 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 135 flow. Second operand 6 states and 144 transitions.
[2024-11-07 19:17:13,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 65 transitions, 283 flow
[2024-11-07 19:17:13,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 65 transitions, 268 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-11-07 19:17:13,387 INFO L231 Difference]: Finished difference. Result has 57 places, 40 transitions, 129 flow
[2024-11-07 19:17:13,387 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=129, PETRI_PLACES=57, PETRI_TRANSITIONS=40}
[2024-11-07 19:17:13,388 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 8 predicate places.
[2024-11-07 19:17:13,388 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 40 transitions, 129 flow
[2024-11-07 19:17:13,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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:17:13,388 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 19:17:13,388 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, 1]
[2024-11-07 19:17:13,393 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:17:13,592 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:17:13,593 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-07 19:17:13,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:17:13,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1446593405, now seen corresponding path program 3 times
[2024-11-07 19:17:13,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 19:17:13,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583021091]
[2024-11-07 19:17:13,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-07 19:17:13,593 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:17:13,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 19:17:13,598 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:17:13,599 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:17:13,698 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2024-11-07 19:17:13,698 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 19:17:13,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-07 19:17:13,703 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 19:17:13,756 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:17:13,757 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 19:17:13,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 19:17:13,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583021091]
[2024-11-07 19:17:13,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1583021091] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:17:13,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:17:13,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-07 19:17:13,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799096490]
[2024-11-07 19:17:13,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:17:13,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 19:17:13,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 19:17:13,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 19:17:13,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-07 19:17:13,775 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44
[2024-11-07 19:17:13,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 40 transitions, 129 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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:17:13,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 19:17:13,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44
[2024-11-07 19:17:13,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 19:17:14,037 INFO L124 PetriNetUnfolderBase]: 482/949 cut-off events.
[2024-11-07 19:17:14,038 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES.
[2024-11-07 19:17:14,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1949 conditions, 949 events. 482/949 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4750 event pairs, 141 based on Foata normal form. 8/937 useless extension candidates. Maximal degree in co-relation 1936. Up to 349 conditions per place.
[2024-11-07 19:17:14,042 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 25 selfloop transitions, 2 changer transitions 26/71 dead transitions.
[2024-11-07 19:17:14,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 71 transitions, 308 flow
[2024-11-07 19:17:14,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 19:17:14,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-07 19:17:14,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions.
[2024-11-07 19:17:14,044 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.538961038961039
[2024-11-07 19:17:14,044 INFO L175 Difference]: Start difference. First operand has 57 places, 40 transitions, 129 flow. Second operand 7 states and 166 transitions.
[2024-11-07 19:17:14,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 71 transitions, 308 flow
[2024-11-07 19:17:14,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 71 transitions, 284 flow, removed 7 selfloop flow, removed 7 redundant places.
[2024-11-07 19:17:14,047 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 125 flow
[2024-11-07 19:17:14,048 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=125, PETRI_PLACES=58, PETRI_TRANSITIONS=40}
[2024-11-07 19:17:14,050 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places.
[2024-11-07 19:17:14,050 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 125 flow
[2024-11-07 19:17:14,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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:17:14,050 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 19:17:14,050 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, 1]
[2024-11-07 19:17:14,055 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:17:14,254 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:17:14,254 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-07 19:17:14,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:17:14,255 INFO L85 PathProgramCache]: Analyzing trace with hash -946379979, now seen corresponding path program 4 times
[2024-11-07 19:17:14,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 19:17:14,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422709182]
[2024-11-07 19:17:14,255 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-07 19:17:14,255 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:17:14,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 19:17:14,257 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:17:14,260 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:17:14,356 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-07 19:17:14,357 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 19:17:14,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 14 conjuncts are in the unsatisfiable core
[2024-11-07 19:17:14,364 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 19:17:14,603 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:17:14,604 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 19:17:14,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 19:17:14,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1422709182]
[2024-11-07 19:17:14,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1422709182] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:17:14,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:17:14,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-07 19:17:14,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163395167]
[2024-11-07 19:17:14,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:17:14,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-07 19:17:14,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 19:17:14,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-07 19:17:14,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2024-11-07 19:17:14,618 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44
[2024-11-07 19:17:14,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 125 flow. Second operand has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 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:17:14,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 19:17:14,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44
[2024-11-07 19:17:14,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 19:17:14,915 INFO L124 PetriNetUnfolderBase]: 310/660 cut-off events.
[2024-11-07 19:17:14,916 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2024-11-07 19:17:14,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1320 conditions, 660 events. 310/660 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3109 event pairs, 149 based on Foata normal form. 8/641 useless extension candidates. Maximal degree in co-relation 1309. Up to 265 conditions per place.
[2024-11-07 19:17:14,919 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 21 selfloop transitions, 3 changer transitions 23/68 dead transitions.
[2024-11-07 19:17:14,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 68 transitions, 283 flow
[2024-11-07 19:17:14,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 19:17:14,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-07 19:17:14,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions.
[2024-11-07 19:17:14,921 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5876623376623377
[2024-11-07 19:17:14,921 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 125 flow. Second operand 7 states and 181 transitions.
[2024-11-07 19:17:14,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 68 transitions, 283 flow
[2024-11-07 19:17:14,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 68 transitions, 269 flow, removed 5 selfloop flow, removed 5 redundant places.
[2024-11-07 19:17:14,923 INFO L231 Difference]: Finished difference. Result has 60 places, 42 transitions, 142 flow
[2024-11-07 19:17:14,923 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=142, PETRI_PLACES=60, PETRI_TRANSITIONS=42}
[2024-11-07 19:17:14,924 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 11 predicate places.
[2024-11-07 19:17:14,924 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 42 transitions, 142 flow
[2024-11-07 19:17:14,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 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:17:14,926 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 19:17:14,926 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, 1]
[2024-11-07 19:17:14,931 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 (10)] Forceful destruction successful, exit code 0
[2024-11-07 19:17:15,130 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:17:15,130 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-07 19:17:15,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:17:15,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1586278465, now seen corresponding path program 5 times
[2024-11-07 19:17:15,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 19:17:15,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [541944348]
[2024-11-07 19:17:15,131 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-11-07 19:17:15,131 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:17:15,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 19:17:15,133 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:17:15,135 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:17:15,215 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-07 19:17:15,215 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 19:17:15,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-07 19:17:15,220 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 19:17:15,507 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:17:15,507 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 19:17:15,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 19:17:15,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [541944348]
[2024-11-07 19:17:15,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [541944348] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:17:15,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:17:15,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-07 19:17:15,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208720288]
[2024-11-07 19:17:15,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:17:15,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-07 19:17:15,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 19:17:15,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-07 19:17:15,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-11-07 19:17:15,522 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44
[2024-11-07 19:17:15,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 42 transitions, 142 flow. Second operand has 9 states, 9 states have (on average 20.77777777777778) internal successors, (187), 9 states have internal predecessors, (187), 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:17:15,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 19:17:15,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44
[2024-11-07 19:17:15,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 19:17:15,827 INFO L124 PetriNetUnfolderBase]: 315/657 cut-off events.
[2024-11-07 19:17:15,827 INFO L125 PetriNetUnfolderBase]: For 74/78 co-relation queries the response was YES.
[2024-11-07 19:17:15,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1384 conditions, 657 events. 315/657 cut-off events. For 74/78 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3262 event pairs, 63 based on Foata normal form. 8/628 useless extension candidates. Maximal degree in co-relation 1371. Up to 185 conditions per place.
[2024-11-07 19:17:15,830 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 28 selfloop transitions, 5 changer transitions 18/72 dead transitions.
[2024-11-07 19:17:15,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 72 transitions, 316 flow
[2024-11-07 19:17:15,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-07 19:17:15,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-11-07 19:17:15,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 221 transitions.
[2024-11-07 19:17:15,832 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5580808080808081
[2024-11-07 19:17:15,832 INFO L175 Difference]: Start difference. First operand has 60 places, 42 transitions, 142 flow. Second operand 9 states and 221 transitions.
[2024-11-07 19:17:15,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 72 transitions, 316 flow
[2024-11-07 19:17:15,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 72 transitions, 299 flow, removed 7 selfloop flow, removed 5 redundant places.
[2024-11-07 19:17:15,834 INFO L231 Difference]: Finished difference. Result has 64 places, 44 transitions, 164 flow
[2024-11-07 19:17:15,834 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=164, PETRI_PLACES=64, PETRI_TRANSITIONS=44}
[2024-11-07 19:17:15,835 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 15 predicate places.
[2024-11-07 19:17:15,835 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 44 transitions, 164 flow
[2024-11-07 19:17:15,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.77777777777778) internal successors, (187), 9 states have internal predecessors, (187), 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:17:15,835 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 19:17:15,835 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, 1]
[2024-11-07 19:17:15,840 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 (11)] Ended with exit code 0
[2024-11-07 19:17:16,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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:17:16,039 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-07 19:17:16,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:17:16,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1253360139, now seen corresponding path program 6 times
[2024-11-07 19:17:16,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 19:17:16,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1915791382]
[2024-11-07 19:17:16,040 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-11-07 19:17:16,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:17:16,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 19:17:16,044 INFO L229 MonitoredProcess]: Starting monitored process 12 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:17:16,046 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 (12)] Waiting until timeout for monitored process
[2024-11-07 19:17:16,140 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s)
[2024-11-07 19:17:16,140 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-07 19:17:16,140 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 19:17:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 19:17:16,256 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace
[2024-11-07 19:17:16,256 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-07 19:17:16,257 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining)
[2024-11-07 19:17:16,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining)
[2024-11-07 19:17:16,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining)
[2024-11-07 19:17:16,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining)
[2024-11-07 19:17:16,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining)
[2024-11-07 19:17:16,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining)
[2024-11-07 19:17:16,260 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining)
[2024-11-07 19:17:16,265 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 (12)] Ended with exit code 0
[2024-11-07 19:17:16,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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:17:16,460 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1]
[2024-11-07 19:17:16,550 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-07 19:17:16,551 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 19:17:16,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:17:16 BasicIcfg
[2024-11-07 19:17:16,559 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 19:17:16,560 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 19:17:16,560 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 19:17:16,560 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 19:17:16,561 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:17:08" (3/4) ...
[2024-11-07 19:17:16,562 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-07 19:17:16,563 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 19:17:16,564 INFO L158 Benchmark]: Toolchain (without parser) took 9757.78ms. Allocated memory was 83.9MB in the beginning and 142.6MB in the end (delta: 58.7MB). Free memory was 59.4MB in the beginning and 93.3MB in the end (delta: -33.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-07 19:17:16,564 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 83.9MB. Free memory was 65.1MB in the beginning and 65.1MB in the end (delta: 35.8kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 19:17:16,565 INFO L158 Benchmark]: CACSL2BoogieTranslator took 527.88ms. Allocated memory is still 83.9MB. Free memory was 59.4MB in the beginning and 36.3MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-07 19:17:16,565 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.13ms. Allocated memory is still 83.9MB. Free memory was 36.3MB in the beginning and 34.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 19:17:16,565 INFO L158 Benchmark]: Boogie Preprocessor took 70.89ms. Allocated memory is still 83.9MB. Free memory was 34.0MB in the beginning and 31.4MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 19:17:16,565 INFO L158 Benchmark]: RCFGBuilder took 860.40ms. Allocated memory is still 83.9MB. Free memory was 31.1MB in the beginning and 39.1MB in the end (delta: -8.0MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB.
[2024-11-07 19:17:16,565 INFO L158 Benchmark]: TraceAbstraction took 8216.89ms. Allocated memory was 83.9MB in the beginning and 142.6MB in the end (delta: 58.7MB). Free memory was 38.6MB in the beginning and 93.3MB in the end (delta: -54.7MB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB.
[2024-11-07 19:17:16,566 INFO L158 Benchmark]: Witness Printer took 2.94ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 93.3MB in the end (delta: 12.6kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 19:17:16,568 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.30ms. Allocated memory is still 83.9MB. Free memory was 65.1MB in the beginning and 65.1MB in the end (delta: 35.8kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 527.88ms. Allocated memory is still 83.9MB. Free memory was 59.4MB in the beginning and 36.3MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 71.13ms. Allocated memory is still 83.9MB. Free memory was 36.3MB in the beginning and 34.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 70.89ms. Allocated memory is still 83.9MB. Free memory was 34.0MB in the beginning and 31.4MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 860.40ms. Allocated memory is still 83.9MB. Free memory was 31.1MB in the beginning and 39.1MB in the end (delta: -8.0MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB.
* TraceAbstraction took 8216.89ms. Allocated memory was 83.9MB in the beginning and 142.6MB in the end (delta: 58.7MB). Free memory was 38.6MB in the beginning and 93.3MB in the end (delta: -54.7MB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB.
* Witness Printer took 2.94ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 93.3MB in the end (delta: 12.6kB). There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: overapproximation of memtrack at line 18.
Possible FailurePath:
[L710] 0 int __unbuffered_cnt = 0;
[L712] 0 int __unbuffered_p0_EAX = 0;
[L714] 0 int __unbuffered_p0_EBX = 0;
[L716] 0 int __unbuffered_p2_EAX = 0;
[L717] 0 _Bool main$tmp_guard0;
[L718] 0 _Bool main$tmp_guard1;
[L720] 0 int x = 0;
[L721] 0 _Bool x$flush_delayed;
[L722] 0 int x$mem_tmp;
[L723] 0 _Bool x$r_buff0_thd0;
[L724] 0 _Bool x$r_buff0_thd1;
[L725] 0 _Bool x$r_buff0_thd2;
[L726] 0 _Bool x$r_buff0_thd3;
[L727] 0 _Bool x$r_buff1_thd0;
[L728] 0 _Bool x$r_buff1_thd1;
[L729] 0 _Bool x$r_buff1_thd2;
[L730] 0 _Bool x$r_buff1_thd3;
[L731] 0 _Bool x$read_delayed;
[L732] 0 int *x$read_delayed_var;
[L733] 0 int x$w_buff0;
[L734] 0 _Bool x$w_buff0_used;
[L735] 0 int x$w_buff1;
[L736] 0 _Bool x$w_buff1_used;
[L738] 0 int y = 0;
[L739] 0 _Bool weak$$choice0;
[L740] 0 _Bool weak$$choice2;
[L829] 0 pthread_t t1828;
[L830] FCALL, FORK 0 pthread_create(&t1828, ((void *)0), P0, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1828=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L831] 0 pthread_t t1829;
[L832] FCALL, FORK 0 pthread_create(&t1829, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1828=0, t1829=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L833] 0 pthread_t t1830;
[L834] FCALL, FORK 0 pthread_create(&t1830, ((void *)0), P2, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1828=0, t1829=1, t1830=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L772] 2 x$w_buff1 = x$w_buff0
[L773] 2 x$w_buff0 = 1
[L774] 2 x$w_buff1_used = x$w_buff0_used
[L775] 2 x$w_buff0_used = (_Bool)1
[L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L19] COND FALSE 2 !(!expression)
[L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0
[L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1
[L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2
[L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3
[L781] 2 x$r_buff0_thd2 = (_Bool)1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L784] 2 y = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1]
[L801] 3 __unbuffered_p2_EAX = y
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1]
[L804] 3 y = 2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2]
[L807] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L809] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L811] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2]
[L744] 1 __unbuffered_p0_EAX = y
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2]
[L747] 1 weak$$choice0 = __VERIFIER_nondet_bool()
[L748] 1 weak$$choice2 = __VERIFIER_nondet_bool()
[L749] 1 x$flush_delayed = weak$$choice2
[L750] 1 x$mem_tmp = x
[L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L758] 1 __unbuffered_p0_EBX = x
[L759] 1 x = x$flush_delayed ? x$mem_tmp : x
[L760] 1 x$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2]
[L787] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L789] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
[L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
[L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
[L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
[L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828=0, t1829=1, t1830=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
[L838] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L4] COND FALSE 0 !(!cond)
[L838] RET 0 assume_abort_if_not(main$tmp_guard0)
[L840] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L842] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L844] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828=0, t1829=1, t1830=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
[L847] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828=0, t1829=1, t1830=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
[L849] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L19] COND TRUE 0 !expression
[L19] CALL 0 reach_error()
[L18] COND FALSE 0 !(0)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
[L18] 0 __assert_fail ("0", "safe002_power.opt_pso.oepc_pso.opt_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
- UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 827]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 830]: 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: 832]: 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: 834]: 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.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 7 procedures, 68 locations, 7 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: 8.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 383 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 347 mSDsluCounter, 151 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 130 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1289 IncrementalHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 21 mSDtfsCounter, 1289 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=4, InterpolantAutomatonStates: 56, 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, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 276 NumberOfCodeBlocks, 275 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 236 ConstructedInterpolants, 0 QuantifiedInterpolants, 905 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1075 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 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:17:16,593 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
Writing output log to file Ultimate.log
Result:
UNKNOWN: Overapproximated counterexample