./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-lit/qw2004-2b.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-lit/qw2004-2b.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', 'f17f6182d2330561fe6717b6a061d0dded698483f9e32b37a3b36e1144855a29']
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-lit/qw2004-2b.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 f17f6182d2330561fe6717b6a061d0dded698483f9e32b37a3b36e1144855a29
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 11:15:52,893 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-07 11:15:53,023 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:15:53,030 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 11:15:53,030 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 11:15:53,058 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 11:15:53,060 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 11:15:53,060 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 11:15:53,061 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 11:15:53,061 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-07 11:15:53,061 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 11:15:53,062 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 11:15:53,062 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 11:15:53,063 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-07 11:15:53,063 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-07 11:15:53,063 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 11:15:53,063 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-07 11:15:53,063 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-07 11:15:53,063 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-07 11:15:53,063 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-07 11:15:53,063 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-07 11:15:53,063 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 11:15:53,063 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 11:15:53,064 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 11:15:53,064 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-07 11:15:53,064 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-07 11:15:53,064 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-07 11:15:53,064 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-07 11:15:53,064 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 11:15:53,064 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-07 11:15:53,064 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 11:15:53,064 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-07 11:15:53,064 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 11:15:53,064 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 11:15:53,064 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 11:15:53,064 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 11:15:53,064 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-07 11:15:53,064 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 11:15:53,064 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 11:15:53,065 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 11:15:53,065 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 11:15:53,065 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 11:15:53,065 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 -> f17f6182d2330561fe6717b6a061d0dded698483f9e32b37a3b36e1144855a29
[2024-11-07 11:15:53,352 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 11:15:53,363 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 11:15:53,367 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 11:15:53,368 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-07 11:15:53,368 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-07 11:15:53,369 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/qw2004-2b.i
[2024-11-07 11:15:54,701 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-07 11:15:54,992 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-07 11:15:54,994 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-lit/qw2004-2b.i
[2024-11-07 11:15:55,012 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10ce0cee6/aa55ee9fcd3341f3971bb9cf97fabacb/FLAGfcb3d1eb0
[2024-11-07 11:15:55,033 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10ce0cee6/aa55ee9fcd3341f3971bb9cf97fabacb
[2024-11-07 11:15:55,035 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 11:15:55,037 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 11:15:55,039 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 11:15:55,040 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 11:15:55,047 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 11:15:55,048 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:15:55" (1/1) ...
[2024-11-07 11:15:55,049 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@698e5d8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:15:55, skipping insertion in model container
[2024-11-07 11:15:55,049 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:15:55" (1/1) ...
[2024-11-07 11:15:55,090 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-07 11:15:55,410 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-lit/qw2004-2b.i[30003,30016]
[2024-11-07 11:15:55,430 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-07 11:15:55,440 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-07 11:15:55,488 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-lit/qw2004-2b.i[30003,30016]
[2024-11-07 11:15:55,497 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-07 11:15:55,536 INFO  L204         MainTranslator]: Completed translation
[2024-11-07 11:15:55,538 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:15:55 WrapperNode
[2024-11-07 11:15:55,538 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 11:15:55,539 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 11:15:55,540 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 11:15:55,541 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 11:15:55,546 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:15:55" (1/1) ...
[2024-11-07 11:15:55,563 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:15:55" (1/1) ...
[2024-11-07 11:15:55,585 INFO  L138                Inliner]: procedures = 174, calls = 32, calls flagged for inlining = 9, calls inlined = 10, statements flattened = 114
[2024-11-07 11:15:55,587 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 11:15:55,587 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 11:15:55,587 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 11:15:55,588 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 11:15:55,594 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:15:55" (1/1) ...
[2024-11-07 11:15:55,595 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:15:55" (1/1) ...
[2024-11-07 11:15:55,598 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:15:55" (1/1) ...
[2024-11-07 11:15:55,617 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:15:55,621 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:15:55" (1/1) ...
[2024-11-07 11:15:55,621 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:15:55" (1/1) ...
[2024-11-07 11:15:55,630 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:15:55" (1/1) ...
[2024-11-07 11:15:55,632 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:15:55" (1/1) ...
[2024-11-07 11:15:55,633 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:15:55" (1/1) ...
[2024-11-07 11:15:55,636 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:15:55" (1/1) ...
[2024-11-07 11:15:55,638 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 11:15:55,643 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 11:15:55,643 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 11:15:55,643 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-07 11:15:55,644 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:15:55" (1/1) ...
[2024-11-07 11:15:55,654 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 11:15:55,668 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 11:15:55,681 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:15:55,685 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:15:55,709 INFO  L130     BoogieDeclarations]: Found specification of procedure BCSP_PnpStop
[2024-11-07 11:15:55,710 INFO  L138     BoogieDeclarations]: Found implementation of procedure BCSP_PnpStop
[2024-11-07 11:15:55,711 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-07 11:15:55,711 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 11:15:55,711 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 11:15:55,711 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-07 11:15:55,711 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 11:15:55,711 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 11:15:55,713 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:15:55,845 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-07 11:15:55,848 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 11:15:56,021 INFO  L283             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-07 11:15:56,022 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-07 11:15:56,144 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 11:15:56,145 INFO  L316             CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-07 11:15:56,145 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:15:56 BoogieIcfgContainer
[2024-11-07 11:15:56,145 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 11:15:56,148 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 11:15:56,148 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 11:15:56,153 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-07 11:15:56,153 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 11:15:55" (1/3) ...
[2024-11-07 11:15:56,154 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48577f72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:15:56, skipping insertion in model container
[2024-11-07 11:15:56,154 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:15:55" (2/3) ...
[2024-11-07 11:15:56,154 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48577f72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:15:56, skipping insertion in model container
[2024-11-07 11:15:56,154 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:15:56" (3/3) ...
[2024-11-07 11:15:56,155 INFO  L112   eAbstractionObserver]: Analyzing ICFG qw2004-2b.i
[2024-11-07 11:15:56,170 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 11:15:56,170 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 11:15:56,170 INFO  L489   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-07 11:15:56,207 INFO  L143    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-07 11:15:56,242 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 39 places, 40 transitions, 84 flow
[2024-11-07 11:15:56,272 INFO  L124   PetriNetUnfolderBase]: 5/39 cut-off events.
[2024-11-07 11:15:56,275 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-07 11:15:56,280 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43 conditions, 39 events. 5/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. 
[2024-11-07 11:15:56,281 INFO  L82        GeneralOperation]: Start removeDead. Operand has 39 places, 40 transitions, 84 flow
[2024-11-07 11:15:56,286 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 38 places, 39 transitions, 81 flow
[2024-11-07 11:15:56,292 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 11:15:56,302 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;@557393b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 11:15:56,302 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 2 error locations.
[2024-11-07 11:15:56,315 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-07 11:15:56,315 INFO  L124   PetriNetUnfolderBase]: 4/32 cut-off events.
[2024-11-07 11:15:56,315 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-07 11:15:56,315 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:15:56,316 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:15:56,316 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2024-11-07 11:15:56,321 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:15:56,322 INFO  L85        PathProgramCache]: Analyzing trace with hash -2140786468, now seen corresponding path program 1 times
[2024-11-07 11:15:56,327 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:15:56,327 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685454887]
[2024-11-07 11:15:56,327 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:15:56,328 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:15:56,427 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:15:56,575 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:15:56,576 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:15:56,576 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685454887]
[2024-11-07 11:15:56,576 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685454887] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:15:56,577 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:15:56,577 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 11:15:56,580 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639803438]
[2024-11-07 11:15:56,581 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:15:56,587 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 11:15:56,592 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:15:56,611 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 11:15:56,612 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 11:15:56,625 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 21 out of 40
[2024-11-07 11:15:56,628 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 39 transitions, 81 flow. Second operand  has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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:15:56,628 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:15:56,628 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 40
[2024-11-07 11:15:56,629 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:15:56,796 INFO  L124   PetriNetUnfolderBase]: 96/278 cut-off events.
[2024-11-07 11:15:56,797 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-07 11:15:56,799 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 461 conditions, 278 events. 96/278 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1388 event pairs, 45 based on Foata normal form. 12/262 useless extension candidates. Maximal degree in co-relation 452. Up to 113 conditions per place. 
[2024-11-07 11:15:56,801 INFO  L140   encePairwiseOnDemand]: 35/40 looper letters, 27 selfloop transitions, 3 changer transitions 3/53 dead transitions.
[2024-11-07 11:15:56,801 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 175 flow
[2024-11-07 11:15:56,802 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-07 11:15:56,804 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-07 11:15:56,810 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions.
[2024-11-07 11:15:56,811 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.74375
[2024-11-07 11:15:56,812 INFO  L175             Difference]: Start difference. First operand has 38 places, 39 transitions, 81 flow. Second operand 4 states and 119 transitions.
[2024-11-07 11:15:56,813 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 175 flow
[2024-11-07 11:15:56,815 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 174 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-07 11:15:56,817 INFO  L231             Difference]: Finished difference. Result has 42 places, 40 transitions, 99 flow
[2024-11-07 11:15:56,819 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=42, PETRI_TRANSITIONS=40}
[2024-11-07 11:15:56,822 INFO  L277   CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places.
[2024-11-07 11:15:56,822 INFO  L471      AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 99 flow
[2024-11-07 11:15:56,822 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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:15:56,822 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:15:56,822 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:15:56,823 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 11:15:56,823 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2024-11-07 11:15:56,823 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:15:56,823 INFO  L85        PathProgramCache]: Analyzing trace with hash -44288212, now seen corresponding path program 1 times
[2024-11-07 11:15:56,823 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:15:56,823 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682376057]
[2024-11-07 11:15:56,824 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:15:56,824 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:15:56,838 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:15:56,941 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:15:56,942 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:15:56,942 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682376057]
[2024-11-07 11:15:56,942 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682376057] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:15:56,942 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:15:56,942 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 11:15:56,942 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944013651]
[2024-11-07 11:15:56,942 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:15:56,943 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 11:15:56,943 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:15:56,943 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 11:15:56,943 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 11:15:56,952 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 18 out of 40
[2024-11-07 11:15:56,953 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 99 flow. Second operand  has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 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:15:56,953 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:15:56,953 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 40
[2024-11-07 11:15:56,953 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:15:57,137 INFO  L124   PetriNetUnfolderBase]: 124/322 cut-off events.
[2024-11-07 11:15:57,137 INFO  L125   PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES.
[2024-11-07 11:15:57,139 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 621 conditions, 322 events. 124/322 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1544 event pairs, 55 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 610. Up to 128 conditions per place. 
[2024-11-07 11:15:57,141 INFO  L140   encePairwiseOnDemand]: 33/40 looper letters, 27 selfloop transitions, 5 changer transitions 21/70 dead transitions.
[2024-11-07 11:15:57,141 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 70 transitions, 280 flow
[2024-11-07 11:15:57,141 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-07 11:15:57,141 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-07 11:15:57,142 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions.
[2024-11-07 11:15:57,143 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.609375
[2024-11-07 11:15:57,143 INFO  L175             Difference]: Start difference. First operand has 42 places, 40 transitions, 99 flow. Second operand 8 states and 195 transitions.
[2024-11-07 11:15:57,143 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 70 transitions, 280 flow
[2024-11-07 11:15:57,144 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 70 transitions, 278 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-07 11:15:57,146 INFO  L231             Difference]: Finished difference. Result has 54 places, 40 transitions, 122 flow
[2024-11-07 11:15:57,146 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=122, PETRI_PLACES=54, PETRI_TRANSITIONS=40}
[2024-11-07 11:15:57,147 INFO  L277   CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places.
[2024-11-07 11:15:57,147 INFO  L471      AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 122 flow
[2024-11-07 11:15:57,147 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 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:15:57,147 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:15:57,147 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:15:57,148 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-07 11:15:57,148 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2024-11-07 11:15:57,148 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:15:57,148 INFO  L85        PathProgramCache]: Analyzing trace with hash 1094475718, now seen corresponding path program 1 times
[2024-11-07 11:15:57,149 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:15:57,149 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863880530]
[2024-11-07 11:15:57,149 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:15:57,149 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:15:57,163 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:15:57,265 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:15:57,265 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:15:57,265 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863880530]
[2024-11-07 11:15:57,265 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863880530] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:15:57,265 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:15:57,265 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 11:15:57,266 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143013283]
[2024-11-07 11:15:57,266 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:15:57,266 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 11:15:57,266 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:15:57,266 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 11:15:57,266 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 11:15:57,271 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 19 out of 40
[2024-11-07 11:15:57,271 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 122 flow. Second operand  has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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:15:57,271 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:15:57,271 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 40
[2024-11-07 11:15:57,271 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:15:57,489 INFO  L124   PetriNetUnfolderBase]: 89/266 cut-off events.
[2024-11-07 11:15:57,490 INFO  L125   PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES.
[2024-11-07 11:15:57,491 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 552 conditions, 266 events. 89/266 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1201 event pairs, 35 based on Foata normal form. 6/255 useless extension candidates. Maximal degree in co-relation 534. Up to 138 conditions per place. 
[2024-11-07 11:15:57,495 INFO  L140   encePairwiseOnDemand]: 37/40 looper letters, 29 selfloop transitions, 1 changer transitions 9/58 dead transitions.
[2024-11-07 11:15:57,496 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 252 flow
[2024-11-07 11:15:57,498 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-07 11:15:57,498 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-07 11:15:57,499 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions.
[2024-11-07 11:15:57,499 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.71875
[2024-11-07 11:15:57,499 INFO  L175             Difference]: Start difference. First operand has 54 places, 40 transitions, 122 flow. Second operand 4 states and 115 transitions.
[2024-11-07 11:15:57,499 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 252 flow
[2024-11-07 11:15:57,505 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 236 flow, removed 5 selfloop flow, removed 5 redundant places.
[2024-11-07 11:15:57,507 INFO  L231             Difference]: Finished difference. Result has 50 places, 40 transitions, 117 flow
[2024-11-07 11:15:57,508 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=50, PETRI_TRANSITIONS=40}
[2024-11-07 11:15:57,509 INFO  L277   CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places.
[2024-11-07 11:15:57,509 INFO  L471      AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 117 flow
[2024-11-07 11:15:57,509 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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:15:57,510 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:15:57,510 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:15:57,510 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-07 11:15:57,511 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2024-11-07 11:15:57,511 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:15:57,512 INFO  L85        PathProgramCache]: Analyzing trace with hash 1668404468, now seen corresponding path program 2 times
[2024-11-07 11:15:57,512 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:15:57,512 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355339342]
[2024-11-07 11:15:57,512 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:15:57,512 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:15:57,545 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:15:57,621 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:15:57,621 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:15:57,621 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355339342]
[2024-11-07 11:15:57,622 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355339342] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:15:57,622 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:15:57,622 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 11:15:57,622 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402908145]
[2024-11-07 11:15:57,622 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:15:57,622 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 11:15:57,622 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:15:57,623 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 11:15:57,623 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 11:15:57,630 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 19 out of 40
[2024-11-07 11:15:57,631 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 117 flow. Second operand  has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:15:57,631 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:15:57,631 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 40
[2024-11-07 11:15:57,631 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:15:57,751 INFO  L124   PetriNetUnfolderBase]: 100/291 cut-off events.
[2024-11-07 11:15:57,752 INFO  L125   PetriNetUnfolderBase]: For 59/62 co-relation queries the response was YES.
[2024-11-07 11:15:57,754 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 597 conditions, 291 events. 100/291 cut-off events. For 59/62 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1393 event pairs, 30 based on Foata normal form. 17/290 useless extension candidates. Maximal degree in co-relation 580. Up to 121 conditions per place. 
[2024-11-07 11:15:57,756 INFO  L140   encePairwiseOnDemand]: 35/40 looper letters, 15 selfloop transitions, 2 changer transitions 34/68 dead transitions.
[2024-11-07 11:15:57,756 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 68 transitions, 291 flow
[2024-11-07 11:15:57,757 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-07 11:15:57,757 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-07 11:15:57,758 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions.
[2024-11-07 11:15:57,758 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.725
[2024-11-07 11:15:57,761 INFO  L175             Difference]: Start difference. First operand has 50 places, 40 transitions, 117 flow. Second operand 5 states and 145 transitions.
[2024-11-07 11:15:57,761 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 68 transitions, 291 flow
[2024-11-07 11:15:57,762 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 68 transitions, 288 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-11-07 11:15:57,763 INFO  L231             Difference]: Finished difference. Result has 54 places, 32 transitions, 108 flow
[2024-11-07 11:15:57,763 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=54, PETRI_TRANSITIONS=32}
[2024-11-07 11:15:57,764 INFO  L277   CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places.
[2024-11-07 11:15:57,764 INFO  L471      AbstractCegarLoop]: Abstraction has has 54 places, 32 transitions, 108 flow
[2024-11-07 11:15:57,764 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:15:57,764 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:15:57,766 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:15:57,766 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-07 11:15:57,766 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2024-11-07 11:15:57,767 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:15:57,767 INFO  L85        PathProgramCache]: Analyzing trace with hash 1208220253, now seen corresponding path program 1 times
[2024-11-07 11:15:57,767 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:15:57,767 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993088549]
[2024-11-07 11:15:57,767 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:15:57,767 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:15:57,786 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:15:57,927 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:15:57,928 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:15:57,928 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993088549]
[2024-11-07 11:15:57,928 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993088549] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:15:57,928 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:15:57,928 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-07 11:15:57,928 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66676693]
[2024-11-07 11:15:57,928 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:15:57,929 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 11:15:57,929 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:15:57,929 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 11:15:57,929 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-07 11:15:57,945 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 18 out of 40
[2024-11-07 11:15:57,947 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 32 transitions, 108 flow. Second operand  has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 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:15:57,947 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:15:57,947 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 40
[2024-11-07 11:15:57,947 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:15:58,158 INFO  L124   PetriNetUnfolderBase]: 92/307 cut-off events.
[2024-11-07 11:15:58,159 INFO  L125   PetriNetUnfolderBase]: For 99/101 co-relation queries the response was YES.
[2024-11-07 11:15:58,160 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 698 conditions, 307 events. 92/307 cut-off events. For 99/101 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1615 event pairs, 28 based on Foata normal form. 7/298 useless extension candidates. Maximal degree in co-relation 678. Up to 106 conditions per place. 
[2024-11-07 11:15:58,161 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 35 selfloop transitions, 6 changer transitions 19/75 dead transitions.
[2024-11-07 11:15:58,161 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 75 transitions, 352 flow
[2024-11-07 11:15:58,164 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-11-07 11:15:58,164 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-11-07 11:15:58,165 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 258 transitions.
[2024-11-07 11:15:58,166 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.5863636363636363
[2024-11-07 11:15:58,166 INFO  L175             Difference]: Start difference. First operand has 54 places, 32 transitions, 108 flow. Second operand 11 states and 258 transitions.
[2024-11-07 11:15:58,166 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 75 transitions, 352 flow
[2024-11-07 11:15:58,168 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 75 transitions, 324 flow, removed 12 selfloop flow, removed 5 redundant places.
[2024-11-07 11:15:58,171 INFO  L231             Difference]: Finished difference. Result has 58 places, 36 transitions, 153 flow
[2024-11-07 11:15:58,172 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=153, PETRI_PLACES=58, PETRI_TRANSITIONS=36}
[2024-11-07 11:15:58,172 INFO  L277   CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places.
[2024-11-07 11:15:58,172 INFO  L471      AbstractCegarLoop]: Abstraction has has 58 places, 36 transitions, 153 flow
[2024-11-07 11:15:58,173 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 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:15:58,174 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:15:58,175 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:15:58,175 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-07 11:15:58,175 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2024-11-07 11:15:58,176 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:15:58,176 INFO  L85        PathProgramCache]: Analyzing trace with hash 291242283, now seen corresponding path program 2 times
[2024-11-07 11:15:58,176 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:15:58,176 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674943496]
[2024-11-07 11:15:58,176 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:15:58,176 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:15:58,192 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 11:15:58,193 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 11:15:58,203 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 11:15:58,226 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 11:15:58,228 INFO  L325         BasicCegarLoop]: Counterexample is feasible
[2024-11-07 11:15:58,229 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining)
[2024-11-07 11:15:58,232 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining)
[2024-11-07 11:15:58,233 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-07 11:15:58,233 INFO  L407         BasicCegarLoop]: Path program histogram: [2, 2, 1, 1]
[2024-11-07 11:15:58,278 INFO  L239   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-07 11:15:58,278 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 11:15:58,283 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 11:15:58 BasicIcfg
[2024-11-07 11:15:58,284 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 11:15:58,284 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 11:15:58,284 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-07 11:15:58,284 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-07 11:15:58,285 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:15:56" (3/4) ...
[2024-11-07 11:15:58,286 INFO  L136         WitnessPrinter]: Generating witness for reachability counterexample
[2024-11-07 11:15:58,340 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-07 11:15:58,340 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 11:15:58,341 INFO  L158              Benchmark]: Toolchain (without parser) took 3304.32ms. Allocated memory is still 100.7MB. Free memory was 75.0MB in the beginning and 50.8MB in the end (delta: 24.2MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB.
[2024-11-07 11:15:58,342 INFO  L158              Benchmark]: CDTParser took 0.23ms. Allocated memory is still 83.9MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 11:15:58,342 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 498.87ms. Allocated memory is still 100.7MB. Free memory was 74.9MB in the beginning and 55.2MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 11:15:58,342 INFO  L158              Benchmark]: Boogie Procedure Inliner took 47.93ms. Allocated memory is still 100.7MB. Free memory was 55.2MB in the beginning and 53.3MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 11:15:58,343 INFO  L158              Benchmark]: Boogie Preprocessor took 54.70ms. Allocated memory is still 100.7MB. Free memory was 53.3MB in the beginning and 51.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 11:15:58,343 INFO  L158              Benchmark]: RCFGBuilder took 502.63ms. Allocated memory is still 100.7MB. Free memory was 51.7MB in the beginning and 66.6MB in the end (delta: -15.0MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB.
[2024-11-07 11:15:58,343 INFO  L158              Benchmark]: TraceAbstraction took 2135.75ms. Allocated memory is still 100.7MB. Free memory was 66.2MB in the beginning and 55.8MB in the end (delta: 10.4MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB.
[2024-11-07 11:15:58,344 INFO  L158              Benchmark]: Witness Printer took 56.18ms. Allocated memory is still 100.7MB. Free memory was 55.8MB in the beginning and 50.8MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 11:15:58,345 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.23ms. Allocated memory is still 83.9MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 498.87ms. Allocated memory is still 100.7MB. Free memory was 74.9MB in the beginning and 55.2MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 47.93ms. Allocated memory is still 100.7MB. Free memory was 55.2MB in the beginning and 53.3MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 54.70ms. Allocated memory is still 100.7MB. Free memory was 53.3MB in the beginning and 51.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB.
 * RCFGBuilder took 502.63ms. Allocated memory is still 100.7MB. Free memory was 51.7MB in the beginning and 66.6MB in the end (delta: -15.0MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB.
 * TraceAbstraction took 2135.75ms. Allocated memory is still 100.7MB. Free memory was 66.2MB in the beginning and 55.8MB in the end (delta: 10.4MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB.
 * Witness Printer took 56.18ms. Allocated memory is still 100.7MB. Free memory was 55.8MB in the beginning and 50.8MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - CounterExampleResult [Line: 690]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L697]               0  volatile int stoppingFlag;
[L698]               0  volatile int pendingIo;
[L699]               0  volatile int stoppingEvent;
[L700]               0  volatile int stopped;
[L756]               0  pthread_t t;
[L757]               0  pendingIo = 1
[L758]               0  stoppingFlag = 0
[L759]               0  stoppingEvent = 0
[L760]               0  stopped = 0
[L761]  FCALL, FORK  0  pthread_create(&t, 0, BCSP_PnpStop, 0)
        VAL             [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0, t=-1]
[L762]  CALL         0  BCSP_PnpAdd(0)
[L734]               0  int status;
[L735]  CALL, EXPR   0  BCSP_IoIncrement()
[L703]               0  int lsf = stoppingFlag;
        VAL             [lsf=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0]
[L745]               1  stoppingFlag = 1
        VAL             [\old(arg)={0:0}, arg={0:0}, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1]
[L747]  CALL         1  BCSP_IoDecrement()
[L725]               1  int pending;
[L726]  CALL, EXPR   1  dec()
[L705]  COND FALSE   0  !(\read(lsf))
        VAL             [lsf=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1]
[L709]               0  int lp = pendingIo;
        VAL             [lp=1, lsf=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1]
[L719]               1  pendingIo--
[L720]               1  int tmp = pendingIo;
        VAL             [pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=1, tmp=0]
[L722]               1  return tmp;
[L726]  RET, EXPR    1  dec()
[L726]               1  pending = dec()
[L727]  COND TRUE    1  pending == 0
        VAL             [pending=0, pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=1]
[L729]               1  stoppingEvent = 1
        VAL             [pending=0, pendingIo=0, stopped=0, stoppingEvent=1, stoppingFlag=1]
[L747]  RET          1  BCSP_IoDecrement()
[L749]               1  int lse = stoppingEvent;
        VAL             [\old(arg)={0:0}, arg={0:0}, lse=1, pendingIo=0, stopped=0, stoppingEvent=1, stoppingFlag=1]
[L751]  CALL         1  assume_abort_if_not(lse)
[L686]  COND FALSE   1  !(!cond)
[L751]  RET          1  assume_abort_if_not(lse)
[L712]               0  pendingIo = lp + 1
        VAL             [lp=1, lsf=0, pendingIo=2, stopped=0, stoppingEvent=1, stoppingFlag=1]
[L715]               0  return 0;
        VAL             [\result=0, lsf=0, pendingIo=2, stopped=0, stoppingEvent=1, stoppingFlag=1]
[L735]  RET, EXPR    0  BCSP_IoIncrement()
[L735]               0  status = BCSP_IoIncrement()
[L736]  COND TRUE    0  status == 0
        VAL             [\old(arg)={0:0}, arg={0:0}, pendingIo=2, status=0, stopped=0, stoppingEvent=1, stoppingFlag=1]
[L752]               1  stopped = 1
        VAL             [\old(arg)={0:0}, arg={0:0}, lse=1, pendingIo=2, stopped=1, stoppingEvent=1, stoppingFlag=1]
[L737]               0  int local_assertion = !stopped;
        VAL             [\old(arg)={0:0}, arg={0:0}, local_assertion=0, pendingIo=2, status=0, stopped=1, stoppingEvent=1, stoppingFlag=1]
[L738]  CALL         0  __VERIFIER_assert(local_assertion)
[L689]  COND TRUE    0  !(cond)
        VAL             [\old(cond)=0, cond=0, pendingIo=2, stopped=1, stoppingEvent=1, stoppingFlag=1]
[L690]               0  reach_error()
        VAL             [\old(cond)=0, cond=0, pendingIo=2, stopped=1, stoppingEvent=1, stoppingFlag=1]

  - UnprovableResult [Line: 761]: 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 3 procedures, 50 locations, 2 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: 2.0s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 154 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 136 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 500 IncrementalHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 19 mSDtfsCounter, 500 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=5, InterpolantAutomatonStates: 32, 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.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 197 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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:15:58,368 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE