./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix000.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/mix000.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', '62286332e049ab35f6bf4022df54bae198ba0ceaf820c98713e2f1f442f473b5']
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/mix000.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 62286332e049ab35f6bf4022df54bae198ba0ceaf820c98713e2f1f442f473b5
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 11:09:44,603 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 11:09:44,691 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:09:44,697 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 11:09:44,697 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 11:09:44,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 11:09:44,720 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 11:09:44,720 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 11:09:44,721 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 11:09:44,721 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 11:09:44,721 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 11:09:44,721 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 11:09:44,722 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 11:09:44,722 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 11:09:44,722 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 11:09:44,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 11:09:44,722 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 11:09:44,723 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 11:09:44,723 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 11:09:44,723 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 11:09:44,723 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 11:09:44,723 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 11:09:44,723 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 11:09:44,723 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 11:09:44,723 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 11:09:44,723 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 11:09:44,723 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 11:09:44,723 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 11:09:44,723 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 11:09:44,723 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 11:09:44,723 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 11:09:44,723 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 11:09:44,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 11:09:44,723 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 11:09:44,724 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 11:09:44,724 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 11:09:44,724 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 11:09:44,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 11:09:44,724 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 11:09:44,724 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 11:09:44,724 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 11:09:44,724 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 11:09:44,724 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 -> 62286332e049ab35f6bf4022df54bae198ba0ceaf820c98713e2f1f442f473b5
[2024-11-07 11:09:44,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 11:09:44,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 11:09:44,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 11:09:44,953 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 11:09:44,953 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 11:09:44,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix000.oepc.i
[2024-11-07 11:09:46,062 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 11:09:46,275 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 11:09:46,276 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix000.oepc.i
[2024-11-07 11:09:46,286 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3acdf1304/b3ce6ffc036b47ce84a2f521f28d2af1/FLAG96e394e53
[2024-11-07 11:09:46,630 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3acdf1304/b3ce6ffc036b47ce84a2f521f28d2af1
[2024-11-07 11:09:46,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 11:09:46,633 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 11:09:46,634 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 11:09:46,634 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 11:09:46,638 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 11:09:46,638 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:09:46" (1/1) ...
[2024-11-07 11:09:46,639 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a805584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:09:46, skipping insertion in model container
[2024-11-07 11:09:46,639 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:09:46" (1/1) ...
[2024-11-07 11:09:46,674 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 11:09:46,811 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/mix000.oepc.i[988,1001]
[2024-11-07 11:09:47,005 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 11:09:47,019 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 11:09:47,029 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/mix000.oepc.i[988,1001]
[2024-11-07 11:09:47,085 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 11:09:47,120 INFO L204 MainTranslator]: Completed translation
[2024-11-07 11:09:47,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:09:47 WrapperNode
[2024-11-07 11:09:47,122 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 11:09:47,123 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 11:09:47,123 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 11:09:47,123 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 11:09:47,127 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:09:47" (1/1) ...
[2024-11-07 11:09:47,141 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:09:47" (1/1) ...
[2024-11-07 11:09:47,169 INFO L138 Inliner]: procedures = 174, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128
[2024-11-07 11:09:47,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 11:09:47,174 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 11:09:47,174 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 11:09:47,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 11:09:47,180 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:09:47" (1/1) ...
[2024-11-07 11:09:47,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:09:47" (1/1) ...
[2024-11-07 11:09:47,182 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:09:47" (1/1) ...
[2024-11-07 11:09:47,198 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:09:47,199 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:09:47" (1/1) ...
[2024-11-07 11:09:47,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:09:47" (1/1) ...
[2024-11-07 11:09:47,207 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:09:47" (1/1) ...
[2024-11-07 11:09:47,209 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:09:47" (1/1) ...
[2024-11-07 11:09:47,210 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:09:47" (1/1) ...
[2024-11-07 11:09:47,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:09:47" (1/1) ...
[2024-11-07 11:09:47,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 11:09:47,220 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 11:09:47,220 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 11:09:47,220 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 11:09:47,220 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:09:47" (1/1) ...
[2024-11-07 11:09:47,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 11:09:47,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 11:09:47,245 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:09:47,247 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:09:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-07 11:09:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 11:09:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-11-07 11:09:47,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-11-07 11:09:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-11-07 11:09:47,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-11-07 11:09:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 11:09:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-07 11:09:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 11:09:47,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 11:09:47,264 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:09:47,353 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 11:09:47,354 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 11:09:47,623 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-07 11:09:47,623 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 11:09:47,752 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 11:09:47,752 INFO L316 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-07 11:09:47,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:09:47 BoogieIcfgContainer
[2024-11-07 11:09:47,753 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 11:09:47,754 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 11:09:47,754 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 11:09:47,757 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 11:09:47,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 11:09:46" (1/3) ...
[2024-11-07 11:09:47,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f4930a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:09:47, skipping insertion in model container
[2024-11-07 11:09:47,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:09:47" (2/3) ...
[2024-11-07 11:09:47,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f4930a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:09:47, skipping insertion in model container
[2024-11-07 11:09:47,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:09:47" (3/3) ...
[2024-11-07 11:09:47,759 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000.oepc.i
[2024-11-07 11:09:47,772 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 11:09:47,773 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2024-11-07 11:09:47,773 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-07 11:09:47,818 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-07 11:09:47,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 32 transitions, 72 flow
[2024-11-07 11:09:47,904 INFO L124 PetriNetUnfolderBase]: 1/30 cut-off events.
[2024-11-07 11:09:47,907 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-07 11:09:47,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 1/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place.
[2024-11-07 11:09:47,910 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 32 transitions, 72 flow
[2024-11-07 11:09:47,912 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 30 transitions, 66 flow
[2024-11-07 11:09:47,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 11:09:47,925 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;@9435e5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 11:09:47,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2024-11-07 11:09:47,929 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-07 11:09:47,929 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-11-07 11:09:47,929 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-07 11:09:47,929 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:09:47,929 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-11-07 11:09:47,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-07 11:09:47,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:09:47,933 INFO L85 PathProgramCache]: Analyzing trace with hash 11039958, now seen corresponding path program 1 times
[2024-11-07 11:09:47,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:09:47,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714585625]
[2024-11-07 11:09:47,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:09:47,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:09:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:09:48,298 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:09:48,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:09:48,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714585625]
[2024-11-07 11:09:48,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714585625] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:09:48,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:09:48,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-07 11:09:48,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143004710]
[2024-11-07 11:09:48,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:09:48,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 11:09:48,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:09:48,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 11:09:48,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 11:09:48,325 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32
[2024-11-07 11:09:48,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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:09:48,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:09:48,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32
[2024-11-07 11:09:48,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:09:48,512 INFO L124 PetriNetUnfolderBase]: 175/370 cut-off events.
[2024-11-07 11:09:48,512 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-11-07 11:09:48,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 370 events. 175/370 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1810 event pairs, 69 based on Foata normal form. 19/381 useless extension candidates. Maximal degree in co-relation 682. Up to 265 conditions per place.
[2024-11-07 11:09:48,520 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 22 selfloop transitions, 2 changer transitions 2/38 dead transitions.
[2024-11-07 11:09:48,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 38 transitions, 137 flow
[2024-11-07 11:09:48,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 11:09:48,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-07 11:09:48,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions.
[2024-11-07 11:09:48,532 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7395833333333334
[2024-11-07 11:09:48,533 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 66 flow. Second operand 3 states and 71 transitions.
[2024-11-07 11:09:48,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 38 transitions, 137 flow
[2024-11-07 11:09:48,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 38 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-07 11:09:48,540 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 62 flow
[2024-11-07 11:09:48,542 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=35, PETRI_TRANSITIONS=27}
[2024-11-07 11:09:48,544 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places.
[2024-11-07 11:09:48,544 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 62 flow
[2024-11-07 11:09:48,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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:09:48,545 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:09:48,545 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:09:48,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 11:09:48,545 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-07 11:09:48,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:09:48,545 INFO L85 PathProgramCache]: Analyzing trace with hash -590690332, now seen corresponding path program 1 times
[2024-11-07 11:09:48,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:09:48,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654108904]
[2024-11-07 11:09:48,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:09:48,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:09:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:09:48,796 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:09:48,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:09:48,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654108904]
[2024-11-07 11:09:48,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654108904] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:09:48,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:09:48,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 11:09:48,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957641733]
[2024-11-07 11:09:48,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:09:48,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 11:09:48,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:09:48,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 11:09:48,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 11:09:48,815 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32
[2024-11-07 11:09:48,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:09:48,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:09:48,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32
[2024-11-07 11:09:48,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:09:49,110 INFO L124 PetriNetUnfolderBase]: 476/886 cut-off events.
[2024-11-07 11:09:49,111 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES.
[2024-11-07 11:09:49,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1768 conditions, 886 events. 476/886 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4793 event pairs, 176 based on Foata normal form. 0/854 useless extension candidates. Maximal degree in co-relation 1758. Up to 512 conditions per place.
[2024-11-07 11:09:49,116 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 24 selfloop transitions, 3 changer transitions 39/73 dead transitions.
[2024-11-07 11:09:49,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 73 transitions, 300 flow
[2024-11-07 11:09:49,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-07 11:09:49,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-07 11:09:49,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions.
[2024-11-07 11:09:49,120 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.546875
[2024-11-07 11:09:49,120 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 62 flow. Second operand 8 states and 140 transitions.
[2024-11-07 11:09:49,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 73 transitions, 300 flow
[2024-11-07 11:09:49,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 73 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-07 11:09:49,122 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 91 flow
[2024-11-07 11:09:49,124 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=91, PETRI_PLACES=44, PETRI_TRANSITIONS=28}
[2024-11-07 11:09:49,124 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places.
[2024-11-07 11:09:49,125 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 91 flow
[2024-11-07 11:09:49,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:09:49,125 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:09:49,125 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:09:49,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-07 11:09:49,126 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-07 11:09:49,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:09:49,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1235395699, now seen corresponding path program 1 times
[2024-11-07 11:09:49,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:09:49,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233665111]
[2024-11-07 11:09:49,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:09:49,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:09:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:09:49,387 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:09:49,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:09:49,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233665111]
[2024-11-07 11:09:49,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233665111] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:09:49,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:09:49,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 11:09:49,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988488282]
[2024-11-07 11:09:49,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:09:49,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 11:09:49,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:09:49,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 11:09:49,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-07 11:09:49,406 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32
[2024-11-07 11:09:49,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 91 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:09:49,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:09:49,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32
[2024-11-07 11:09:49,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:09:49,590 INFO L124 PetriNetUnfolderBase]: 337/646 cut-off events.
[2024-11-07 11:09:49,591 INFO L125 PetriNetUnfolderBase]: For 383/386 co-relation queries the response was YES.
[2024-11-07 11:09:49,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1599 conditions, 646 events. 337/646 cut-off events. For 383/386 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3154 event pairs, 79 based on Foata normal form. 20/661 useless extension candidates. Maximal degree in co-relation 1584. Up to 435 conditions per place.
[2024-11-07 11:09:49,594 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 25 selfloop transitions, 3 changer transitions 23/58 dead transitions.
[2024-11-07 11:09:49,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 58 transitions, 275 flow
[2024-11-07 11:09:49,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 11:09:49,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-07 11:09:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions.
[2024-11-07 11:09:49,595 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5133928571428571
[2024-11-07 11:09:49,595 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 91 flow. Second operand 7 states and 115 transitions.
[2024-11-07 11:09:49,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 58 transitions, 275 flow
[2024-11-07 11:09:49,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 58 transitions, 258 flow, removed 7 selfloop flow, removed 3 redundant places.
[2024-11-07 11:09:49,597 INFO L231 Difference]: Finished difference. Result has 46 places, 28 transitions, 101 flow
[2024-11-07 11:09:49,598 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=101, PETRI_PLACES=46, PETRI_TRANSITIONS=28}
[2024-11-07 11:09:49,598 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places.
[2024-11-07 11:09:49,598 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 28 transitions, 101 flow
[2024-11-07 11:09:49,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:09:49,598 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:09:49,598 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:09:49,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-07 11:09:49,599 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-07 11:09:49,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:09:49,599 INFO L85 PathProgramCache]: Analyzing trace with hash 615484443, now seen corresponding path program 1 times
[2024-11-07 11:09:49,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:09:49,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231466463]
[2024-11-07 11:09:49,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:09:49,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:09:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:09:49,736 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:09:49,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:09:49,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231466463]
[2024-11-07 11:09:49,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231466463] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:09:49,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:09:49,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 11:09:49,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640106193]
[2024-11-07 11:09:49,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:09:49,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 11:09:49,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:09:49,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 11:09:49,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-07 11:09:49,747 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32
[2024-11-07 11:09:49,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 28 transitions, 101 flow. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:09:49,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:09:49,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32
[2024-11-07 11:09:49,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:09:49,983 INFO L124 PetriNetUnfolderBase]: 309/602 cut-off events.
[2024-11-07 11:09:49,983 INFO L125 PetriNetUnfolderBase]: For 603/606 co-relation queries the response was YES.
[2024-11-07 11:09:49,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1549 conditions, 602 events. 309/602 cut-off events. For 603/606 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2849 event pairs, 165 based on Foata normal form. 26/625 useless extension candidates. Maximal degree in co-relation 1530. Up to 341 conditions per place.
[2024-11-07 11:09:49,986 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 26 selfloop transitions, 3 changer transitions 25/61 dead transitions.
[2024-11-07 11:09:49,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 61 transitions, 305 flow
[2024-11-07 11:09:49,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 11:09:49,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-07 11:09:49,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions.
[2024-11-07 11:09:49,988 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5267857142857143
[2024-11-07 11:09:49,988 INFO L175 Difference]: Start difference. First operand has 46 places, 28 transitions, 101 flow. Second operand 7 states and 118 transitions.
[2024-11-07 11:09:49,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 61 transitions, 305 flow
[2024-11-07 11:09:49,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 61 transitions, 275 flow, removed 12 selfloop flow, removed 6 redundant places.
[2024-11-07 11:09:49,991 INFO L231 Difference]: Finished difference. Result has 47 places, 28 transitions, 102 flow
[2024-11-07 11:09:49,991 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=102, PETRI_PLACES=47, PETRI_TRANSITIONS=28}
[2024-11-07 11:09:49,991 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places.
[2024-11-07 11:09:49,991 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 28 transitions, 102 flow
[2024-11-07 11:09:49,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:09:49,991 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:09:49,991 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:09:49,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-07 11:09:49,992 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-07 11:09:49,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:09:49,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1627636110, now seen corresponding path program 1 times
[2024-11-07 11:09:49,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:09:49,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196452635]
[2024-11-07 11:09:49,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:09:49,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:09:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:09:50,198 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:09:50,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:09:50,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196452635]
[2024-11-07 11:09:50,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196452635] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:09:50,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:09:50,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 11:09:50,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532027985]
[2024-11-07 11:09:50,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:09:50,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 11:09:50,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:09:50,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 11:09:50,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 11:09:50,203 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32
[2024-11-07 11:09:50,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 28 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:09:50,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:09:50,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32
[2024-11-07 11:09:50,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:09:50,315 INFO L124 PetriNetUnfolderBase]: 210/441 cut-off events.
[2024-11-07 11:09:50,315 INFO L125 PetriNetUnfolderBase]: For 309/311 co-relation queries the response was YES.
[2024-11-07 11:09:50,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1087 conditions, 441 events. 210/441 cut-off events. For 309/311 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1970 event pairs, 46 based on Foata normal form. 34/464 useless extension candidates. Maximal degree in co-relation 1067. Up to 163 conditions per place.
[2024-11-07 11:09:50,317 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 34 selfloop transitions, 4 changer transitions 1/48 dead transitions.
[2024-11-07 11:09:50,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 236 flow
[2024-11-07 11:09:50,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 11:09:50,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-07 11:09:50,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions.
[2024-11-07 11:09:50,318 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.65625
[2024-11-07 11:09:50,318 INFO L175 Difference]: Start difference. First operand has 47 places, 28 transitions, 102 flow. Second operand 4 states and 84 transitions.
[2024-11-07 11:09:50,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 236 flow
[2024-11-07 11:09:50,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 48 transitions, 208 flow, removed 9 selfloop flow, removed 8 redundant places.
[2024-11-07 11:09:50,322 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 108 flow
[2024-11-07 11:09:50,322 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=40, PETRI_TRANSITIONS=30}
[2024-11-07 11:09:50,322 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places.
[2024-11-07 11:09:50,323 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 108 flow
[2024-11-07 11:09:50,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:09:50,323 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:09:50,323 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:09:50,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-07 11:09:50,323 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-07 11:09:50,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:09:50,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1343591525, now seen corresponding path program 1 times
[2024-11-07 11:09:50,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:09:50,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951375448]
[2024-11-07 11:09:50,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:09:50,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:09:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:09:50,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 11:09:50,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:09:50,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951375448]
[2024-11-07 11:09:50,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951375448] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:09:50,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:09:50,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 11:09:50,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57837613]
[2024-11-07 11:09:50,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:09:50,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 11:09:50,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:09:50,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 11:09:50,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-07 11:09:50,542 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32
[2024-11-07 11:09:50,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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:09:50,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:09:50,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32
[2024-11-07 11:09:50,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:09:50,636 INFO L124 PetriNetUnfolderBase]: 118/250 cut-off events.
[2024-11-07 11:09:50,636 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES.
[2024-11-07 11:09:50,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 639 conditions, 250 events. 118/250 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 848 event pairs, 32 based on Foata normal form. 18/262 useless extension candidates. Maximal degree in co-relation 623. Up to 101 conditions per place.
[2024-11-07 11:09:50,639 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 28 selfloop transitions, 6 changer transitions 1/44 dead transitions.
[2024-11-07 11:09:50,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 44 transitions, 214 flow
[2024-11-07 11:09:50,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 11:09:50,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-07 11:09:50,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions.
[2024-11-07 11:09:50,640 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.56875
[2024-11-07 11:09:50,641 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 108 flow. Second operand 5 states and 91 transitions.
[2024-11-07 11:09:50,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 44 transitions, 214 flow
[2024-11-07 11:09:50,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 192 flow, removed 4 selfloop flow, removed 4 redundant places.
[2024-11-07 11:09:50,642 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 112 flow
[2024-11-07 11:09:50,643 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=42, PETRI_TRANSITIONS=30}
[2024-11-07 11:09:50,643 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places.
[2024-11-07 11:09:50,644 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 112 flow
[2024-11-07 11:09:50,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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:09:50,644 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:09:50,644 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:09:50,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-07 11:09:50,644 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-07 11:09:50,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:09:50,645 INFO L85 PathProgramCache]: Analyzing trace with hash -57252969, now seen corresponding path program 1 times
[2024-11-07 11:09:50,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:09:50,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648260883]
[2024-11-07 11:09:50,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:09:50,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:09:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:09:50,919 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:09:50,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:09:50,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648260883]
[2024-11-07 11:09:50,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648260883] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:09:50,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:09:50,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-07 11:09:50,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373488661]
[2024-11-07 11:09:50,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:09:50,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 11:09:50,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:09:50,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 11:09:50,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-07 11:09:50,935 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32
[2024-11-07 11:09:50,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 112 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:09:50,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:09:50,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32
[2024-11-07 11:09:50,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:09:51,088 INFO L124 PetriNetUnfolderBase]: 147/332 cut-off events.
[2024-11-07 11:09:51,088 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES.
[2024-11-07 11:09:51,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 332 events. 147/332 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1322 event pairs, 35 based on Foata normal form. 4/329 useless extension candidates. Maximal degree in co-relation 770. Up to 149 conditions per place.
[2024-11-07 11:09:51,090 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 21 selfloop transitions, 1 changer transitions 19/50 dead transitions.
[2024-11-07 11:09:51,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 240 flow
[2024-11-07 11:09:51,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 11:09:51,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-07 11:09:51,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions.
[2024-11-07 11:09:51,091 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4895833333333333
[2024-11-07 11:09:51,091 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 112 flow. Second operand 6 states and 94 transitions.
[2024-11-07 11:09:51,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 240 flow
[2024-11-07 11:09:51,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 206 flow, removed 8 selfloop flow, removed 6 redundant places.
[2024-11-07 11:09:51,093 INFO L231 Difference]: Finished difference. Result has 45 places, 28 transitions, 87 flow
[2024-11-07 11:09:51,093 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=87, PETRI_PLACES=45, PETRI_TRANSITIONS=28}
[2024-11-07 11:09:51,093 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places.
[2024-11-07 11:09:51,093 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 87 flow
[2024-11-07 11:09:51,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:09:51,094 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:09:51,094 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:09:51,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-07 11:09:51,094 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-07 11:09:51,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:09:51,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1194201471, now seen corresponding path program 2 times
[2024-11-07 11:09:51,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:09:51,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721487918]
[2024-11-07 11:09:51,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:09:51,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:09:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:09:52,450 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:09:52,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:09:52,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721487918]
[2024-11-07 11:09:52,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721487918] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:09:52,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:09:52,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-07 11:09:52,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498923440]
[2024-11-07 11:09:52,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:09:52,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-07 11:09:52,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:09:52,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-07 11:09:52,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2024-11-07 11:09:52,457 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32
[2024-11-07 11:09:52,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 28 transitions, 87 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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:09:52,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:09:52,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32
[2024-11-07 11:09:52,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:09:52,703 INFO L124 PetriNetUnfolderBase]: 88/225 cut-off events.
[2024-11-07 11:09:52,703 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES.
[2024-11-07 11:09:52,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 225 events. 88/225 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 794 event pairs, 32 based on Foata normal form. 4/222 useless extension candidates. Maximal degree in co-relation 471. Up to 88 conditions per place.
[2024-11-07 11:09:52,704 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 20 selfloop transitions, 4 changer transitions 20/55 dead transitions.
[2024-11-07 11:09:52,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 55 transitions, 239 flow
[2024-11-07 11:09:52,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-07 11:09:52,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-11-07 11:09:52,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions.
[2024-11-07 11:09:52,705 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.484375
[2024-11-07 11:09:52,705 INFO L175 Difference]: Start difference. First operand has 45 places, 28 transitions, 87 flow. Second operand 10 states and 155 transitions.
[2024-11-07 11:09:52,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 55 transitions, 239 flow
[2024-11-07 11:09:52,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 55 transitions, 226 flow, removed 5 selfloop flow, removed 5 redundant places.
[2024-11-07 11:09:52,706 INFO L231 Difference]: Finished difference. Result has 51 places, 28 transitions, 98 flow
[2024-11-07 11:09:52,706 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=98, PETRI_PLACES=51, PETRI_TRANSITIONS=28}
[2024-11-07 11:09:52,706 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places.
[2024-11-07 11:09:52,706 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 28 transitions, 98 flow
[2024-11-07 11:09:52,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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:09:52,707 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:09:52,707 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:09:52,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-07 11:09:52,707 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-07 11:09:52,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:09:52,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1312433819, now seen corresponding path program 3 times
[2024-11-07 11:09:52,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:09:52,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558841460]
[2024-11-07 11:09:52,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:09:52,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:09:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 11:09:52,764 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 11:09:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 11:09:52,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 11:09:52,844 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-07 11:09:52,845 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining)
[2024-11-07 11:09:52,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining)
[2024-11-07 11:09:52,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining)
[2024-11-07 11:09:52,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining)
[2024-11-07 11:09:52,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining)
[2024-11-07 11:09:52,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-07 11:09:52,848 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:09:52,896 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-07 11:09:52,896 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 11:09:52,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 11:09:52 BasicIcfg
[2024-11-07 11:09:52,902 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 11:09:52,903 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 11:09:52,903 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 11:09:52,903 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 11:09:52,904 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:09:47" (3/4) ...
[2024-11-07 11:09:52,904 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample
[2024-11-07 11:09:52,963 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-07 11:09:52,963 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 11:09:52,964 INFO L158 Benchmark]: Toolchain (without parser) took 6330.93ms. Allocated memory was 117.4MB in the beginning and 318.8MB in the end (delta: 201.3MB). Free memory was 89.6MB in the beginning and 109.6MB in the end (delta: -20.1MB). Peak memory consumption was 178.1MB. Max. memory is 16.1GB.
[2024-11-07 11:09:52,964 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 11:09:52,964 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.70ms. Allocated memory is still 117.4MB. Free memory was 89.6MB in the beginning and 65.5MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-07 11:09:52,964 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.73ms. Allocated memory is still 117.4MB. Free memory was 65.5MB in the beginning and 63.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 11:09:52,965 INFO L158 Benchmark]: Boogie Preprocessor took 45.44ms. Allocated memory is still 117.4MB. Free memory was 63.2MB in the beginning and 59.8MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 11:09:52,965 INFO L158 Benchmark]: RCFGBuilder took 532.91ms. Allocated memory is still 117.4MB. Free memory was 59.8MB in the beginning and 52.9MB in the end (delta: 6.8MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB.
[2024-11-07 11:09:52,965 INFO L158 Benchmark]: TraceAbstraction took 5148.65ms. Allocated memory was 117.4MB in the beginning and 318.8MB in the end (delta: 201.3MB). Free memory was 52.4MB in the beginning and 118.0MB in the end (delta: -65.6MB). Peak memory consumption was 131.2MB. Max. memory is 16.1GB.
[2024-11-07 11:09:52,968 INFO L158 Benchmark]: Witness Printer took 60.50ms. Allocated memory is still 318.8MB. Free memory was 118.0MB in the beginning and 109.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 11:09:52,984 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.19ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 487.70ms. Allocated memory is still 117.4MB. Free memory was 89.6MB in the beginning and 65.5MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 50.73ms. Allocated memory is still 117.4MB. Free memory was 65.5MB in the beginning and 63.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 45.44ms. Allocated memory is still 117.4MB. Free memory was 63.2MB in the beginning and 59.8MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* RCFGBuilder took 532.91ms. Allocated memory is still 117.4MB. Free memory was 59.8MB in the beginning and 52.9MB in the end (delta: 6.8MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB.
* TraceAbstraction took 5148.65ms. Allocated memory was 117.4MB in the beginning and 318.8MB in the end (delta: 201.3MB). Free memory was 52.4MB in the beginning and 118.0MB in the end (delta: -65.6MB). Peak memory consumption was 131.2MB. Max. memory is 16.1GB.
* Witness Printer took 60.50ms. Allocated memory is still 318.8MB. Free memory was 118.0MB in the beginning and 109.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- CounterExampleResult [Line: 19]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
[L711] 0 int __unbuffered_p0_EAX = 0;
[L713] 0 int __unbuffered_p0_EBX = 0;
[L715] 0 int __unbuffered_p1_EAX = 0;
[L717] 0 int __unbuffered_p1_EBX = 0;
[L718] 0 _Bool main$tmp_guard0;
[L719] 0 _Bool main$tmp_guard1;
[L721] 0 int x = 0;
[L723] 0 int y = 0;
[L724] 0 _Bool y$flush_delayed;
[L725] 0 int y$mem_tmp;
[L726] 0 _Bool y$r_buff0_thd0;
[L727] 0 _Bool y$r_buff0_thd1;
[L728] 0 _Bool y$r_buff0_thd2;
[L729] 0 _Bool y$r_buff1_thd0;
[L730] 0 _Bool y$r_buff1_thd1;
[L731] 0 _Bool y$r_buff1_thd2;
[L732] 0 _Bool y$read_delayed;
[L733] 0 int *y$read_delayed_var;
[L734] 0 int y$w_buff0;
[L735] 0 _Bool y$w_buff0_used;
[L736] 0 int y$w_buff1;
[L737] 0 _Bool y$w_buff1_used;
[L738] 0 _Bool weak$$choice0;
[L739] 0 _Bool weak$$choice2;
[L831] 0 pthread_t t0;
[L832] FCALL, FORK 0 pthread_create(&t0, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t0=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L833] 0 pthread_t t1;
[L834] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t0=-1, t1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L743] 1 y$w_buff1 = y$w_buff0
[L744] 1 y$w_buff0 = 1
[L745] 1 y$w_buff1_used = y$w_buff0_used
[L746] 1 y$w_buff0_used = (_Bool)1
[L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L19] COND FALSE 1 !(!expression)
[L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0
[L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1
[L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2
[L751] 1 y$r_buff0_thd1 = (_Bool)1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L754] 1 weak$$choice0 = __VERIFIER_nondet_bool()
[L755] 1 weak$$choice2 = __VERIFIER_nondet_bool()
[L756] 1 y$flush_delayed = weak$$choice2
[L757] 1 y$mem_tmp = y
[L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L765] 1 __unbuffered_p0_EAX = y
[L766] 1 y = y$flush_delayed ? y$mem_tmp : y
[L767] 1 y$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L770] 1 __unbuffered_p0_EBX = x
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L787] 2 x = 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L790] 2 __unbuffered_p1_EAX = x
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L793] 2 weak$$choice0 = __VERIFIER_nondet_bool()
[L794] 2 weak$$choice2 = __VERIFIER_nondet_bool()
[L795] 2 y$flush_delayed = weak$$choice2
[L796] 2 y$mem_tmp = y
[L797] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)
[L798] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))
[L799] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))
[L800] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))
[L801] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L802] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))
[L803] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L804] 2 __unbuffered_p1_EBX = y
[L805] 2 y = y$flush_delayed ? y$mem_tmp : y
[L806] 2 y$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L809] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L810] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L811] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L812] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L813] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L773] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L774] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L775] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L776] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L777] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L780] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L836] 0 main$tmp_guard0 = __unbuffered_cnt == 2
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0=-1, t1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L838] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L4] COND FALSE 0 !(!cond)
[L838] RET 0 assume_abort_if_not(main$tmp_guard0)
[L840] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L841] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L842] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L843] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L844] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0=-1, t1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L847] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0)
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0=-1, t1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L849] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L19] COND TRUE 0 !expression
VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L19] 0 reach_error()
VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1]
- UnprovableResult [Line: 19]: 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: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 5 procedures, 51 locations, 5 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: 5.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 278 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 251 mSDsluCounter, 120 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 95 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 808 IncrementalHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 25 mSDtfsCounter, 808 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=6, InterpolantAutomatonStates: 50, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 157 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 125 ConstructedInterpolants, 0 QuantifiedInterpolants, 899 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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:09:53,011 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