./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix010.opt.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/mix010.opt.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', '371e0ad4620d67bc913500e97f289ec14c56f7c02bd7df3fa28779e14d33459a']
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/mix010.opt.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 371e0ad4620d67bc913500e97f289ec14c56f7c02bd7df3fa28779e14d33459a
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 11:10:19,120 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 11:10:19,184 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:10:19,189 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 11:10:19,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 11:10:19,229 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 11:10:19,233 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 11:10:19,234 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 11:10:19,234 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 11:10:19,234 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 11:10:19,234 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 11:10:19,235 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 11:10:19,235 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 11:10:19,235 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 11:10:19,235 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 11:10:19,237 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 11:10:19,237 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 11:10:19,237 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 11:10:19,237 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 11:10:19,237 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 11:10:19,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 11:10:19,237 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 11:10:19,237 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 11:10:19,237 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 11:10:19,237 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 11:10:19,237 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 11:10:19,237 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 11:10:19,238 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 11:10:19,238 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 11:10:19,238 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 11:10:19,238 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 11:10:19,238 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 11:10:19,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 11:10:19,239 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 11:10:19,239 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 11:10:19,239 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 11:10:19,239 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 11:10:19,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 11:10:19,239 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 11:10:19,239 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 11:10:19,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 11:10:19,240 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 11:10:19,240 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 -> 371e0ad4620d67bc913500e97f289ec14c56f7c02bd7df3fa28779e14d33459a
[2024-11-07 11:10:19,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 11:10:19,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 11:10:19,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 11:10:19,630 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 11:10:19,630 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 11:10:19,631 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix010.opt.i
[2024-11-07 11:10:20,868 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 11:10:21,171 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 11:10:21,172 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix010.opt.i
[2024-11-07 11:10:21,192 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c6fcb0ca/b2c078e4990642f78da2cc9070e8d046/FLAGa9e1930b6
[2024-11-07 11:10:21,463 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c6fcb0ca/b2c078e4990642f78da2cc9070e8d046
[2024-11-07 11:10:21,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 11:10:21,467 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 11:10:21,469 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 11:10:21,469 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 11:10:21,473 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 11:10:21,473 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:10:21" (1/1) ...
[2024-11-07 11:10:21,474 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5522e8ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:10:21, skipping insertion in model container
[2024-11-07 11:10:21,474 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:10:21" (1/1) ...
[2024-11-07 11:10:21,511 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 11:10:21,619 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/mix010.opt.i[944,957]
[2024-11-07 11:10:21,715 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 11:10:21,723 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 11:10:21,731 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/mix010.opt.i[944,957]
[2024-11-07 11:10:21,768 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 11:10:21,793 INFO L204 MainTranslator]: Completed translation
[2024-11-07 11:10:21,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:10:21 WrapperNode
[2024-11-07 11:10:21,793 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 11:10:21,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 11:10:21,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 11:10:21,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 11:10:21,799 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:10:21" (1/1) ...
[2024-11-07 11:10:21,809 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:10:21" (1/1) ...
[2024-11-07 11:10:21,826 INFO L138 Inliner]: procedures = 175, calls = 48, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141
[2024-11-07 11:10:21,826 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 11:10:21,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 11:10:21,827 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 11:10:21,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 11:10:21,833 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:10:21" (1/1) ...
[2024-11-07 11:10:21,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:10:21" (1/1) ...
[2024-11-07 11:10:21,836 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:10:21" (1/1) ...
[2024-11-07 11:10:21,847 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:10:21,847 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:10:21" (1/1) ...
[2024-11-07 11:10:21,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:10:21" (1/1) ...
[2024-11-07 11:10:21,870 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:10:21" (1/1) ...
[2024-11-07 11:10:21,871 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:10:21" (1/1) ...
[2024-11-07 11:10:21,872 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:10:21" (1/1) ...
[2024-11-07 11:10:21,873 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:10:21" (1/1) ...
[2024-11-07 11:10:21,882 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 11:10:21,882 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 11:10:21,882 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 11:10:21,883 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 11:10:21,889 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:10:21" (1/1) ...
[2024-11-07 11:10:21,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 11:10:21,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 11:10:21,921 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:10:21,923 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:10:21,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-07 11:10:21,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 11:10:21,945 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-11-07 11:10:21,945 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-11-07 11:10:21,945 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-11-07 11:10:21,945 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-11-07 11:10:21,945 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2024-11-07 11:10:21,945 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2024-11-07 11:10:21,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 11:10:21,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-07 11:10:21,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 11:10:21,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 11:10:21,946 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:10:22,056 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 11:10:22,058 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 11:10:22,353 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-07 11:10:22,353 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 11:10:22,576 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 11:10:22,576 INFO L316 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-07 11:10:22,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:10:22 BoogieIcfgContainer
[2024-11-07 11:10:22,581 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 11:10:22,583 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 11:10:22,583 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 11:10:22,590 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 11:10:22,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 11:10:21" (1/3) ...
[2024-11-07 11:10:22,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da5e70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:10:22, skipping insertion in model container
[2024-11-07 11:10:22,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:10:21" (2/3) ...
[2024-11-07 11:10:22,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da5e70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:10:22, skipping insertion in model container
[2024-11-07 11:10:22,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:10:22" (3/3) ...
[2024-11-07 11:10:22,595 INFO L112 eAbstractionObserver]: Analyzing ICFG mix010.opt.i
[2024-11-07 11:10:22,617 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 11:10:22,618 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2024-11-07 11:10:22,618 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-07 11:10:22,672 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-07 11:10:22,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 42 transitions, 96 flow
[2024-11-07 11:10:22,716 INFO L124 PetriNetUnfolderBase]: 1/39 cut-off events.
[2024-11-07 11:10:22,718 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-07 11:10:22,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 1/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 74 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place.
[2024-11-07 11:10:22,720 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 42 transitions, 96 flow
[2024-11-07 11:10:22,722 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 39 transitions, 87 flow
[2024-11-07 11:10:22,727 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 11:10:22,735 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;@6b54e4b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 11:10:22,735 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-11-07 11:10:22,740 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-07 11:10:22,740 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events.
[2024-11-07 11:10:22,740 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-07 11:10:22,740 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:10:22,741 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:10:22,741 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-07 11:10:22,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:10:22,745 INFO L85 PathProgramCache]: Analyzing trace with hash 440388486, now seen corresponding path program 1 times
[2024-11-07 11:10:22,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:10:22,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95391144]
[2024-11-07 11:10:22,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:10:22,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:10:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:10:23,118 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:10:23,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:10:23,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95391144]
[2024-11-07 11:10:23,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95391144] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:10:23,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:10:23,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-07 11:10:23,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71950071]
[2024-11-07 11:10:23,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:10:23,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 11:10:23,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:10:23,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 11:10:23,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 11:10:23,149 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 42
[2024-11-07 11:10:23,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:10:23,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:10:23,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 42
[2024-11-07 11:10:23,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:10:23,449 INFO L124 PetriNetUnfolderBase]: 341/663 cut-off events.
[2024-11-07 11:10:23,450 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-07 11:10:23,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1224 conditions, 663 events. 341/663 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4292 event pairs, 53 based on Foata normal form. 30/672 useless extension candidates. Maximal degree in co-relation 1213. Up to 433 conditions per place.
[2024-11-07 11:10:23,458 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 22 selfloop transitions, 2 changer transitions 2/45 dead transitions.
[2024-11-07 11:10:23,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 45 transitions, 151 flow
[2024-11-07 11:10:23,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 11:10:23,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-07 11:10:23,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions.
[2024-11-07 11:10:23,472 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.753968253968254
[2024-11-07 11:10:23,473 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 87 flow. Second operand 3 states and 95 transitions.
[2024-11-07 11:10:23,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 45 transitions, 151 flow
[2024-11-07 11:10:23,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 148 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-11-07 11:10:23,481 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow
[2024-11-07 11:10:23,484 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36}
[2024-11-07 11:10:23,487 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places.
[2024-11-07 11:10:23,488 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow
[2024-11-07 11:10:23,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:10:23,489 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:10:23,489 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:10:23,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 11:10:23,490 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-07 11:10:23,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:10:23,491 INFO L85 PathProgramCache]: Analyzing trace with hash 448778017, now seen corresponding path program 1 times
[2024-11-07 11:10:23,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:10:23,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805570132]
[2024-11-07 11:10:23,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:10:23,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:10:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:10:23,699 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:10:23,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:10:23,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805570132]
[2024-11-07 11:10:23,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805570132] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:10:23,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:10:23,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 11:10:23,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224130154]
[2024-11-07 11:10:23,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:10:23,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 11:10:23,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:10:23,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 11:10:23,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 11:10:23,716 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42
[2024-11-07 11:10:23,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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:10:23,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:10:23,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42
[2024-11-07 11:10:23,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:10:24,117 INFO L124 PetriNetUnfolderBase]: 941/1717 cut-off events.
[2024-11-07 11:10:24,117 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES.
[2024-11-07 11:10:24,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3273 conditions, 1717 events. 941/1717 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 11143 event pairs, 107 based on Foata normal form. 72/1715 useless extension candidates. Maximal degree in co-relation 3263. Up to 809 conditions per place.
[2024-11-07 11:10:24,129 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 38 selfloop transitions, 5 changer transitions 1/59 dead transitions.
[2024-11-07 11:10:24,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 59 transitions, 224 flow
[2024-11-07 11:10:24,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 11:10:24,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-07 11:10:24,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions.
[2024-11-07 11:10:24,131 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7023809523809523
[2024-11-07 11:10:24,131 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 4 states and 118 transitions.
[2024-11-07 11:10:24,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 59 transitions, 224 flow
[2024-11-07 11:10:24,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 59 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-07 11:10:24,133 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 112 flow
[2024-11-07 11:10:24,133 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=48, PETRI_TRANSITIONS=39}
[2024-11-07 11:10:24,133 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places.
[2024-11-07 11:10:24,134 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 112 flow
[2024-11-07 11:10:24,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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:10:24,134 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:10:24,134 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:10:24,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-07 11:10:24,134 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-07 11:10:24,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:10:24,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1815927101, now seen corresponding path program 1 times
[2024-11-07 11:10:24,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:10:24,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118682051]
[2024-11-07 11:10:24,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:10:24,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:10:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:10:24,291 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:10:24,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:10:24,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118682051]
[2024-11-07 11:10:24,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118682051] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:10:24,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:10:24,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 11:10:24,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647252451]
[2024-11-07 11:10:24,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:10:24,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 11:10:24,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:10:24,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 11:10:24,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-07 11:10:24,306 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42
[2024-11-07 11:10:24,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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:10:24,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:10:24,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42
[2024-11-07 11:10:24,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:10:24,506 INFO L124 PetriNetUnfolderBase]: 665/1207 cut-off events.
[2024-11-07 11:10:24,506 INFO L125 PetriNetUnfolderBase]: For 342/342 co-relation queries the response was YES.
[2024-11-07 11:10:24,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2741 conditions, 1207 events. 665/1207 cut-off events. For 342/342 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6795 event pairs, 41 based on Foata normal form. 64/1226 useless extension candidates. Maximal degree in co-relation 2729. Up to 417 conditions per place.
[2024-11-07 11:10:24,512 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 48 selfloop transitions, 8 changer transitions 1/72 dead transitions.
[2024-11-07 11:10:24,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 72 transitions, 313 flow
[2024-11-07 11:10:24,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 11:10:24,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-07 11:10:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions.
[2024-11-07 11:10:24,514 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7095238095238096
[2024-11-07 11:10:24,514 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 112 flow. Second operand 5 states and 149 transitions.
[2024-11-07 11:10:24,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 72 transitions, 313 flow
[2024-11-07 11:10:24,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 72 transitions, 303 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-11-07 11:10:24,516 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 152 flow
[2024-11-07 11:10:24,516 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=52, PETRI_TRANSITIONS=42}
[2024-11-07 11:10:24,517 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places.
[2024-11-07 11:10:24,517 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 152 flow
[2024-11-07 11:10:24,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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:10:24,517 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:10:24,517 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:10:24,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-07 11:10:24,517 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-07 11:10:24,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:10:24,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1272944739, now seen corresponding path program 1 times
[2024-11-07 11:10:24,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:10:24,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127823361]
[2024-11-07 11:10:24,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:10:24,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:10:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:10:24,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 11:10:24,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:10:24,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127823361]
[2024-11-07 11:10:24,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127823361] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:10:24,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:10:24,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 11:10:24,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998438207]
[2024-11-07 11:10:24,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:10:24,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 11:10:24,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:10:24,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 11:10:24,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-07 11:10:24,865 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42
[2024-11-07 11:10:24,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:10:24,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:10:24,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42
[2024-11-07 11:10:24,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:10:25,264 INFO L124 PetriNetUnfolderBase]: 399/689 cut-off events.
[2024-11-07 11:10:25,264 INFO L125 PetriNetUnfolderBase]: For 644/644 co-relation queries the response was YES.
[2024-11-07 11:10:25,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1839 conditions, 689 events. 399/689 cut-off events. For 644/644 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3100 event pairs, 29 based on Foata normal form. 36/708 useless extension candidates. Maximal degree in co-relation 1825. Up to 268 conditions per place.
[2024-11-07 11:10:25,276 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 42 selfloop transitions, 11 changer transitions 1/69 dead transitions.
[2024-11-07 11:10:25,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 69 transitions, 324 flow
[2024-11-07 11:10:25,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 11:10:25,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-07 11:10:25,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 164 transitions.
[2024-11-07 11:10:25,278 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6507936507936508
[2024-11-07 11:10:25,278 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 152 flow. Second operand 6 states and 164 transitions.
[2024-11-07 11:10:25,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 69 transitions, 324 flow
[2024-11-07 11:10:25,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 69 transitions, 299 flow, removed 4 selfloop flow, removed 4 redundant places.
[2024-11-07 11:10:25,284 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 166 flow
[2024-11-07 11:10:25,284 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=166, PETRI_PLACES=55, PETRI_TRANSITIONS=42}
[2024-11-07 11:10:25,285 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places.
[2024-11-07 11:10:25,285 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 166 flow
[2024-11-07 11:10:25,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:10:25,285 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:10:25,285 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:10:25,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-07 11:10:25,286 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-07 11:10:25,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:10:25,286 INFO L85 PathProgramCache]: Analyzing trace with hash -904835028, now seen corresponding path program 1 times
[2024-11-07 11:10:25,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:10:25,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861973873]
[2024-11-07 11:10:25,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:10:25,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:10:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:10:25,624 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:10:25,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:10:25,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861973873]
[2024-11-07 11:10:25,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861973873] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:10:25,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:10:25,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-07 11:10:25,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816892815]
[2024-11-07 11:10:25,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:10:25,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 11:10:25,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:10:25,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 11:10:25,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-07 11:10:25,640 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 42
[2024-11-07 11:10:25,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 166 flow. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:10:25,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:10:25,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 42
[2024-11-07 11:10:25,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:10:25,958 INFO L124 PetriNetUnfolderBase]: 794/1557 cut-off events.
[2024-11-07 11:10:25,958 INFO L125 PetriNetUnfolderBase]: For 728/748 co-relation queries the response was YES.
[2024-11-07 11:10:25,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3531 conditions, 1557 events. 794/1557 cut-off events. For 728/748 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9200 event pairs, 97 based on Foata normal form. 8/1513 useless extension candidates. Maximal degree in co-relation 3516. Up to 681 conditions per place.
[2024-11-07 11:10:25,969 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 45 selfloop transitions, 10 changer transitions 10/84 dead transitions.
[2024-11-07 11:10:25,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 84 transitions, 396 flow
[2024-11-07 11:10:25,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 11:10:25,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-07 11:10:25,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions.
[2024-11-07 11:10:25,970 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6054421768707483
[2024-11-07 11:10:25,971 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 166 flow. Second operand 7 states and 178 transitions.
[2024-11-07 11:10:25,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 84 transitions, 396 flow
[2024-11-07 11:10:25,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 84 transitions, 332 flow, removed 14 selfloop flow, removed 8 redundant places.
[2024-11-07 11:10:25,987 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 182 flow
[2024-11-07 11:10:25,988 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=182, PETRI_PLACES=58, PETRI_TRANSITIONS=50}
[2024-11-07 11:10:25,988 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 10 predicate places.
[2024-11-07 11:10:25,988 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 182 flow
[2024-11-07 11:10:25,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:10:25,989 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:10:25,989 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:10:25,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-07 11:10:25,989 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-07 11:10:25,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:10:25,990 INFO L85 PathProgramCache]: Analyzing trace with hash 693499658, now seen corresponding path program 2 times
[2024-11-07 11:10:25,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:10:25,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160637759]
[2024-11-07 11:10:25,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:10:25,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:10:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:10:26,651 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:10:26,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:10:26,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160637759]
[2024-11-07 11:10:26,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160637759] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:10:26,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:10:26,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-11-07 11:10:26,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072629082]
[2024-11-07 11:10:26,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:10:26,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-07 11:10:26,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:10:26,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-07 11:10:26,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-11-07 11:10:26,680 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 42
[2024-11-07 11:10:26,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 182 flow. Second operand has 10 states, 10 states have (on average 18.0) internal successors, (180), 10 states have internal predecessors, (180), 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:10:26,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:10:26,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 42
[2024-11-07 11:10:26,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:10:27,590 INFO L124 PetriNetUnfolderBase]: 1789/3367 cut-off events.
[2024-11-07 11:10:27,590 INFO L125 PetriNetUnfolderBase]: For 914/943 co-relation queries the response was YES.
[2024-11-07 11:10:27,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7823 conditions, 3367 events. 1789/3367 cut-off events. For 914/943 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 23136 event pairs, 370 based on Foata normal form. 31/3248 useless extension candidates. Maximal degree in co-relation 7807. Up to 807 conditions per place.
[2024-11-07 11:10:27,606 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 32 selfloop transitions, 8 changer transitions 100/160 dead transitions.
[2024-11-07 11:10:27,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 160 transitions, 858 flow
[2024-11-07 11:10:27,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2024-11-07 11:10:27,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states.
[2024-11-07 11:10:27,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 390 transitions.
[2024-11-07 11:10:27,610 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5462184873949579
[2024-11-07 11:10:27,610 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 182 flow. Second operand 17 states and 390 transitions.
[2024-11-07 11:10:27,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 160 transitions, 858 flow
[2024-11-07 11:10:27,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 160 transitions, 850 flow, removed 4 selfloop flow, removed 2 redundant places.
[2024-11-07 11:10:27,615 INFO L231 Difference]: Finished difference. Result has 81 places, 51 transitions, 222 flow
[2024-11-07 11:10:27,615 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=222, PETRI_PLACES=81, PETRI_TRANSITIONS=51}
[2024-11-07 11:10:27,616 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 33 predicate places.
[2024-11-07 11:10:27,617 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 51 transitions, 222 flow
[2024-11-07 11:10:27,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.0) internal successors, (180), 10 states have internal predecessors, (180), 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:10:27,617 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:10:27,618 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:10:27,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-07 11:10:27,618 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-07 11:10:27,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:10:27,618 INFO L85 PathProgramCache]: Analyzing trace with hash -424209244, now seen corresponding path program 3 times
[2024-11-07 11:10:27,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:10:27,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471355342]
[2024-11-07 11:10:27,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:10:27,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:10:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:10:27,892 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:10:27,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:10:27,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471355342]
[2024-11-07 11:10:27,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471355342] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:10:27,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:10:27,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-07 11:10:27,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922827899]
[2024-11-07 11:10:27,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:10:27,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 11:10:27,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:10:27,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 11:10:27,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-07 11:10:27,903 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42
[2024-11-07 11:10:27,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 51 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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:10:27,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:10:27,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42
[2024-11-07 11:10:27,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:10:28,122 INFO L124 PetriNetUnfolderBase]: 600/1314 cut-off events.
[2024-11-07 11:10:28,122 INFO L125 PetriNetUnfolderBase]: For 557/573 co-relation queries the response was YES.
[2024-11-07 11:10:28,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2952 conditions, 1314 events. 600/1314 cut-off events. For 557/573 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8201 event pairs, 171 based on Foata normal form. 18/1253 useless extension candidates. Maximal degree in co-relation 2925. Up to 449 conditions per place.
[2024-11-07 11:10:28,128 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 24 selfloop transitions, 1 changer transitions 29/75 dead transitions.
[2024-11-07 11:10:28,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 75 transitions, 392 flow
[2024-11-07 11:10:28,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 11:10:28,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-07 11:10:28,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions.
[2024-11-07 11:10:28,130 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191
[2024-11-07 11:10:28,130 INFO L175 Difference]: Start difference. First operand has 81 places, 51 transitions, 222 flow. Second operand 6 states and 156 transitions.
[2024-11-07 11:10:28,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 75 transitions, 392 flow
[2024-11-07 11:10:28,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 75 transitions, 364 flow, removed 14 selfloop flow, removed 10 redundant places.
[2024-11-07 11:10:28,134 INFO L231 Difference]: Finished difference. Result has 68 places, 42 transitions, 150 flow
[2024-11-07 11:10:28,134 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=150, PETRI_PLACES=68, PETRI_TRANSITIONS=42}
[2024-11-07 11:10:28,136 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 20 predicate places.
[2024-11-07 11:10:28,136 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 42 transitions, 150 flow
[2024-11-07 11:10:28,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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:10:28,136 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:10:28,136 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:10:28,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-07 11:10:28,137 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-07 11:10:28,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:10:28,138 INFO L85 PathProgramCache]: Analyzing trace with hash -703791522, now seen corresponding path program 4 times
[2024-11-07 11:10:28,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:10:28,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419429127]
[2024-11-07 11:10:28,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:10:28,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:10:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:10:29,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 11:10:29,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:10:29,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419429127]
[2024-11-07 11:10:29,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419429127] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:10:29,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:10:29,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-07 11:10:29,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524482007]
[2024-11-07 11:10:29,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:10:29,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-07 11:10:29,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:10:29,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-07 11:10:29,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2024-11-07 11:10:29,975 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42
[2024-11-07 11:10:29,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 42 transitions, 150 flow. Second operand has 9 states, 9 states have (on average 21.77777777777778) internal successors, (196), 9 states have internal predecessors, (196), 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:10:29,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:10:29,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42
[2024-11-07 11:10:29,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:10:30,366 INFO L124 PetriNetUnfolderBase]: 286/652 cut-off events.
[2024-11-07 11:10:30,366 INFO L125 PetriNetUnfolderBase]: For 64/70 co-relation queries the response was YES.
[2024-11-07 11:10:30,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1362 conditions, 652 events. 286/652 cut-off events. For 64/70 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3198 event pairs, 92 based on Foata normal form. 8/619 useless extension candidates. Maximal degree in co-relation 1341. Up to 241 conditions per place.
[2024-11-07 11:10:30,370 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 21 selfloop transitions, 5 changer transitions 19/68 dead transitions.
[2024-11-07 11:10:30,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 68 transitions, 300 flow
[2024-11-07 11:10:30,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-07 11:10:30,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-11-07 11:10:30,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 246 transitions.
[2024-11-07 11:10:30,372 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5857142857142857
[2024-11-07 11:10:30,372 INFO L175 Difference]: Start difference. First operand has 68 places, 42 transitions, 150 flow. Second operand 10 states and 246 transitions.
[2024-11-07 11:10:30,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 68 transitions, 300 flow
[2024-11-07 11:10:30,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 68 transitions, 275 flow, removed 8 selfloop flow, removed 8 redundant places.
[2024-11-07 11:10:30,378 INFO L231 Difference]: Finished difference. Result has 69 places, 43 transitions, 156 flow
[2024-11-07 11:10:30,378 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=156, PETRI_PLACES=69, PETRI_TRANSITIONS=43}
[2024-11-07 11:10:30,379 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 21 predicate places.
[2024-11-07 11:10:30,379 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 43 transitions, 156 flow
[2024-11-07 11:10:30,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.77777777777778) internal successors, (196), 9 states have internal predecessors, (196), 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:10:30,379 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:10:30,379 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:10:30,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-07 11:10:30,380 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-07 11:10:30,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:10:30,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1958445220, now seen corresponding path program 5 times
[2024-11-07 11:10:30,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:10:30,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857790352]
[2024-11-07 11:10:30,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:10:30,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:10:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 11:10:30,465 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 11:10:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 11:10:30,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 11:10:30,556 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-07 11:10:30,557 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining)
[2024-11-07 11:10:30,558 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining)
[2024-11-07 11:10:30,558 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining)
[2024-11-07 11:10:30,558 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining)
[2024-11-07 11:10:30,558 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining)
[2024-11-07 11:10:30,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining)
[2024-11-07 11:10:30,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-07 11:10:30,559 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1]
[2024-11-07 11:10:30,641 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-07 11:10:30,641 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 11:10:30,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 11:10:30 BasicIcfg
[2024-11-07 11:10:30,650 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 11:10:30,651 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 11:10:30,651 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 11:10:30,651 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 11:10:30,652 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:10:22" (3/4) ...
[2024-11-07 11:10:30,652 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample
[2024-11-07 11:10:30,760 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-07 11:10:30,760 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 11:10:30,762 INFO L158 Benchmark]: Toolchain (without parser) took 9294.43ms. Allocated memory was 100.7MB in the beginning and 327.2MB in the end (delta: 226.5MB). Free memory was 76.2MB in the beginning and 222.2MB in the end (delta: -146.0MB). Peak memory consumption was 77.0MB. Max. memory is 16.1GB.
[2024-11-07 11:10:30,762 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 11:10:30,763 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.16ms. Allocated memory is still 100.7MB. Free memory was 76.1MB in the beginning and 52.2MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-07 11:10:30,763 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.19ms. Allocated memory is still 100.7MB. Free memory was 52.2MB in the beginning and 49.8MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 11:10:30,763 INFO L158 Benchmark]: Boogie Preprocessor took 55.01ms. Allocated memory is still 100.7MB. Free memory was 49.8MB in the beginning and 46.4MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 11:10:30,764 INFO L158 Benchmark]: RCFGBuilder took 698.71ms. Allocated memory is still 100.7MB. Free memory was 46.4MB in the beginning and 71.1MB in the end (delta: -24.8MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB.
[2024-11-07 11:10:30,764 INFO L158 Benchmark]: TraceAbstraction took 8067.32ms. Allocated memory was 100.7MB in the beginning and 327.2MB in the end (delta: 226.5MB). Free memory was 70.6MB in the beginning and 234.3MB in the end (delta: -163.8MB). Peak memory consumption was 62.5MB. Max. memory is 16.1GB.
[2024-11-07 11:10:30,765 INFO L158 Benchmark]: Witness Printer took 109.80ms. Allocated memory is still 327.2MB. Free memory was 234.3MB in the beginning and 222.2MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 11:10:30,766 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.16ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 325.16ms. Allocated memory is still 100.7MB. Free memory was 76.1MB in the beginning and 52.2MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 32.19ms. Allocated memory is still 100.7MB. Free memory was 52.2MB in the beginning and 49.8MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 55.01ms. Allocated memory is still 100.7MB. Free memory was 49.8MB in the beginning and 46.4MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* RCFGBuilder took 698.71ms. Allocated memory is still 100.7MB. Free memory was 46.4MB in the beginning and 71.1MB in the end (delta: -24.8MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB.
* TraceAbstraction took 8067.32ms. Allocated memory was 100.7MB in the beginning and 327.2MB in the end (delta: 226.5MB). Free memory was 70.6MB in the beginning and 234.3MB in the end (delta: -163.8MB). Peak memory consumption was 62.5MB. Max. memory is 16.1GB.
* Witness Printer took 109.80ms. Allocated memory is still 327.2MB. Free memory was 234.3MB in the beginning and 222.2MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
[L711] 0 int __unbuffered_p0_EAX = 0;
[L713] 0 int __unbuffered_p1_EAX = 0;
[L715] 0 int __unbuffered_p1_EBX = 0;
[L717] 0 int __unbuffered_p2_EAX = 0;
[L719] 0 int __unbuffered_p2_EBX = 0;
[L721] 0 int a = 0;
[L722] 0 _Bool main$tmp_guard0;
[L723] 0 _Bool main$tmp_guard1;
[L725] 0 int x = 0;
[L727] 0 int y = 0;
[L729] 0 int z = 0;
[L730] 0 _Bool z$flush_delayed;
[L731] 0 int z$mem_tmp;
[L732] 0 _Bool z$r_buff0_thd0;
[L733] 0 _Bool z$r_buff0_thd1;
[L734] 0 _Bool z$r_buff0_thd2;
[L735] 0 _Bool z$r_buff0_thd3;
[L736] 0 _Bool z$r_buff1_thd0;
[L737] 0 _Bool z$r_buff1_thd1;
[L738] 0 _Bool z$r_buff1_thd2;
[L739] 0 _Bool z$r_buff1_thd3;
[L740] 0 _Bool z$read_delayed;
[L741] 0 int *z$read_delayed_var;
[L742] 0 int z$w_buff0;
[L743] 0 _Bool z$w_buff0_used;
[L744] 0 int z$w_buff1;
[L745] 0 _Bool z$w_buff1_used;
[L746] 0 _Bool weak$$choice0;
[L747] 0 _Bool weak$$choice2;
[L853] 0 pthread_t t260;
[L854] FCALL, FORK 0 pthread_create(&t260, ((void *)0), P0, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t260=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L855] 0 pthread_t t261;
[L856] FCALL, FORK 0 pthread_create(&t261, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t260=-3, t261=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L857] 0 pthread_t t262;
[L858] FCALL, FORK 0 pthread_create(&t262, ((void *)0), P2, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t260=-3, t261=-2, t262=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L800] 3 z$w_buff1 = z$w_buff0
[L801] 3 z$w_buff0 = 1
[L802] 3 z$w_buff1_used = z$w_buff0_used
[L803] 3 z$w_buff0_used = (_Bool)1
[L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L18] COND FALSE 3 !(!expression)
[L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0
[L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1
[L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2
[L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3
[L809] 3 z$r_buff0_thd3 = (_Bool)1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L812] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L813] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L814] 3 z$flush_delayed = weak$$choice2
[L815] 3 z$mem_tmp = z
[L816] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L817] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L818] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L819] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L820] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L821] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L822] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L823] 3 __unbuffered_p2_EAX = z
[L824] 3 z = z$flush_delayed ? z$mem_tmp : z
[L825] 3 z$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L828] 3 __unbuffered_p2_EBX = a
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L751] 1 a = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L754] 1 __unbuffered_p0_EAX = x
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L766] 2 x = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L769] 2 y = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L772] 2 __unbuffered_p1_EAX = y
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L775] 2 weak$$choice0 = __VERIFIER_nondet_bool()
[L776] 2 weak$$choice2 = __VERIFIER_nondet_bool()
[L777] 2 z$flush_delayed = weak$$choice2
[L778] 2 z$mem_tmp = z
[L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)
[L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))
[L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))
[L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))
[L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))
[L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L786] 2 __unbuffered_p1_EBX = z
[L787] 2 z = z$flush_delayed ? z$mem_tmp : z
[L788] 2 z$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L831] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L832] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L833] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L834] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L835] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260=-3, t261=-2, t262=-1, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L862] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L862] RET 0 assume_abort_if_not(main$tmp_guard0)
[L864] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L865] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L866] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L867] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L868] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260=-3, t261=-2, t262=-1, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260=-3, t261=-2, t262=-1, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L873] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L18] 0 reach_error()
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
- UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: Not analyzed.
- UnprovableResult [Line: 854]: 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: 858]: 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: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 7 procedures, 70 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.9s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 423 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 395 mSDsluCounter, 257 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 228 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1125 IncrementalHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 29 mSDtfsCounter, 1125 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=6, InterpolantAutomatonStates: 58, 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.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 186 ConstructedInterpolants, 0 QuantifiedInterpolants, 1625 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:10:30,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE