./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi004.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/rfi004.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', '131a5c0bb00c7f6e11a814871ba4a0d65133507ca6f79e4b87c2742dbe2c5590']
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/rfi004.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 131a5c0bb00c7f6e11a814871ba4a0d65133507ca6f79e4b87c2742dbe2c5590
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 11:13:26,326 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 11:13:26,424 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:13:26,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 11:13:26,432 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 11:13:26,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 11:13:26,463 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 11:13:26,463 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 11:13:26,464 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 11:13:26,464 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 11:13:26,464 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 11:13:26,464 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 11:13:26,465 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 11:13:26,465 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 11:13:26,465 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 11:13:26,466 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 11:13:26,466 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 11:13:26,466 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 11:13:26,466 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 11:13:26,466 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 11:13:26,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 11:13:26,466 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 11:13:26,466 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 11:13:26,466 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 11:13:26,466 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 11:13:26,466 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 11:13:26,466 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 11:13:26,466 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 11:13:26,466 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 11:13:26,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 11:13:26,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 11:13:26,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 11:13:26,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 11:13:26,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 11:13:26,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 11:13:26,467 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 11:13:26,467 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 11:13:26,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 11:13:26,467 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 11:13:26,467 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 11:13:26,467 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 11:13:26,467 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 11:13:26,467 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 -> 131a5c0bb00c7f6e11a814871ba4a0d65133507ca6f79e4b87c2742dbe2c5590
[2024-11-07 11:13:26,738 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 11:13:26,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 11:13:26,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 11:13:26,750 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 11:13:26,750 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 11:13:26,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi004.i
[2024-11-07 11:13:28,133 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 11:13:28,389 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 11:13:28,390 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi004.i
[2024-11-07 11:13:28,408 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b8f6be36a/ace4cf236d26428299d1c64804703f57/FLAG59ffbda33
[2024-11-07 11:13:28,430 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b8f6be36a/ace4cf236d26428299d1c64804703f57
[2024-11-07 11:13:28,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 11:13:28,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 11:13:28,437 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 11:13:28,438 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 11:13:28,444 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 11:13:28,445 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:13:28" (1/1) ...
[2024-11-07 11:13:28,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53e0cafd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:28, skipping insertion in model container
[2024-11-07 11:13:28,446 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:13:28" (1/1) ...
[2024-11-07 11:13:28,491 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 11:13:28,681 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/rfi004.i[983,996]
[2024-11-07 11:13:28,840 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 11:13:28,849 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 11:13:28,857 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/rfi004.i[983,996]
[2024-11-07 11:13:28,908 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 11:13:28,949 INFO L204 MainTranslator]: Completed translation
[2024-11-07 11:13:28,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:28 WrapperNode
[2024-11-07 11:13:28,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 11:13:28,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 11:13:28,953 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 11:13:28,953 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 11:13:28,958 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:13:28" (1/1) ...
[2024-11-07 11:13:28,970 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:13:28" (1/1) ...
[2024-11-07 11:13:28,992 INFO L138 Inliner]: procedures = 174, calls = 39, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 112
[2024-11-07 11:13:28,994 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 11:13:28,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 11:13:28,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 11:13:28,995 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 11:13:29,001 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:28" (1/1) ...
[2024-11-07 11:13:29,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:28" (1/1) ...
[2024-11-07 11:13:29,004 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:28" (1/1) ...
[2024-11-07 11:13:29,023 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:13:29,024 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:28" (1/1) ...
[2024-11-07 11:13:29,024 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:28" (1/1) ...
[2024-11-07 11:13:29,030 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:28" (1/1) ...
[2024-11-07 11:13:29,032 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:28" (1/1) ...
[2024-11-07 11:13:29,034 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:28" (1/1) ...
[2024-11-07 11:13:29,035 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:28" (1/1) ...
[2024-11-07 11:13:29,037 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 11:13:29,044 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 11:13:29,044 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 11:13:29,044 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 11:13:29,045 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:28" (1/1) ...
[2024-11-07 11:13:29,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 11:13:29,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 11:13:29,079 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:13:29,082 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:13:29,103 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-07 11:13:29,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 11:13:29,104 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-11-07 11:13:29,104 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-11-07 11:13:29,104 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-11-07 11:13:29,104 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-11-07 11:13:29,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 11:13:29,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-07 11:13:29,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 11:13:29,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 11:13:29,107 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:13:29,239 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 11:13:29,241 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 11:13:29,482 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-07 11:13:29,482 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 11:13:29,691 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 11:13:29,692 INFO L316 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-07 11:13:29,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:13:29 BoogieIcfgContainer
[2024-11-07 11:13:29,692 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 11:13:29,695 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 11:13:29,695 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 11:13:29,700 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 11:13:29,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 11:13:28" (1/3) ...
[2024-11-07 11:13:29,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e481ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:13:29, skipping insertion in model container
[2024-11-07 11:13:29,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:28" (2/3) ...
[2024-11-07 11:13:29,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e481ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:13:29, skipping insertion in model container
[2024-11-07 11:13:29,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:13:29" (3/3) ...
[2024-11-07 11:13:29,702 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi004.i
[2024-11-07 11:13:29,714 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 11:13:29,714 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2024-11-07 11:13:29,714 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-07 11:13:29,764 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-07 11:13:29,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 74 flow
[2024-11-07 11:13:29,836 INFO L124 PetriNetUnfolderBase]: 1/31 cut-off events.
[2024-11-07 11:13:29,838 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-07 11:13:29,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 31 events. 1/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place.
[2024-11-07 11:13:29,843 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 33 transitions, 74 flow
[2024-11-07 11:13:29,846 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 31 transitions, 68 flow
[2024-11-07 11:13:29,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 11:13:29,861 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;@307a3287, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 11:13:29,862 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2024-11-07 11:13:29,868 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-07 11:13:29,868 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events.
[2024-11-07 11:13:29,868 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-07 11:13:29,868 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:13:29,869 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-11-07 11:13:29,869 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-07 11:13:29,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:13:29,874 INFO L85 PathProgramCache]: Analyzing trace with hash 744662756, now seen corresponding path program 1 times
[2024-11-07 11:13:29,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:13:29,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778989154]
[2024-11-07 11:13:29,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:13:29,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:13:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:13:30,364 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:13:30,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:13:30,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778989154]
[2024-11-07 11:13:30,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778989154] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:13:30,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:13:30,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-07 11:13:30,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456736926]
[2024-11-07 11:13:30,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:13:30,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 11:13:30,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:13:30,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 11:13:30,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 11:13:30,403 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 33
[2024-11-07 11:13:30,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:13:30,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:13:30,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 33
[2024-11-07 11:13:30,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:13:30,595 INFO L124 PetriNetUnfolderBase]: 95/269 cut-off events.
[2024-11-07 11:13:30,596 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-07 11:13:30,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 269 events. 95/269 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1456 event pairs, 14 based on Foata normal form. 12/271 useless extension candidates. Maximal degree in co-relation 445. Up to 136 conditions per place.
[2024-11-07 11:13:30,602 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 17 selfloop transitions, 2 changer transitions 2/36 dead transitions.
[2024-11-07 11:13:30,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 36 transitions, 120 flow
[2024-11-07 11:13:30,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 11:13:30,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-07 11:13:30,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions.
[2024-11-07 11:13:30,615 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7575757575757576
[2024-11-07 11:13:30,616 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 68 flow. Second operand 3 states and 75 transitions.
[2024-11-07 11:13:30,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 36 transitions, 120 flow
[2024-11-07 11:13:30,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 36 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-07 11:13:30,625 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 64 flow
[2024-11-07 11:13:30,627 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=28}
[2024-11-07 11:13:30,631 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places.
[2024-11-07 11:13:30,631 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 64 flow
[2024-11-07 11:13:30,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:13:30,632 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:13:30,632 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:13:30,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 11:13:30,632 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-07 11:13:30,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:13:30,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1416388167, now seen corresponding path program 1 times
[2024-11-07 11:13:30,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:13:30,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112159269]
[2024-11-07 11:13:30,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:13:30,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:13:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:13:30,932 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:13:30,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:13:30,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112159269]
[2024-11-07 11:13:30,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112159269] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:13:30,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:13:30,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 11:13:30,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945670225]
[2024-11-07 11:13:30,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:13:30,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 11:13:30,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:13:30,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 11:13:30,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 11:13:30,950 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 33
[2024-11-07 11:13:30,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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:13:30,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:13:30,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 33
[2024-11-07 11:13:30,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:13:31,262 INFO L124 PetriNetUnfolderBase]: 252/525 cut-off events.
[2024-11-07 11:13:31,262 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES.
[2024-11-07 11:13:31,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 525 events. 252/525 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3033 event pairs, 82 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 1005. Up to 278 conditions per place.
[2024-11-07 11:13:31,268 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 22 selfloop transitions, 3 changer transitions 33/68 dead transitions.
[2024-11-07 11:13:31,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 68 transitions, 274 flow
[2024-11-07 11:13:31,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-07 11:13:31,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-07 11:13:31,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions.
[2024-11-07 11:13:31,272 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909
[2024-11-07 11:13:31,272 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 64 flow. Second operand 8 states and 156 transitions.
[2024-11-07 11:13:31,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 68 transitions, 274 flow
[2024-11-07 11:13:31,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 68 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-07 11:13:31,275 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 93 flow
[2024-11-07 11:13:31,276 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=93, PETRI_PLACES=45, PETRI_TRANSITIONS=29}
[2024-11-07 11:13:31,277 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 8 predicate places.
[2024-11-07 11:13:31,277 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 93 flow
[2024-11-07 11:13:31,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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:13:31,278 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:13:31,278 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:13:31,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-07 11:13:31,279 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-07 11:13:31,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:13:31,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1488513211, now seen corresponding path program 1 times
[2024-11-07 11:13:31,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:13:31,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241683010]
[2024-11-07 11:13:31,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:13:31,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:13:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:13:31,566 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:13:31,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:13:31,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241683010]
[2024-11-07 11:13:31,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241683010] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:13:31,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:13:31,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 11:13:31,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215058115]
[2024-11-07 11:13:31,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:13:31,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 11:13:31,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:13:31,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 11:13:31,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 11:13:31,579 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 33
[2024-11-07 11:13:31,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:13:31,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:13:31,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 33
[2024-11-07 11:13:31,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:13:31,764 INFO L124 PetriNetUnfolderBase]: 134/306 cut-off events.
[2024-11-07 11:13:31,765 INFO L125 PetriNetUnfolderBase]: For 221/221 co-relation queries the response was YES.
[2024-11-07 11:13:31,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 306 events. 134/306 cut-off events. For 221/221 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1637 event pairs, 45 based on Foata normal form. 10/306 useless extension candidates. Maximal degree in co-relation 752. Up to 151 conditions per place.
[2024-11-07 11:13:31,769 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 19 selfloop transitions, 3 changer transitions 15/48 dead transitions.
[2024-11-07 11:13:31,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 227 flow
[2024-11-07 11:13:31,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 11:13:31,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-07 11:13:31,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions.
[2024-11-07 11:13:31,775 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5584415584415584
[2024-11-07 11:13:31,776 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 93 flow. Second operand 7 states and 129 transitions.
[2024-11-07 11:13:31,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 227 flow
[2024-11-07 11:13:31,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 210 flow, removed 7 selfloop flow, removed 3 redundant places.
[2024-11-07 11:13:31,781 INFO L231 Difference]: Finished difference. Result has 47 places, 29 transitions, 103 flow
[2024-11-07 11:13:31,781 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=103, PETRI_PLACES=47, PETRI_TRANSITIONS=29}
[2024-11-07 11:13:31,782 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 10 predicate places.
[2024-11-07 11:13:31,782 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 29 transitions, 103 flow
[2024-11-07 11:13:31,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:13:31,782 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:13:31,782 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:13:31,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-07 11:13:31,782 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-07 11:13:31,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:13:31,783 INFO L85 PathProgramCache]: Analyzing trace with hash 588210652, now seen corresponding path program 1 times
[2024-11-07 11:13:31,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:13:31,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953681758]
[2024-11-07 11:13:31,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:13:31,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:13:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:13:31,966 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:13:31,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:13:31,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953681758]
[2024-11-07 11:13:31,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953681758] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:13:31,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:13:31,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 11:13:31,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897417092]
[2024-11-07 11:13:31,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:13:31,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 11:13:31,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:13:31,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 11:13:31,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 11:13:31,976 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 33
[2024-11-07 11:13:31,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 29 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:13:31,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:13:31,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 33
[2024-11-07 11:13:31,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:13:32,089 INFO L124 PetriNetUnfolderBase]: 162/346 cut-off events.
[2024-11-07 11:13:32,089 INFO L125 PetriNetUnfolderBase]: For 272/274 co-relation queries the response was YES.
[2024-11-07 11:13:32,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 346 events. 162/346 cut-off events. For 272/274 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1686 event pairs, 23 based on Foata normal form. 23/355 useless extension candidates. Maximal degree in co-relation 832. Up to 147 conditions per place.
[2024-11-07 11:13:32,092 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 28 selfloop transitions, 4 changer transitions 1/45 dead transitions.
[2024-11-07 11:13:32,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 215 flow
[2024-11-07 11:13:32,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 11:13:32,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-07 11:13:32,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions.
[2024-11-07 11:13:32,093 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818
[2024-11-07 11:13:32,093 INFO L175 Difference]: Start difference. First operand has 47 places, 29 transitions, 103 flow. Second operand 4 states and 90 transitions.
[2024-11-07 11:13:32,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 215 flow
[2024-11-07 11:13:32,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 199 flow, removed 5 selfloop flow, removed 6 redundant places.
[2024-11-07 11:13:32,096 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 113 flow
[2024-11-07 11:13:32,096 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=42, PETRI_TRANSITIONS=31}
[2024-11-07 11:13:32,096 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places.
[2024-11-07 11:13:32,097 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 113 flow
[2024-11-07 11:13:32,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 11:13:32,097 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:13:32,097 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:13:32,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-07 11:13:32,097 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-07 11:13:32,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:13:32,098 INFO L85 PathProgramCache]: Analyzing trace with hash 466267505, now seen corresponding path program 1 times
[2024-11-07 11:13:32,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:13:32,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147687497]
[2024-11-07 11:13:32,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:13:32,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:13:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:13:32,286 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:13:32,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:13:32,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147687497]
[2024-11-07 11:13:32,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147687497] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:13:32,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:13:32,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 11:13:32,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819065870]
[2024-11-07 11:13:32,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:13:32,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 11:13:32,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:13:32,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 11:13:32,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-07 11:13:32,297 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 33
[2024-11-07 11:13:32,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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:13:32,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:13:32,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 33
[2024-11-07 11:13:32,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:13:32,399 INFO L124 PetriNetUnfolderBase]: 87/196 cut-off events.
[2024-11-07 11:13:32,400 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES.
[2024-11-07 11:13:32,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 196 events. 87/196 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 710 event pairs, 16 based on Foata normal form. 16/202 useless extension candidates. Maximal degree in co-relation 505. Up to 80 conditions per place.
[2024-11-07 11:13:32,402 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 24 selfloop transitions, 6 changer transitions 1/43 dead transitions.
[2024-11-07 11:13:32,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 43 transitions, 210 flow
[2024-11-07 11:13:32,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 11:13:32,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-07 11:13:32,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions.
[2024-11-07 11:13:32,403 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182
[2024-11-07 11:13:32,403 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 113 flow. Second operand 5 states and 102 transitions.
[2024-11-07 11:13:32,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 43 transitions, 210 flow
[2024-11-07 11:13:32,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 182 flow, removed 9 selfloop flow, removed 5 redundant places.
[2024-11-07 11:13:32,405 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 114 flow
[2024-11-07 11:13:32,405 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=43, PETRI_TRANSITIONS=31}
[2024-11-07 11:13:32,406 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 6 predicate places.
[2024-11-07 11:13:32,406 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 114 flow
[2024-11-07 11:13:32,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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:13:32,407 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:13:32,407 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:13:32,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-07 11:13:32,407 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-07 11:13:32,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:13:32,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1731714192, now seen corresponding path program 1 times
[2024-11-07 11:13:32,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:13:32,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376680579]
[2024-11-07 11:13:32,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:13:32,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:13:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:13:32,689 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:13:32,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:13:32,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376680579]
[2024-11-07 11:13:32,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376680579] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:13:32,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:13:32,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-07 11:13:32,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232720279]
[2024-11-07 11:13:32,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:13:32,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 11:13:32,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:13:32,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 11:13:32,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-07 11:13:32,701 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 33
[2024-11-07 11:13:32,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 114 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 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:13:32,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:13:32,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 33
[2024-11-07 11:13:32,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:13:32,862 INFO L124 PetriNetUnfolderBase]: 110/276 cut-off events.
[2024-11-07 11:13:32,862 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES.
[2024-11-07 11:13:32,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 276 events. 110/276 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1102 event pairs, 30 based on Foata normal form. 4/272 useless extension candidates. Maximal degree in co-relation 628. Up to 120 conditions per place.
[2024-11-07 11:13:32,864 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 19 selfloop transitions, 1 changer transitions 19/51 dead transitions.
[2024-11-07 11:13:32,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 51 transitions, 240 flow
[2024-11-07 11:13:32,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 11:13:32,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-07 11:13:32,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions.
[2024-11-07 11:13:32,865 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556
[2024-11-07 11:13:32,865 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 114 flow. Second operand 6 states and 110 transitions.
[2024-11-07 11:13:32,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 51 transitions, 240 flow
[2024-11-07 11:13:32,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 206 flow, removed 8 selfloop flow, removed 6 redundant places.
[2024-11-07 11:13:32,867 INFO L231 Difference]: Finished difference. Result has 46 places, 29 transitions, 89 flow
[2024-11-07 11:13:32,867 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=89, PETRI_PLACES=46, PETRI_TRANSITIONS=29}
[2024-11-07 11:13:32,868 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 9 predicate places.
[2024-11-07 11:13:32,868 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 29 transitions, 89 flow
[2024-11-07 11:13:32,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 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:13:32,868 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:13:32,869 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:13:32,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-07 11:13:32,869 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-07 11:13:32,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:13:32,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1388791588, now seen corresponding path program 2 times
[2024-11-07 11:13:32,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:13:32,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722567930]
[2024-11-07 11:13:32,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:13:32,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:13:32,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:13:33,482 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:13:33,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:13:33,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722567930]
[2024-11-07 11:13:33,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722567930] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:13:33,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:13:33,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 11:13:33,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288358299]
[2024-11-07 11:13:33,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:13:33,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 11:13:33,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:13:33,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 11:13:33,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-07 11:13:33,493 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 33
[2024-11-07 11:13:33,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 29 transitions, 89 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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:13:33,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:13:33,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 33
[2024-11-07 11:13:33,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:13:33,677 INFO L124 PetriNetUnfolderBase]: 67/183 cut-off events.
[2024-11-07 11:13:33,677 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES.
[2024-11-07 11:13:33,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 183 events. 67/183 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 631 event pairs, 35 based on Foata normal form. 4/175 useless extension candidates. Maximal degree in co-relation 372. Up to 77 conditions per place.
[2024-11-07 11:13:33,678 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 14 selfloop transitions, 2 changer transitions 17/47 dead transitions.
[2024-11-07 11:13:33,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 197 flow
[2024-11-07 11:13:33,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-07 11:13:33,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-07 11:13:33,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions.
[2024-11-07 11:13:33,680 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.553030303030303
[2024-11-07 11:13:33,680 INFO L175 Difference]: Start difference. First operand has 46 places, 29 transitions, 89 flow. Second operand 8 states and 146 transitions.
[2024-11-07 11:13:33,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 197 flow
[2024-11-07 11:13:33,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 184 flow, removed 5 selfloop flow, removed 5 redundant places.
[2024-11-07 11:13:33,682 INFO L231 Difference]: Finished difference. Result has 50 places, 29 transitions, 96 flow
[2024-11-07 11:13:33,682 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=96, PETRI_PLACES=50, PETRI_TRANSITIONS=29}
[2024-11-07 11:13:33,682 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 13 predicate places.
[2024-11-07 11:13:33,682 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 29 transitions, 96 flow
[2024-11-07 11:13:33,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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:13:33,682 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:13:33,683 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:13:33,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-07 11:13:33,683 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-07 11:13:33,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:13:33,685 INFO L85 PathProgramCache]: Analyzing trace with hash -676441766, now seen corresponding path program 3 times
[2024-11-07 11:13:33,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:13:33,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960116898]
[2024-11-07 11:13:33,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:13:33,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:13:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 11:13:33,747 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 11:13:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 11:13:33,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 11:13:33,849 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-07 11:13:33,850 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining)
[2024-11-07 11:13:33,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining)
[2024-11-07 11:13:33,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining)
[2024-11-07 11:13:33,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining)
[2024-11-07 11:13:33,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining)
[2024-11-07 11:13:33,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-07 11:13:33,853 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1]
[2024-11-07 11:13:33,922 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-07 11:13:33,923 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 11:13:33,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 11:13:33 BasicIcfg
[2024-11-07 11:13:33,927 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 11:13:33,927 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 11:13:33,928 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 11:13:33,928 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 11:13:33,928 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:13:29" (3/4) ...
[2024-11-07 11:13:33,929 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample
[2024-11-07 11:13:34,006 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-07 11:13:34,006 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 11:13:34,007 INFO L158 Benchmark]: Toolchain (without parser) took 5572.49ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 90.5MB in the beginning and 137.0MB in the end (delta: -46.6MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB.
[2024-11-07 11:13:34,007 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 11:13:34,007 INFO L158 Benchmark]: CACSL2BoogieTranslator took 514.17ms. Allocated memory is still 117.4MB. Free memory was 90.3MB in the beginning and 68.1MB in the end (delta: 22.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-07 11:13:34,007 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.97ms. Allocated memory is still 117.4MB. Free memory was 68.1MB in the beginning and 66.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 11:13:34,007 INFO L158 Benchmark]: Boogie Preprocessor took 44.40ms. Allocated memory is still 117.4MB. Free memory was 66.0MB in the beginning and 63.4MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 11:13:34,007 INFO L158 Benchmark]: RCFGBuilder took 648.63ms. Allocated memory is still 117.4MB. Free memory was 63.3MB in the beginning and 68.9MB in the end (delta: -5.6MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB.
[2024-11-07 11:13:34,008 INFO L158 Benchmark]: TraceAbstraction took 4232.26ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 68.4MB in the beginning and 147.4MB in the end (delta: -79.0MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB.
[2024-11-07 11:13:34,008 INFO L158 Benchmark]: Witness Printer took 78.37ms. Allocated memory is still 201.3MB. Free memory was 147.4MB in the beginning and 137.0MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 11:13:34,013 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.26ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 514.17ms. Allocated memory is still 117.4MB. Free memory was 90.3MB in the beginning and 68.1MB in the end (delta: 22.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 41.97ms. Allocated memory is still 117.4MB. Free memory was 68.1MB in the beginning and 66.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 44.40ms. Allocated memory is still 117.4MB. Free memory was 66.0MB in the beginning and 63.4MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 648.63ms. Allocated memory is still 117.4MB. Free memory was 63.3MB in the beginning and 68.9MB in the end (delta: -5.6MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB.
* TraceAbstraction took 4232.26ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 68.4MB in the beginning and 147.4MB in the end (delta: -79.0MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB.
* Witness Printer took 78.37ms. Allocated memory is still 201.3MB. Free memory was 147.4MB in the beginning and 137.0MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- CounterExampleResult [Line: 19]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
[L711] 0 int __unbuffered_p0_EAX = 0;
[L713] 0 int __unbuffered_p1_EAX = 0;
[L715] 0 int __unbuffered_p1_EBX = 0;
[L716] 0 _Bool main$tmp_guard0;
[L717] 0 _Bool main$tmp_guard1;
[L719] 0 int x = 0;
[L721] 0 int y = 0;
[L722] 0 _Bool y$flush_delayed;
[L723] 0 int y$mem_tmp;
[L724] 0 _Bool y$r_buff0_thd0;
[L725] 0 _Bool y$r_buff0_thd1;
[L726] 0 _Bool y$r_buff0_thd2;
[L727] 0 _Bool y$r_buff1_thd0;
[L728] 0 _Bool y$r_buff1_thd1;
[L729] 0 _Bool y$r_buff1_thd2;
[L730] 0 _Bool y$read_delayed;
[L731] 0 int *y$read_delayed_var;
[L732] 0 int y$w_buff0;
[L733] 0 _Bool y$w_buff0_used;
[L734] 0 int y$w_buff1;
[L735] 0 _Bool y$w_buff1_used;
[L737] 0 int z = 0;
[L738] 0 _Bool weak$$choice0;
[L739] 0 _Bool weak$$choice2;
[L815] 0 pthread_t t1649;
[L816] FCALL, FORK 0 pthread_create(&t1649, ((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, main$tmp_guard0=0, main$tmp_guard1=0, t1649=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L817] 0 pthread_t t1650;
[L818] FCALL, FORK 0 pthread_create(&t1650, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1649=-2, t1650=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L773] 2 y$w_buff1 = y$w_buff0
[L774] 2 y$w_buff0 = 1
[L775] 2 y$w_buff1_used = y$w_buff0_used
[L776] 2 y$w_buff0_used = (_Bool)1
[L777] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L19] COND FALSE 2 !(!expression)
[L777] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L778] 2 y$r_buff1_thd0 = y$r_buff0_thd0
[L779] 2 y$r_buff1_thd1 = y$r_buff0_thd1
[L780] 2 y$r_buff1_thd2 = y$r_buff0_thd2
[L781] 2 y$r_buff0_thd2 = (_Bool)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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L784] 2 z = 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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L787] 2 __unbuffered_p1_EAX = z
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L790] 2 __unbuffered_p1_EBX = x
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L743] 1 x = 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L748] 1 weak$$choice0 = __VERIFIER_nondet_bool()
[L749] 1 weak$$choice2 = __VERIFIER_nondet_bool()
[L750] 1 y$flush_delayed = weak$$choice2
[L751] 1 y$mem_tmp = y
[L752] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L753] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L754] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L755] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L756] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L757] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L758] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L759] 1 __unbuffered_p0_EAX = y
[L760] 1 y = y$flush_delayed ? y$mem_tmp : y
[L761] 1 y$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L793] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L794] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L795] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L796] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L797] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L766] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L820] 0 main$tmp_guard0 = __unbuffered_cnt == 2
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1649=-2, t1650=-1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L822] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L4] COND FALSE 0 !(!cond)
[L822] RET 0 assume_abort_if_not(main$tmp_guard0)
[L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1649=-2, t1650=-1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L831] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0)
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1649=-2, t1650=-1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L833] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L19] COND TRUE 0 !expression
VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L19] 0 reach_error()
VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
- UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: Not analyzed.
- UnprovableResult [Line: 818]: 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: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 5 procedures, 53 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 176 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 163 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 560 IncrementalHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 12 mSDtfsCounter, 560 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=5, InterpolantAutomatonStates: 41, 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.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 509 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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:13:34,041 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