./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix036.oepc.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
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/AutomizerReach.xml', '-i', '../sv-benchmarks/c/pthread-wmm/mix036.oepc.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'e3d3e405a2d3cb3ab8b02ed87788ef59412b7b81517118cc37c044f334087868']
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/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix036.oepc.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e3d3e405a2d3cb3ab8b02ed87788ef59412b7b81517118cc37c044f334087868
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 11:11:59,990 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 11:12:00,109 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-07 11:12:00,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 11:12:00,116 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 11:12:00,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 11:12:00,148 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 11:12:00,148 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 11:12:00,149 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 11:12:00,149 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 11:12:00,149 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 11:12:00,150 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 11:12:00,150 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 11:12:00,150 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 11:12:00,151 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 11:12:00,151 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 11:12:00,151 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 11:12:00,151 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 11:12:00,152 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 11:12:00,152 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 11:12:00,152 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 11:12:00,152 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 11:12:00,152 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 11:12:00,152 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 11:12:00,152 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 11:12:00,152 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 11:12:00,153 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 11:12:00,153 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 11:12:00,153 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 11:12:00,153 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 11:12:00,154 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 11:12:00,154 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 11:12:00,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 11:12:00,154 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 11:12:00,154 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 11:12:00,154 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 11:12:00,154 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 11:12:00,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 11:12:00,154 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 11:12:00,154 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 11:12:00,154 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 11:12:00,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 11:12:00,154 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 ! call(reach_error())) )
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 -> e3d3e405a2d3cb3ab8b02ed87788ef59412b7b81517118cc37c044f334087868
[2024-11-07 11:12:00,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 11:12:00,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 11:12:00,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 11:12:00,443 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 11:12:00,443 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 11:12:00,444 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix036.oepc.i
[2024-11-07 11:12:01,862 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 11:12:02,136 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 11:12:02,137 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix036.oepc.i
[2024-11-07 11:12:02,156 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/51f2740a3/6e2027bb32c14ccc99eb0fc47592d89d/FLAG0715207e5
[2024-11-07 11:12:02,179 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/51f2740a3/6e2027bb32c14ccc99eb0fc47592d89d
[2024-11-07 11:12:02,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 11:12:02,184 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 11:12:02,186 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 11:12:02,187 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 11:12:02,193 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 11:12:02,194 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:12:02" (1/1) ...
[2024-11-07 11:12:02,195 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@137da042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:12:02, skipping insertion in model container
[2024-11-07 11:12:02,196 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:12:02" (1/1) ...
[2024-11-07 11:12:02,240 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 11:12:02,383 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix036.oepc.i[945,958]
[2024-11-07 11:12:02,530 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 11:12:02,546 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 11:12:02,557 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix036.oepc.i[945,958]
[2024-11-07 11:12:02,632 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 11:12:02,680 INFO L204 MainTranslator]: Completed translation
[2024-11-07 11:12:02,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:12:02 WrapperNode
[2024-11-07 11:12:02,682 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 11:12:02,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 11:12:02,684 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 11:12:02,684 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 11:12:02,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:12:02" (1/1) ...
[2024-11-07 11:12:02,718 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:12:02" (1/1) ...
[2024-11-07 11:12:02,747 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130
[2024-11-07 11:12:02,748 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 11:12:02,749 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 11:12:02,749 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 11:12:02,749 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 11:12:02,758 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:12:02" (1/1) ...
[2024-11-07 11:12:02,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:12:02" (1/1) ...
[2024-11-07 11:12:02,763 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:12:02" (1/1) ...
[2024-11-07 11:12:02,796 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 11:12:02,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:12:02" (1/1) ...
[2024-11-07 11:12:02,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:12:02" (1/1) ...
[2024-11-07 11:12:02,810 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:12:02" (1/1) ...
[2024-11-07 11:12:02,816 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:12:02" (1/1) ...
[2024-11-07 11:12:02,822 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:12:02" (1/1) ...
[2024-11-07 11:12:02,823 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:12:02" (1/1) ...
[2024-11-07 11:12:02,826 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 11:12:02,830 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 11:12:02,830 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 11:12:02,830 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 11:12:02,834 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:12:02" (1/1) ...
[2024-11-07 11:12:02,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 11:12:02,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 11:12:02,873 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 11:12:02,882 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 11:12:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-07 11:12:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 11:12:02,906 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-11-07 11:12:02,906 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-11-07 11:12:02,906 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-11-07 11:12:02,906 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-11-07 11:12:02,906 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2024-11-07 11:12:02,906 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2024-11-07 11:12:02,906 INFO L130 BoogieDeclarations]: Found specification of procedure P3
[2024-11-07 11:12:02,906 INFO L138 BoogieDeclarations]: Found implementation of procedure P3
[2024-11-07 11:12:02,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 11:12:02,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-07 11:12:02,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 11:12:02,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 11:12:02,908 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 11:12:03,081 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 11:12:03,083 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 11:12:03,527 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-07 11:12:03,529 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 11:12:03,771 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 11:12:03,772 INFO L316 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-07 11:12:03,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:12:03 BoogieIcfgContainer
[2024-11-07 11:12:03,772 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 11:12:03,774 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 11:12:03,774 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 11:12:03,779 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 11:12:03,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 11:12:02" (1/3) ...
[2024-11-07 11:12:03,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e694902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:12:03, skipping insertion in model container
[2024-11-07 11:12:03,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:12:02" (2/3) ...
[2024-11-07 11:12:03,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e694902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:12:03, skipping insertion in model container
[2024-11-07 11:12:03,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:12:03" (3/3) ...
[2024-11-07 11:12:03,782 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036.oepc.i
[2024-11-07 11:12:03,797 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 11:12:03,797 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2024-11-07 11:12:03,797 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-07 11:12:03,900 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-07 11:12:03,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow
[2024-11-07 11:12:03,977 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events.
[2024-11-07 11:12:03,979 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-07 11:12:03,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place.
[2024-11-07 11:12:03,985 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow
[2024-11-07 11:12:03,992 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow
[2024-11-07 11:12:03,999 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 11:12:04,014 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=LoopHeads, 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;@1ee3bf27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 11:12:04,015 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-11-07 11:12:04,020 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-07 11:12:04,020 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-11-07 11:12:04,020 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-07 11:12:04,020 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:12:04,022 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-11-07 11:12:04,023 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-11-07 11:12:04,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:12:04,029 INFO L85 PathProgramCache]: Analyzing trace with hash 12118006, now seen corresponding path program 1 times
[2024-11-07 11:12:04,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:12:04,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118966872]
[2024-11-07 11:12:04,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:12:04,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:12:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:12:04,573 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 11:12:04,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:12:04,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118966872]
[2024-11-07 11:12:04,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118966872] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:12:04,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:12:04,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-07 11:12:04,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819600173]
[2024-11-07 11:12:04,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:12:04,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 11:12:04,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:12:04,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 11:12:04,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 11:12:04,604 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 50
[2024-11-07 11:12:04,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 11:12:04,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:12:04,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 50
[2024-11-07 11:12:04,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:12:05,642 INFO L124 PetriNetUnfolderBase]: 2495/3975 cut-off events.
[2024-11-07 11:12:05,643 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES.
[2024-11-07 11:12:05,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7551 conditions, 3975 events. 2495/3975 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 24905 event pairs, 1647 based on Foata normal form. 135/4047 useless extension candidates. Maximal degree in co-relation 7539. Up to 2779 conditions per place.
[2024-11-07 11:12:05,684 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 37 selfloop transitions, 2 changer transitions 2/62 dead transitions.
[2024-11-07 11:12:05,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 227 flow
[2024-11-07 11:12:05,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 11:12:05,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-07 11:12:05,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions.
[2024-11-07 11:12:05,700 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7933333333333333
[2024-11-07 11:12:05,702 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 119 transitions.
[2024-11-07 11:12:05,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 227 flow
[2024-11-07 11:12:05,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 220 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-11-07 11:12:05,717 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow
[2024-11-07 11:12:05,720 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=43}
[2024-11-07 11:12:05,724 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places.
[2024-11-07 11:12:05,726 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow
[2024-11-07 11:12:05,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 11:12:05,727 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:12:05,727 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:12:05,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 11:12:05,727 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-11-07 11:12:05,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:12:05,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1522146213, now seen corresponding path program 1 times
[2024-11-07 11:12:05,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:12:05,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782792611]
[2024-11-07 11:12:05,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:12:05,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:12:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:12:06,063 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 11:12:06,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:12:06,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782792611]
[2024-11-07 11:12:06,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782792611] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:12:06,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:12:06,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 11:12:06,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881460]
[2024-11-07 11:12:06,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:12:06,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 11:12:06,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:12:06,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 11:12:06,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 11:12:06,079 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50
[2024-11-07 11:12:06,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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 11:12:06,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:12:06,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50
[2024-11-07 11:12:06,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:12:07,678 INFO L124 PetriNetUnfolderBase]: 7779/12179 cut-off events.
[2024-11-07 11:12:07,679 INFO L125 PetriNetUnfolderBase]: For 554/554 co-relation queries the response was YES.
[2024-11-07 11:12:07,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23595 conditions, 12179 events. 7779/12179 cut-off events. For 554/554 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 87025 event pairs, 1033 based on Foata normal form. 400/12011 useless extension candidates. Maximal degree in co-relation 23585. Up to 5841 conditions per place.
[2024-11-07 11:12:07,779 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 52 selfloop transitions, 6 changer transitions 1/75 dead transitions.
[2024-11-07 11:12:07,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 75 transitions, 290 flow
[2024-11-07 11:12:07,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 11:12:07,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-07 11:12:07,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions.
[2024-11-07 11:12:07,781 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.705
[2024-11-07 11:12:07,782 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 4 states and 141 transitions.
[2024-11-07 11:12:07,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 75 transitions, 290 flow
[2024-11-07 11:12:07,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 75 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-07 11:12:07,785 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 136 flow
[2024-11-07 11:12:07,785 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=57, PETRI_TRANSITIONS=47}
[2024-11-07 11:12:07,786 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places.
[2024-11-07 11:12:07,786 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 136 flow
[2024-11-07 11:12:07,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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 11:12:07,786 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:12:07,786 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:12:07,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-07 11:12:07,787 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-11-07 11:12:07,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:12:07,787 INFO L85 PathProgramCache]: Analyzing trace with hash 380842421, now seen corresponding path program 1 times
[2024-11-07 11:12:07,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:12:07,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215985549]
[2024-11-07 11:12:07,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:12:07,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:12:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:12:08,159 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 11:12:08,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:12:08,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215985549]
[2024-11-07 11:12:08,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215985549] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:12:08,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:12:08,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 11:12:08,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591883248]
[2024-11-07 11:12:08,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:12:08,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 11:12:08,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:12:08,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 11:12:08,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-07 11:12:08,169 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50
[2024-11-07 11:12:08,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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 11:12:08,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:12:08,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50
[2024-11-07 11:12:08,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:12:09,412 INFO L124 PetriNetUnfolderBase]: 6075/9479 cut-off events.
[2024-11-07 11:12:09,412 INFO L125 PetriNetUnfolderBase]: For 2276/2276 co-relation queries the response was YES.
[2024-11-07 11:12:09,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21263 conditions, 9479 events. 6075/9479 cut-off events. For 2276/2276 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 63613 event pairs, 451 based on Foata normal form. 364/9430 useless extension candidates. Maximal degree in co-relation 21251. Up to 3681 conditions per place.
[2024-11-07 11:12:09,469 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 67 selfloop transitions, 10 changer transitions 1/94 dead transitions.
[2024-11-07 11:12:09,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 94 transitions, 415 flow
[2024-11-07 11:12:09,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 11:12:09,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-07 11:12:09,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions.
[2024-11-07 11:12:09,472 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.72
[2024-11-07 11:12:09,473 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 136 flow. Second operand 5 states and 180 transitions.
[2024-11-07 11:12:09,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 94 transitions, 415 flow
[2024-11-07 11:12:09,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 94 transitions, 404 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-11-07 11:12:09,478 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 188 flow
[2024-11-07 11:12:09,479 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=61, PETRI_TRANSITIONS=51}
[2024-11-07 11:12:09,481 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places.
[2024-11-07 11:12:09,481 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 188 flow
[2024-11-07 11:12:09,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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 11:12:09,482 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:12:09,482 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]
[2024-11-07 11:12:09,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-07 11:12:09,482 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-11-07 11:12:09,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:12:09,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1079339046, now seen corresponding path program 1 times
[2024-11-07 11:12:09,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:12:09,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559878716]
[2024-11-07 11:12:09,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:12:09,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:12:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:12:09,830 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 11:12:09,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:12:09,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559878716]
[2024-11-07 11:12:09,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559878716] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:12:09,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:12:09,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 11:12:09,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857884532]
[2024-11-07 11:12:09,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:12:09,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 11:12:09,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:12:09,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 11:12:09,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-07 11:12:09,840 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50
[2024-11-07 11:12:09,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 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 11:12:09,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:12:09,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50
[2024-11-07 11:12:09,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:12:10,630 INFO L124 PetriNetUnfolderBase]: 4027/6127 cut-off events.
[2024-11-07 11:12:10,631 INFO L125 PetriNetUnfolderBase]: For 4654/4654 co-relation queries the response was YES.
[2024-11-07 11:12:10,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15577 conditions, 6127 events. 4027/6127 cut-off events. For 4654/4654 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 35857 event pairs, 289 based on Foata normal form. 244/6128 useless extension candidates. Maximal degree in co-relation 15563. Up to 1788 conditions per place.
[2024-11-07 11:12:10,666 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 80 selfloop transitions, 14 changer transitions 1/111 dead transitions.
[2024-11-07 11:12:10,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 111 transitions, 546 flow
[2024-11-07 11:12:10,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 11:12:10,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-07 11:12:10,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 217 transitions.
[2024-11-07 11:12:10,670 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7233333333333334
[2024-11-07 11:12:10,670 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 188 flow. Second operand 6 states and 217 transitions.
[2024-11-07 11:12:10,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 111 transitions, 546 flow
[2024-11-07 11:12:10,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 111 transitions, 516 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-11-07 11:12:10,701 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 238 flow
[2024-11-07 11:12:10,701 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=64, PETRI_TRANSITIONS=55}
[2024-11-07 11:12:10,702 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places.
[2024-11-07 11:12:10,702 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 238 flow
[2024-11-07 11:12:10,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 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 11:12:10,703 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:12:10,703 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, 1]
[2024-11-07 11:12:10,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-07 11:12:10,703 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-11-07 11:12:10,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:12:10,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1399505867, now seen corresponding path program 1 times
[2024-11-07 11:12:10,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:12:10,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379561327]
[2024-11-07 11:12:10,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:12:10,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:12:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:12:11,060 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 11:12:11,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:12:11,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379561327]
[2024-11-07 11:12:11,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379561327] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:12:11,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:12:11,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-07 11:12:11,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324693971]
[2024-11-07 11:12:11,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:12:11,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 11:12:11,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:12:11,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 11:12:11,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-07 11:12:11,068 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50
[2024-11-07 11:12:11,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 238 flow. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 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 11:12:11,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:12:11,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50
[2024-11-07 11:12:11,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:12:11,755 INFO L124 PetriNetUnfolderBase]: 2863/4175 cut-off events.
[2024-11-07 11:12:11,756 INFO L125 PetriNetUnfolderBase]: For 5022/5022 co-relation queries the response was YES.
[2024-11-07 11:12:11,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11602 conditions, 4175 events. 2863/4175 cut-off events. For 5022/5022 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 21738 event pairs, 231 based on Foata normal form. 96/4112 useless extension candidates. Maximal degree in co-relation 11587. Up to 1316 conditions per place.
[2024-11-07 11:12:11,791 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 71 selfloop transitions, 18 changer transitions 1/106 dead transitions.
[2024-11-07 11:12:11,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 106 transitions, 536 flow
[2024-11-07 11:12:11,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 11:12:11,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-07 11:12:11,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 232 transitions.
[2024-11-07 11:12:11,793 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6628571428571428
[2024-11-07 11:12:11,794 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 238 flow. Second operand 7 states and 232 transitions.
[2024-11-07 11:12:11,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 106 transitions, 536 flow
[2024-11-07 11:12:11,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 106 transitions, 490 flow, removed 9 selfloop flow, removed 5 redundant places.
[2024-11-07 11:12:11,833 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 248 flow
[2024-11-07 11:12:11,833 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=248, PETRI_PLACES=67, PETRI_TRANSITIONS=55}
[2024-11-07 11:12:11,834 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places.
[2024-11-07 11:12:11,834 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 248 flow
[2024-11-07 11:12:11,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 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 11:12:11,835 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:12:11,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, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:12:11,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-07 11:12:11,835 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-11-07 11:12:11,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:12:11,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1982668947, now seen corresponding path program 1 times
[2024-11-07 11:12:11,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:12:11,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227058114]
[2024-11-07 11:12:11,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:12:11,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:12:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:12:14,210 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 11:12:14,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:12:14,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227058114]
[2024-11-07 11:12:14,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227058114] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:12:14,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:12:14,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-11-07 11:12:14,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31825563]
[2024-11-07 11:12:14,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:12:14,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-07 11:12:14,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:12:14,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-07 11:12:14,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-11-07 11:12:14,270 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50
[2024-11-07 11:12:14,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 248 flow. Second operand has 10 states, 10 states have (on average 21.4) internal successors, (214), 10 states have internal predecessors, (214), 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 11:12:14,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:12:14,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50
[2024-11-07 11:12:14,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:12:15,446 INFO L124 PetriNetUnfolderBase]: 5981/9391 cut-off events.
[2024-11-07 11:12:15,446 INFO L125 PetriNetUnfolderBase]: For 4639/4875 co-relation queries the response was YES.
[2024-11-07 11:12:15,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22522 conditions, 9391 events. 5981/9391 cut-off events. For 4639/4875 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 61391 event pairs, 1708 based on Foata normal form. 16/9062 useless extension candidates. Maximal degree in co-relation 22506. Up to 2773 conditions per place.
[2024-11-07 11:12:15,493 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 85 selfloop transitions, 15 changer transitions 12/139 dead transitions.
[2024-11-07 11:12:15,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 139 transitions, 682 flow
[2024-11-07 11:12:15,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-07 11:12:15,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-11-07 11:12:15,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 303 transitions.
[2024-11-07 11:12:15,495 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.606
[2024-11-07 11:12:15,496 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 248 flow. Second operand 10 states and 303 transitions.
[2024-11-07 11:12:15,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 139 transitions, 682 flow
[2024-11-07 11:12:15,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 139 transitions, 566 flow, removed 27 selfloop flow, removed 10 redundant places.
[2024-11-07 11:12:15,573 INFO L231 Difference]: Finished difference. Result has 73 places, 68 transitions, 262 flow
[2024-11-07 11:12:15,573 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=262, PETRI_PLACES=73, PETRI_TRANSITIONS=68}
[2024-11-07 11:12:15,573 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 15 predicate places.
[2024-11-07 11:12:15,573 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 68 transitions, 262 flow
[2024-11-07 11:12:15,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.4) internal successors, (214), 10 states have internal predecessors, (214), 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 11:12:15,574 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:12:15,574 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:12:15,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-07 11:12:15,574 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-11-07 11:12:15,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:12:15,574 INFO L85 PathProgramCache]: Analyzing trace with hash 501387347, now seen corresponding path program 2 times
[2024-11-07 11:12:15,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:12:15,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446326063]
[2024-11-07 11:12:15,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:12:15,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:12:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:12:15,959 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 11:12:15,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:12:15,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446326063]
[2024-11-07 11:12:15,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446326063] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:12:15,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:12:15,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 11:12:15,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91608982]
[2024-11-07 11:12:15,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:12:15,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 11:12:15,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:12:15,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 11:12:15,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-07 11:12:15,981 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50
[2024-11-07 11:12:15,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 68 transitions, 262 flow. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 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 11:12:15,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:12:15,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50
[2024-11-07 11:12:15,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:12:17,620 INFO L124 PetriNetUnfolderBase]: 11807/18247 cut-off events.
[2024-11-07 11:12:17,620 INFO L125 PetriNetUnfolderBase]: For 10300/10374 co-relation queries the response was YES.
[2024-11-07 11:12:17,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45891 conditions, 18247 events. 11807/18247 cut-off events. For 10300/10374 co-relation queries the response was YES. Maximal size of possible extension queue 1004. Compared 128372 event pairs, 2157 based on Foata normal form. 42/17536 useless extension candidates. Maximal degree in co-relation 45873. Up to 7554 conditions per place.
[2024-11-07 11:12:17,779 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 80 selfloop transitions, 17 changer transitions 12/135 dead transitions.
[2024-11-07 11:12:17,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 135 transitions, 724 flow
[2024-11-07 11:12:17,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-07 11:12:17,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-07 11:12:17,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 236 transitions.
[2024-11-07 11:12:17,781 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.59
[2024-11-07 11:12:17,781 INFO L175 Difference]: Start difference. First operand has 73 places, 68 transitions, 262 flow. Second operand 8 states and 236 transitions.
[2024-11-07 11:12:17,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 135 transitions, 724 flow
[2024-11-07 11:12:17,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 135 transitions, 717 flow, removed 3 selfloop flow, removed 3 redundant places.
[2024-11-07 11:12:17,790 INFO L231 Difference]: Finished difference. Result has 79 places, 76 transitions, 357 flow
[2024-11-07 11:12:17,790 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=357, PETRI_PLACES=79, PETRI_TRANSITIONS=76}
[2024-11-07 11:12:17,791 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 21 predicate places.
[2024-11-07 11:12:17,791 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 76 transitions, 357 flow
[2024-11-07 11:12:17,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 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 11:12:17,791 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:12:17,791 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:12:17,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-07 11:12:17,792 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-11-07 11:12:17,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:12:17,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1398659825, now seen corresponding path program 3 times
[2024-11-07 11:12:17,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:12:17,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257952132]
[2024-11-07 11:12:17,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:12:17,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:12:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:12:18,163 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 11:12:18,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:12:18,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257952132]
[2024-11-07 11:12:18,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257952132] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:12:18,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:12:18,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-07 11:12:18,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899623466]
[2024-11-07 11:12:18,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:12:18,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 11:12:18,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:12:18,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 11:12:18,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-07 11:12:18,199 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50
[2024-11-07 11:12:18,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 76 transitions, 357 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 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 11:12:18,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:12:18,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50
[2024-11-07 11:12:18,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:12:20,444 INFO L124 PetriNetUnfolderBase]: 17865/28198 cut-off events.
[2024-11-07 11:12:20,445 INFO L125 PetriNetUnfolderBase]: For 22313/22323 co-relation queries the response was YES.
[2024-11-07 11:12:20,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70914 conditions, 28198 events. 17865/28198 cut-off events. For 22313/22323 co-relation queries the response was YES. Maximal size of possible extension queue 1638. Compared 216801 event pairs, 1803 based on Foata normal form. 34/27051 useless extension candidates. Maximal degree in co-relation 70893. Up to 13297 conditions per place.
[2024-11-07 11:12:20,595 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 62 selfloop transitions, 16 changer transitions 31/136 dead transitions.
[2024-11-07 11:12:20,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 136 transitions, 837 flow
[2024-11-07 11:12:20,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 11:12:20,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-07 11:12:20,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 206 transitions.
[2024-11-07 11:12:20,597 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5885714285714285
[2024-11-07 11:12:20,597 INFO L175 Difference]: Start difference. First operand has 79 places, 76 transitions, 357 flow. Second operand 7 states and 206 transitions.
[2024-11-07 11:12:20,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 136 transitions, 837 flow
[2024-11-07 11:12:20,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 136 transitions, 831 flow, removed 3 selfloop flow, removed 2 redundant places.
[2024-11-07 11:12:20,606 INFO L231 Difference]: Finished difference. Result has 85 places, 73 transitions, 373 flow
[2024-11-07 11:12:20,607 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=373, PETRI_PLACES=85, PETRI_TRANSITIONS=73}
[2024-11-07 11:12:20,607 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 27 predicate places.
[2024-11-07 11:12:20,607 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 73 transitions, 373 flow
[2024-11-07 11:12:20,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 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 11:12:20,608 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:12:20,611 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:12:20,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-07 11:12:20,612 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-11-07 11:12:20,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:12:20,612 INFO L85 PathProgramCache]: Analyzing trace with hash 85663239, now seen corresponding path program 4 times
[2024-11-07 11:12:20,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:12:20,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834619987]
[2024-11-07 11:12:20,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:12:20,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:12:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:12:22,047 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 11:12:22,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:12:22,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834619987]
[2024-11-07 11:12:22,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834619987] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:12:22,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:12:22,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-11-07 11:12:22,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991122600]
[2024-11-07 11:12:22,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:12:22,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-07 11:12:22,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:12:22,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-07 11:12:22,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-11-07 11:12:22,093 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50
[2024-11-07 11:12:22,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 73 transitions, 373 flow. Second operand has 10 states, 10 states have (on average 21.4) internal successors, (214), 10 states have internal predecessors, (214), 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 11:12:22,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:12:22,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50
[2024-11-07 11:12:22,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:12:24,459 INFO L124 PetriNetUnfolderBase]: 11861/19231 cut-off events.
[2024-11-07 11:12:24,460 INFO L125 PetriNetUnfolderBase]: For 19844/19917 co-relation queries the response was YES.
[2024-11-07 11:12:24,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49083 conditions, 19231 events. 11861/19231 cut-off events. For 19844/19917 co-relation queries the response was YES. Maximal size of possible extension queue 1161. Compared 149544 event pairs, 2763 based on Foata normal form. 32/18212 useless extension candidates. Maximal degree in co-relation 49058. Up to 5428 conditions per place.
[2024-11-07 11:12:24,608 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 87 selfloop transitions, 21 changer transitions 17/154 dead transitions.
[2024-11-07 11:12:24,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 154 transitions, 927 flow
[2024-11-07 11:12:24,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-07 11:12:24,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-11-07 11:12:24,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 301 transitions.
[2024-11-07 11:12:24,610 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.602
[2024-11-07 11:12:24,610 INFO L175 Difference]: Start difference. First operand has 85 places, 73 transitions, 373 flow. Second operand 10 states and 301 transitions.
[2024-11-07 11:12:24,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 154 transitions, 927 flow
[2024-11-07 11:12:24,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 154 transitions, 893 flow, removed 17 selfloop flow, removed 4 redundant places.
[2024-11-07 11:12:24,624 INFO L231 Difference]: Finished difference. Result has 91 places, 80 transitions, 475 flow
[2024-11-07 11:12:24,624 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=475, PETRI_PLACES=91, PETRI_TRANSITIONS=80}
[2024-11-07 11:12:24,624 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 33 predicate places.
[2024-11-07 11:12:24,625 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 80 transitions, 475 flow
[2024-11-07 11:12:24,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.4) internal successors, (214), 10 states have internal predecessors, (214), 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 11:12:24,625 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:12:24,625 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:12:24,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-07 11:12:24,625 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-11-07 11:12:24,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:12:24,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1104061475, now seen corresponding path program 5 times
[2024-11-07 11:12:24,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:12:24,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131419155]
[2024-11-07 11:12:24,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:12:24,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:12:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:12:24,993 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 11:12:24,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:12:24,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131419155]
[2024-11-07 11:12:24,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131419155] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:12:24,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:12:24,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 11:12:24,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430453487]
[2024-11-07 11:12:24,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:12:24,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 11:12:24,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:12:24,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 11:12:24,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-07 11:12:25,018 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50
[2024-11-07 11:12:25,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 80 transitions, 475 flow. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 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 11:12:25,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:12:25,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50
[2024-11-07 11:12:25,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:12:27,336 INFO L124 PetriNetUnfolderBase]: 19984/32694 cut-off events.
[2024-11-07 11:12:27,336 INFO L125 PetriNetUnfolderBase]: For 43252/43328 co-relation queries the response was YES.
[2024-11-07 11:12:27,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88707 conditions, 32694 events. 19984/32694 cut-off events. For 43252/43328 co-relation queries the response was YES. Maximal size of possible extension queue 1994. Compared 275881 event pairs, 8090 based on Foata normal form. 34/30839 useless extension candidates. Maximal degree in co-relation 88679. Up to 12273 conditions per place.
[2024-11-07 11:12:27,495 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 53 selfloop transitions, 7 changer transitions 73/161 dead transitions.
[2024-11-07 11:12:27,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 161 transitions, 1186 flow
[2024-11-07 11:12:27,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-07 11:12:27,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-07 11:12:27,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 239 transitions.
[2024-11-07 11:12:27,497 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5975
[2024-11-07 11:12:27,497 INFO L175 Difference]: Start difference. First operand has 91 places, 80 transitions, 475 flow. Second operand 8 states and 239 transitions.
[2024-11-07 11:12:27,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 161 transitions, 1186 flow
[2024-11-07 11:12:27,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 161 transitions, 1129 flow, removed 9 selfloop flow, removed 6 redundant places.
[2024-11-07 11:12:27,523 INFO L231 Difference]: Finished difference. Result has 94 places, 75 transitions, 411 flow
[2024-11-07 11:12:27,523 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=411, PETRI_PLACES=94, PETRI_TRANSITIONS=75}
[2024-11-07 11:12:27,523 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 36 predicate places.
[2024-11-07 11:12:27,523 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 75 transitions, 411 flow
[2024-11-07 11:12:27,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 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 11:12:27,524 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:12:27,524 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:12:27,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-07 11:12:27,524 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-11-07 11:12:27,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:12:27,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1498091081, now seen corresponding path program 6 times
[2024-11-07 11:12:27,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:12:27,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976383508]
[2024-11-07 11:12:27,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:12:27,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:12:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 11:12:27,603 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 11:12:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 11:12:27,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 11:12:27,725 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-07 11:12:27,726 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining)
[2024-11-07 11:12:27,728 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining)
[2024-11-07 11:12:27,728 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining)
[2024-11-07 11:12:27,728 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining)
[2024-11-07 11:12:27,728 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining)
[2024-11-07 11:12:27,728 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining)
[2024-11-07 11:12:27,728 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining)
[2024-11-07 11:12:27,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-07 11:12:27,729 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1]
[2024-11-07 11:12:28,028 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-07 11:12:28,032 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 11:12:28,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 11:12:28 BasicIcfg
[2024-11-07 11:12:28,038 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 11:12:28,039 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 11:12:28,039 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 11:12:28,039 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 11:12:28,040 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:12:03" (3/4) ...
[2024-11-07 11:12:28,041 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample
[2024-11-07 11:12:28,146 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-07 11:12:28,146 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 11:12:28,147 INFO L158 Benchmark]: Toolchain (without parser) took 25963.32ms. Allocated memory was 117.4MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 90.4MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 443.7MB. Max. memory is 16.1GB.
[2024-11-07 11:12:28,147 INFO L158 Benchmark]: CDTParser took 0.80ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 11:12:28,147 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.17ms. Allocated memory is still 117.4MB. Free memory was 90.2MB in the beginning and 66.2MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-07 11:12:28,148 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.63ms. Allocated memory is still 117.4MB. Free memory was 66.2MB in the beginning and 63.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 11:12:28,148 INFO L158 Benchmark]: Boogie Preprocessor took 80.06ms. Allocated memory is still 117.4MB. Free memory was 63.9MB in the beginning and 60.6MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 11:12:28,148 INFO L158 Benchmark]: RCFGBuilder took 942.75ms. Allocated memory is still 117.4MB. Free memory was 60.6MB in the beginning and 50.0MB in the end (delta: 10.6MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB.
[2024-11-07 11:12:28,148 INFO L158 Benchmark]: TraceAbstraction took 24263.83ms. Allocated memory was 117.4MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 49.6MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB.
[2024-11-07 11:12:28,148 INFO L158 Benchmark]: Witness Printer took 107.74ms. Allocated memory is still 2.3GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 11:12:28,149 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.80ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 496.17ms. Allocated memory is still 117.4MB. Free memory was 90.2MB in the beginning and 66.2MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 65.63ms. Allocated memory is still 117.4MB. Free memory was 66.2MB in the beginning and 63.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 80.06ms. Allocated memory is still 117.4MB. Free memory was 63.9MB in the beginning and 60.6MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* RCFGBuilder took 942.75ms. Allocated memory is still 117.4MB. Free memory was 60.6MB in the beginning and 50.0MB in the end (delta: 10.6MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB.
* TraceAbstraction took 24263.83ms. Allocated memory was 117.4MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 49.6MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB.
* Witness Printer took 107.74ms. Allocated memory is still 2.3GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L710] 0 int __unbuffered_cnt = 0;
[L712] 0 int __unbuffered_p0_EAX = 0;
[L714] 0 int __unbuffered_p1_EAX = 0;
[L716] 0 int __unbuffered_p2_EAX = 0;
[L718] 0 int __unbuffered_p3_EAX = 0;
[L720] 0 int __unbuffered_p3_EBX = 0;
[L722] 0 int a = 0;
[L724] 0 int b = 0;
[L725] 0 _Bool b$flush_delayed;
[L726] 0 int b$mem_tmp;
[L727] 0 _Bool b$r_buff0_thd0;
[L728] 0 _Bool b$r_buff0_thd1;
[L729] 0 _Bool b$r_buff0_thd2;
[L730] 0 _Bool b$r_buff0_thd3;
[L731] 0 _Bool b$r_buff0_thd4;
[L732] 0 _Bool b$r_buff1_thd0;
[L733] 0 _Bool b$r_buff1_thd1;
[L734] 0 _Bool b$r_buff1_thd2;
[L735] 0 _Bool b$r_buff1_thd3;
[L736] 0 _Bool b$r_buff1_thd4;
[L737] 0 _Bool b$read_delayed;
[L738] 0 int *b$read_delayed_var;
[L739] 0 int b$w_buff0;
[L740] 0 _Bool b$w_buff0_used;
[L741] 0 int b$w_buff1;
[L742] 0 _Bool b$w_buff1_used;
[L743] 0 _Bool main$tmp_guard0;
[L744] 0 _Bool main$tmp_guard1;
[L746] 0 int x = 0;
[L748] 0 int y = 0;
[L750] 0 int z = 0;
[L751] 0 _Bool weak$$choice0;
[L752] 0 _Bool weak$$choice2;
[L873] 0 pthread_t t937;
[L874] FCALL, FORK 0 pthread_create(&t937, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t937=-4, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L756] 1 b$w_buff1 = b$w_buff0
[L757] 1 b$w_buff0 = 1
[L758] 1 b$w_buff1_used = b$w_buff0_used
[L759] 1 b$w_buff0_used = (_Bool)1
[L760] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used))
[L18] COND FALSE 1 !(!expression)
[L760] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used))
[L761] 1 b$r_buff1_thd0 = b$r_buff0_thd0
[L762] 1 b$r_buff1_thd1 = b$r_buff0_thd1
[L763] 1 b$r_buff1_thd2 = b$r_buff0_thd2
[L764] 1 b$r_buff1_thd3 = b$r_buff0_thd3
[L765] 1 b$r_buff1_thd4 = b$r_buff0_thd4
[L766] 1 b$r_buff0_thd1 = (_Bool)1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L875] 0 pthread_t t938;
[L876] FCALL, FORK 0 pthread_create(&t938, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t937=-4, t938=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L877] 0 pthread_t t939;
[L878] FCALL, FORK 0 pthread_create(&t939, ((void *)0), P2, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t937=-4, t938=-3, t939=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L879] 0 pthread_t t940;
[L880] FCALL, FORK 0 pthread_create(&t940, ((void *)0), P3, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t937=-4, t938=-3, t939=-2, t940=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L769] 1 __unbuffered_p0_EAX = x
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L786] 2 x = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0]
[L789] 2 __unbuffered_p1_EAX = y
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0]
[L806] 3 y = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0]
[L809] 3 __unbuffered_p2_EAX = z
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0]
[L826] 4 z = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1]
[L829] 4 a = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1]
[L832] 4 __unbuffered_p3_EAX = a
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1]
[L835] 4 weak$$choice0 = __VERIFIER_nondet_bool()
[L836] 4 weak$$choice2 = __VERIFIER_nondet_bool()
[L837] 4 b$flush_delayed = weak$$choice2
[L838] 4 b$mem_tmp = b
[L839] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1)
[L840] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0))
[L841] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1))
[L842] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used))
[L843] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L844] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4))
[L845] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L846] 4 __unbuffered_p3_EBX = b
[L847] 4 b = b$flush_delayed ? b$mem_tmp : b
[L848] 4 b$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1]
[L772] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b)
[L773] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used
[L774] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used
[L775] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1
[L776] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1]
[L812] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b)
[L813] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used
[L814] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used
[L815] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3
[L816] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1]
[L792] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b)
[L793] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used
[L794] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used
[L795] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2
[L796] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1]
[L851] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b)
[L852] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used
[L853] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used
[L854] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4
[L855] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1]
[L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1]
[L799] 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=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1]
[L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1]
[L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1]
[L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t937=-4, t938=-3, t939=-2, t940=-1, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1]
[L884] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L884] RET 0 assume_abort_if_not(main$tmp_guard0)
[L886] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b)
[L887] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used
[L888] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used
[L889] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0
[L890] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t937=-4, t938=-3, t939=-2, t940=-1, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1]
[L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t937=-4, t938=-3, t939=-2, t940=-1, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1]
[L895] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1]
[L18] 0 reach_error()
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1]
- UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: Not analyzed.
- UnprovableResult [Line: 874]: 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: 880]: 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: 878]: 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: 876]: 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 9 procedures, 85 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: 23.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 16.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 916 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 858 mSDsluCounter, 622 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 540 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2055 IncrementalHoareTripleChecker+Invalid, 2118 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 82 mSDtfsCounter, 2055 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=475occurred in iteration=9, InterpolantAutomatonStates: 68, 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.9s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 326 NumberOfCodeBlocks, 326 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 2556 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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 proved your program to be incorrect!
[2024-11-07 11:12:28,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE