./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 6497de01
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_003eb478-30dd-4c19-8763-f5484914fa35/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_003eb478-30dd-4c19-8763-f5484914fa35/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_003eb478-30dd-4c19-8763-f5484914fa35/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_003eb478-30dd-4c19-8763-f5484914fa35/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_003eb478-30dd-4c19-8763-f5484914fa35/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_003eb478-30dd-4c19-8763-f5484914fa35/bin/uautomizer-verify-LYvppIcaGC --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 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-6497de0
[2024-11-23 18:29:16,801 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-23 18:29:16,888 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_003eb478-30dd-4c19-8763-f5484914fa35/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-23 18:29:16,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-23 18:29:16,901 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-23 18:29:16,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-23 18:29:16,942 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-23 18:29:16,942 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-23 18:29:16,942 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-23 18:29:16,942 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-23 18:29:16,943 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-23 18:29:16,943 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-23 18:29:16,943 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-23 18:29:16,943 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-23 18:29:16,943 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-23 18:29:16,947 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-23 18:29:16,947 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-23 18:29:16,947 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-23 18:29:16,948 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-23 18:29:16,948 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-23 18:29:16,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-23 18:29:16,948 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-23 18:29:16,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-23 18:29:16,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-23 18:29:16,949 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-23 18:29:16,949 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-23 18:29:16,949 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-11-23 18:29:16,949 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-23 18:29:16,949 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-11-23 18:29:16,949 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-23 18:29:16,950 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-23 18:29:16,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-23 18:29:16,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-23 18:29:16,950 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-23 18:29:16,950 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-23 18:29:16,950 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-23 18:29:16,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-23 18:29:16,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-23 18:29:16,950 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-23 18:29:16,950 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-23 18:29:16,950 INFO L153 SettingsManager]: * Compute procedure contracts=false
[2024-11-23 18:29:16,951 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-23 18:29:16,951 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-23 18:29:16,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-23 18:29:16,951 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-23 18:29:16,951 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-23 18:29:16,951 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-23 18:29:16,951 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-23 18:29:16,951 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_003eb478-30dd-4c19-8763-f5484914fa35/bin/uautomizer-verify-LYvppIcaGC
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 -> 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576
[2024-11-23 18:29:17,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-23 18:29:17,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-23 18:29:17,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-23 18:29:17,271 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-23 18:29:17,271 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-23 18:29:17,272 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_003eb478-30dd-4c19-8763-f5484914fa35/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i
[2024-11-23 18:29:20,160 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_003eb478-30dd-4c19-8763-f5484914fa35/bin/uautomizer-verify-LYvppIcaGC/data/f8c741b68/18d2558b51f84a28a5be5582a47a8d00/FLAGcb8059a1f
[2024-11-23 18:29:20,526 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-23 18:29:20,527 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_003eb478-30dd-4c19-8763-f5484914fa35/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i
[2024-11-23 18:29:20,549 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_003eb478-30dd-4c19-8763-f5484914fa35/bin/uautomizer-verify-LYvppIcaGC/data/f8c741b68/18d2558b51f84a28a5be5582a47a8d00/FLAGcb8059a1f
[2024-11-23 18:29:20,568 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_003eb478-30dd-4c19-8763-f5484914fa35/bin/uautomizer-verify-LYvppIcaGC/data/f8c741b68/18d2558b51f84a28a5be5582a47a8d00
[2024-11-23 18:29:20,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-23 18:29:20,572 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-23 18:29:20,573 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-23 18:29:20,573 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-23 18:29:20,581 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-23 18:29:20,582 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:29:20" (1/1) ...
[2024-11-23 18:29:20,583 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@335382d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:29:20, skipping insertion in model container
[2024-11-23 18:29:20,583 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:29:20" (1/1) ...
[2024-11-23 18:29:20,629 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-23 18:29:20,810 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_003eb478-30dd-4c19-8763-f5484914fa35/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i[967,980]
[2024-11-23 18:29:21,034 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-23 18:29:21,043 INFO L200 MainTranslator]: Completed pre-run
[2024-11-23 18:29:21,053 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_003eb478-30dd-4c19-8763-f5484914fa35/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i[967,980]
[2024-11-23 18:29:21,103 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-23 18:29:21,139 INFO L204 MainTranslator]: Completed translation
[2024-11-23 18:29:21,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:29:21 WrapperNode
[2024-11-23 18:29:21,139 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-23 18:29:21,140 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-23 18:29:21,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-23 18:29:21,141 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-23 18:29:21,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:29:21" (1/1) ...
[2024-11-23 18:29:21,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:29:21" (1/1) ...
[2024-11-23 18:29:21,186 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132
[2024-11-23 18:29:21,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-23 18:29:21,187 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-23 18:29:21,187 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-23 18:29:21,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-23 18:29:21,200 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:29:21" (1/1) ...
[2024-11-23 18:29:21,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:29:21" (1/1) ...
[2024-11-23 18:29:21,206 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:29:21" (1/1) ...
[2024-11-23 18:29:21,225 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-23 18:29:21,225 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:29:21" (1/1) ...
[2024-11-23 18:29:21,225 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:29:21" (1/1) ...
[2024-11-23 18:29:21,233 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:29:21" (1/1) ...
[2024-11-23 18:29:21,234 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:29:21" (1/1) ...
[2024-11-23 18:29:21,236 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:29:21" (1/1) ...
[2024-11-23 18:29:21,239 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:29:21" (1/1) ...
[2024-11-23 18:29:21,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:29:21" (1/1) ...
[2024-11-23 18:29:21,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-23 18:29:21,243 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-23 18:29:21,243 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-23 18:29:21,243 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-23 18:29:21,244 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:29:21" (1/1) ...
[2024-11-23 18:29:21,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-23 18:29:21,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_003eb478-30dd-4c19-8763-f5484914fa35/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-23 18:29:21,290 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_003eb478-30dd-4c19-8763-f5484914fa35/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-23 18:29:21,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_003eb478-30dd-4c19-8763-f5484914fa35/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-23 18:29:21,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-23 18:29:21,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-23 18:29:21,323 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-11-23 18:29:21,323 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-11-23 18:29:21,324 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-11-23 18:29:21,324 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-11-23 18:29:21,324 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2024-11-23 18:29:21,324 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2024-11-23 18:29:21,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-23 18:29:21,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-23 18:29:21,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-23 18:29:21,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-23 18:29:21,326 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-11-23 18:29:21,493 INFO L234 CfgBuilder]: Building ICFG
[2024-11-23 18:29:21,495 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-23 18:29:21,892 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-23 18:29:21,892 INFO L283 CfgBuilder]: Performing block encoding
[2024-11-23 18:29:22,147 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-23 18:29:22,147 INFO L312 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-23 18:29:22,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:29:22 BoogieIcfgContainer
[2024-11-23 18:29:22,147 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-23 18:29:22,150 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-23 18:29:22,150 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-23 18:29:22,156 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-23 18:29:22,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:29:20" (1/3) ...
[2024-11-23 18:29:22,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb50a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:29:22, skipping insertion in model container
[2024-11-23 18:29:22,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:29:21" (2/3) ...
[2024-11-23 18:29:22,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb50a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:29:22, skipping insertion in model container
[2024-11-23 18:29:22,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:29:22" (3/3) ...
[2024-11-23 18:29:22,160 INFO L128 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i
[2024-11-23 18:29:22,176 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-23 18:29:22,178 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe030_power.opt_pso.opt_rmo.opt.i that has 4 procedures, 39 locations, 1 initial locations, 0 loop locations, and 2 error locations.
[2024-11-23 18:29:22,182 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-23 18:29:22,249 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-23 18:29:22,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow
[2024-11-23 18:29:22,335 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events.
[2024-11-23 18:29:22,337 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-23 18:29:22,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place.
[2024-11-23 18:29:22,342 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow
[2024-11-23 18:29:22,345 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow
[2024-11-23 18:29:22,356 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-23 18:29:22,375 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;@67d408d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-23 18:29:22,375 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-11-23 18:29:22,387 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-23 18:29:22,387 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events.
[2024-11-23 18:29:22,387 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-23 18:29:22,387 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-23 18:29:22,388 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-23 18:29:22,389 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-23 18:29:22,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 18:29:22,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1803674900, now seen corresponding path program 1 times
[2024-11-23 18:29:22,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 18:29:22,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326174736]
[2024-11-23 18:29:22,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-23 18:29:22,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 18:29:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-23 18:29:23,028 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-23 18:29:23,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-23 18:29:23,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326174736]
[2024-11-23 18:29:23,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326174736] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-23 18:29:23,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-23 18:29:23,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-23 18:29:23,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426160046]
[2024-11-23 18:29:23,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-23 18:29:23,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-23 18:29:23,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-23 18:29:23,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-23 18:29:23,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-23 18:29:23,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 39
[2024-11-23 18:29:23,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-23 18:29:23,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-23 18:29:23,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 39
[2024-11-23 18:29:23,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-23 18:29:23,365 INFO L124 PetriNetUnfolderBase]: 315/627 cut-off events.
[2024-11-23 18:29:23,365 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-23 18:29:23,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 627 events. 315/627 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3990 event pairs, 60 based on Foata normal form. 24/632 useless extension candidates. Maximal degree in co-relation 1139. Up to 382 conditions per place.
[2024-11-23 18:29:23,372 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 23 selfloop transitions, 2 changer transitions 2/43 dead transitions.
[2024-11-23 18:29:23,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 43 transitions, 149 flow
[2024-11-23 18:29:23,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-23 18:29:23,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-23 18:29:23,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions.
[2024-11-23 18:29:23,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7435897435897436
[2024-11-23 18:29:23,388 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 87 transitions.
[2024-11-23 18:29:23,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 43 transitions, 149 flow
[2024-11-23 18:29:23,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 146 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-11-23 18:29:23,395 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow
[2024-11-23 18:29:23,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=33}
[2024-11-23 18:29:23,403 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places.
[2024-11-23 18:29:23,404 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow
[2024-11-23 18:29:23,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-23 18:29:23,405 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-23 18:29:23,405 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-23 18:29:23,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-23 18:29:23,406 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-23 18:29:23,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 18:29:23,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1194542543, now seen corresponding path program 1 times
[2024-11-23 18:29:23,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 18:29:23,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068923321]
[2024-11-23 18:29:23,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-23 18:29:23,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 18:29:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-23 18:29:24,007 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-23 18:29:24,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-23 18:29:24,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068923321]
[2024-11-23 18:29:24,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068923321] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-23 18:29:24,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-23 18:29:24,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-23 18:29:24,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258563809]
[2024-11-23 18:29:24,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-23 18:29:24,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-23 18:29:24,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-23 18:29:24,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-23 18:29:24,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-23 18:29:24,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39
[2024-11-23 18:29:24,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 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-23 18:29:24,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-23 18:29:24,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39
[2024-11-23 18:29:24,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-23 18:29:24,683 INFO L124 PetriNetUnfolderBase]: 1047/1848 cut-off events.
[2024-11-23 18:29:24,683 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES.
[2024-11-23 18:29:24,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3602 conditions, 1848 events. 1047/1848 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11936 event pairs, 223 based on Foata normal form. 0/1777 useless extension candidates. Maximal degree in co-relation 3592. Up to 1012 conditions per place.
[2024-11-23 18:29:24,703 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 29 selfloop transitions, 3 changer transitions 40/84 dead transitions.
[2024-11-23 18:29:24,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 84 transitions, 338 flow
[2024-11-23 18:29:24,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-23 18:29:24,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-23 18:29:24,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions.
[2024-11-23 18:29:24,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6217948717948718
[2024-11-23 18:29:24,707 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 8 states and 194 transitions.
[2024-11-23 18:29:24,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 84 transitions, 338 flow
[2024-11-23 18:29:24,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 84 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-23 18:29:24,710 INFO L231 Difference]: Finished difference. Result has 52 places, 34 transitions, 105 flow
[2024-11-23 18:29:24,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=105, PETRI_PLACES=52, PETRI_TRANSITIONS=34}
[2024-11-23 18:29:24,713 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places.
[2024-11-23 18:29:24,713 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 105 flow
[2024-11-23 18:29:24,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 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-23 18:29:24,713 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-23 18:29:24,714 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-23 18:29:24,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-23 18:29:24,714 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-23 18:29:24,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 18:29:24,716 INFO L85 PathProgramCache]: Analyzing trace with hash -965906126, now seen corresponding path program 1 times
[2024-11-23 18:29:24,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 18:29:24,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732683842]
[2024-11-23 18:29:24,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-23 18:29:24,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 18:29:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-23 18:29:25,095 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-23 18:29:25,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-23 18:29:25,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732683842]
[2024-11-23 18:29:25,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732683842] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-23 18:29:25,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-23 18:29:25,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-23 18:29:25,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314264857]
[2024-11-23 18:29:25,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-23 18:29:25,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-23 18:29:25,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-23 18:29:25,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-23 18:29:25,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-23 18:29:25,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39
[2024-11-23 18:29:25,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 105 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 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-23 18:29:25,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-23 18:29:25,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39
[2024-11-23 18:29:25,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-23 18:29:25,664 INFO L124 PetriNetUnfolderBase]: 1055/1849 cut-off events.
[2024-11-23 18:29:25,664 INFO L125 PetriNetUnfolderBase]: For 888/888 co-relation queries the response was YES.
[2024-11-23 18:29:25,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4243 conditions, 1849 events. 1055/1849 cut-off events. For 888/888 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 11667 event pairs, 416 based on Foata normal form. 60/1855 useless extension candidates. Maximal degree in co-relation 4228. Up to 1157 conditions per place.
[2024-11-23 18:29:25,678 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 29 selfloop transitions, 3 changer transitions 29/75 dead transitions.
[2024-11-23 18:29:25,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 75 transitions, 323 flow
[2024-11-23 18:29:25,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-23 18:29:25,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-23 18:29:25,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions.
[2024-11-23 18:29:25,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154
[2024-11-23 18:29:25,682 INFO L175 Difference]: Start difference. First operand has 52 places, 34 transitions, 105 flow. Second operand 7 states and 168 transitions.
[2024-11-23 18:29:25,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 75 transitions, 323 flow
[2024-11-23 18:29:25,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 75 transitions, 312 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-11-23 18:29:25,694 INFO L231 Difference]: Finished difference. Result has 54 places, 36 transitions, 133 flow
[2024-11-23 18:29:25,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=133, PETRI_PLACES=54, PETRI_TRANSITIONS=36}
[2024-11-23 18:29:25,696 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 9 predicate places.
[2024-11-23 18:29:25,696 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 36 transitions, 133 flow
[2024-11-23 18:29:25,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 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-23 18:29:25,696 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-23 18:29:25,696 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-23 18:29:25,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-23 18:29:25,697 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-23 18:29:25,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 18:29:25,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1074813900, now seen corresponding path program 1 times
[2024-11-23 18:29:25,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 18:29:25,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406756547]
[2024-11-23 18:29:25,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-23 18:29:25,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 18:29:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-23 18:29:26,661 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-23 18:29:26,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-23 18:29:26,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406756547]
[2024-11-23 18:29:26,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406756547] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-23 18:29:26,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-23 18:29:26,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-23 18:29:26,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25207900]
[2024-11-23 18:29:26,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-23 18:29:26,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-23 18:29:26,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-23 18:29:26,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-23 18:29:26,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-23 18:29:26,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39
[2024-11-23 18:29:26,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 36 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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-23 18:29:26,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-23 18:29:26,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39
[2024-11-23 18:29:26,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-23 18:29:27,647 INFO L124 PetriNetUnfolderBase]: 2020/3523 cut-off events.
[2024-11-23 18:29:27,648 INFO L125 PetriNetUnfolderBase]: For 4551/4551 co-relation queries the response was YES.
[2024-11-23 18:29:27,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9666 conditions, 3523 events. 2020/3523 cut-off events. For 4551/4551 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 24325 event pairs, 511 based on Foata normal form. 99/3600 useless extension candidates. Maximal degree in co-relation 9647. Up to 1729 conditions per place.
[2024-11-23 18:29:27,673 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 35 selfloop transitions, 13 changer transitions 43/101 dead transitions.
[2024-11-23 18:29:27,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 101 transitions, 604 flow
[2024-11-23 18:29:27,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-23 18:29:27,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-23 18:29:27,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions.
[2024-11-23 18:29:27,679 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6483516483516484
[2024-11-23 18:29:27,679 INFO L175 Difference]: Start difference. First operand has 54 places, 36 transitions, 133 flow. Second operand 7 states and 177 transitions.
[2024-11-23 18:29:27,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 101 transitions, 604 flow
[2024-11-23 18:29:27,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 101 transitions, 588 flow, removed 6 selfloop flow, removed 3 redundant places.
[2024-11-23 18:29:27,702 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 290 flow
[2024-11-23 18:29:27,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=290, PETRI_PLACES=59, PETRI_TRANSITIONS=47}
[2024-11-23 18:29:27,703 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places.
[2024-11-23 18:29:27,703 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 290 flow
[2024-11-23 18:29:27,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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-23 18:29:27,704 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-23 18:29:27,704 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-23 18:29:27,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-23 18:29:27,705 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-23 18:29:27,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 18:29:27,705 INFO L85 PathProgramCache]: Analyzing trace with hash -584189772, now seen corresponding path program 2 times
[2024-11-23 18:29:27,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 18:29:27,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789561173]
[2024-11-23 18:29:27,706 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-23 18:29:27,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 18:29:27,727 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-23 18:29:27,727 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-23 18:29:27,940 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-23 18:29:27,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-23 18:29:27,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789561173]
[2024-11-23 18:29:27,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789561173] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-23 18:29:27,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-23 18:29:27,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-23 18:29:27,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046241233]
[2024-11-23 18:29:27,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-23 18:29:27,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-23 18:29:27,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-23 18:29:27,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-23 18:29:27,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-23 18:29:27,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39
[2024-11-23 18:29:27,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 290 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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-23 18:29:27,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-23 18:29:27,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39
[2024-11-23 18:29:27,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-23 18:29:28,873 INFO L124 PetriNetUnfolderBase]: 2066/3784 cut-off events.
[2024-11-23 18:29:28,874 INFO L125 PetriNetUnfolderBase]: For 10493/10533 co-relation queries the response was YES.
[2024-11-23 18:29:28,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13345 conditions, 3784 events. 2066/3784 cut-off events. For 10493/10533 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 28127 event pairs, 684 based on Foata normal form. 109/3793 useless extension candidates. Maximal degree in co-relation 13321. Up to 1331 conditions per place.
[2024-11-23 18:29:28,911 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 43 selfloop transitions, 6 changer transitions 39/105 dead transitions.
[2024-11-23 18:29:28,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 105 transitions, 808 flow
[2024-11-23 18:29:28,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-23 18:29:28,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-23 18:29:28,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions.
[2024-11-23 18:29:28,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.63003663003663
[2024-11-23 18:29:28,914 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 290 flow. Second operand 7 states and 172 transitions.
[2024-11-23 18:29:28,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 105 transitions, 808 flow
[2024-11-23 18:29:28,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 105 transitions, 742 flow, removed 6 selfloop flow, removed 2 redundant places.
[2024-11-23 18:29:28,928 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 288 flow
[2024-11-23 18:29:28,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=288, PETRI_PLACES=64, PETRI_TRANSITIONS=47}
[2024-11-23 18:29:28,931 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 19 predicate places.
[2024-11-23 18:29:28,932 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 288 flow
[2024-11-23 18:29:28,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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-23 18:29:28,934 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-23 18:29:28,934 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-23 18:29:28,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-23 18:29:28,934 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-23 18:29:28,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 18:29:28,935 INFO L85 PathProgramCache]: Analyzing trace with hash -474902029, now seen corresponding path program 1 times
[2024-11-23 18:29:28,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 18:29:28,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493606130]
[2024-11-23 18:29:28,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-23 18:29:28,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 18:29:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-23 18:29:29,595 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-23 18:29:29,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-23 18:29:29,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493606130]
[2024-11-23 18:29:29,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493606130] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-23 18:29:29,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-23 18:29:29,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-23 18:29:29,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597522307]
[2024-11-23 18:29:29,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-23 18:29:29,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-23 18:29:29,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-23 18:29:29,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-23 18:29:29,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-23 18:29:29,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39
[2024-11-23 18:29:29,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 288 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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-23 18:29:29,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-23 18:29:29,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39
[2024-11-23 18:29:29,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-23 18:29:30,579 INFO L124 PetriNetUnfolderBase]: 2514/4573 cut-off events.
[2024-11-23 18:29:30,580 INFO L125 PetriNetUnfolderBase]: For 18568/18665 co-relation queries the response was YES.
[2024-11-23 18:29:30,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16005 conditions, 4573 events. 2514/4573 cut-off events. For 18568/18665 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 34342 event pairs, 861 based on Foata normal form. 167/4596 useless extension candidates. Maximal degree in co-relation 15977. Up to 2803 conditions per place.
[2024-11-23 18:29:30,634 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 29 selfloop transitions, 4 changer transitions 31/88 dead transitions.
[2024-11-23 18:29:30,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 88 transitions, 608 flow
[2024-11-23 18:29:30,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-23 18:29:30,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-23 18:29:30,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions.
[2024-11-23 18:29:30,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6007326007326007
[2024-11-23 18:29:30,639 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 288 flow. Second operand 7 states and 164 transitions.
[2024-11-23 18:29:30,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 88 transitions, 608 flow
[2024-11-23 18:29:30,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 88 transitions, 578 flow, removed 12 selfloop flow, removed 5 redundant places.
[2024-11-23 18:29:30,690 INFO L231 Difference]: Finished difference. Result has 66 places, 50 transitions, 320 flow
[2024-11-23 18:29:30,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=320, PETRI_PLACES=66, PETRI_TRANSITIONS=50}
[2024-11-23 18:29:30,691 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 21 predicate places.
[2024-11-23 18:29:30,691 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 50 transitions, 320 flow
[2024-11-23 18:29:30,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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-23 18:29:30,691 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-23 18:29:30,691 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-23 18:29:30,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-23 18:29:30,691 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-23 18:29:30,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 18:29:30,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1874647077, now seen corresponding path program 1 times
[2024-11-23 18:29:30,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 18:29:30,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864780343]
[2024-11-23 18:29:30,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-23 18:29:30,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 18:29:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-23 18:29:31,073 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-23 18:29:31,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-23 18:29:31,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864780343]
[2024-11-23 18:29:31,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864780343] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-23 18:29:31,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-23 18:29:31,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-23 18:29:31,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292823703]
[2024-11-23 18:29:31,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-23 18:29:31,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-23 18:29:31,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-23 18:29:31,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-23 18:29:31,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-23 18:29:31,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39
[2024-11-23 18:29:31,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 50 transitions, 320 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 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-23 18:29:31,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-23 18:29:31,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39
[2024-11-23 18:29:31,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-23 18:29:31,977 INFO L124 PetriNetUnfolderBase]: 2389/4346 cut-off events.
[2024-11-23 18:29:31,977 INFO L125 PetriNetUnfolderBase]: For 19074/19119 co-relation queries the response was YES.
[2024-11-23 18:29:31,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16661 conditions, 4346 events. 2389/4346 cut-off events. For 19074/19119 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 32682 event pairs, 399 based on Foata normal form. 124/4342 useless extension candidates. Maximal degree in co-relation 16631. Up to 2399 conditions per place.
[2024-11-23 18:29:32,018 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 36 selfloop transitions, 10 changer transitions 31/101 dead transitions.
[2024-11-23 18:29:32,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 101 transitions, 778 flow
[2024-11-23 18:29:32,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-23 18:29:32,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-23 18:29:32,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions.
[2024-11-23 18:29:32,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6025641025641025
[2024-11-23 18:29:32,020 INFO L175 Difference]: Start difference. First operand has 66 places, 50 transitions, 320 flow. Second operand 8 states and 188 transitions.
[2024-11-23 18:29:32,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 101 transitions, 778 flow
[2024-11-23 18:29:32,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 101 transitions, 762 flow, removed 6 selfloop flow, removed 3 redundant places.
[2024-11-23 18:29:32,051 INFO L231 Difference]: Finished difference. Result has 71 places, 54 transitions, 391 flow
[2024-11-23 18:29:32,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=391, PETRI_PLACES=71, PETRI_TRANSITIONS=54}
[2024-11-23 18:29:32,051 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 26 predicate places.
[2024-11-23 18:29:32,052 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 54 transitions, 391 flow
[2024-11-23 18:29:32,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 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-23 18:29:32,052 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-23 18:29:32,052 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-23 18:29:32,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-23 18:29:32,052 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-23 18:29:32,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 18:29:32,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1356959317, now seen corresponding path program 2 times
[2024-11-23 18:29:32,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 18:29:32,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382125835]
[2024-11-23 18:29:32,053 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-23 18:29:32,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 18:29:32,095 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-23 18:29:32,095 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-23 18:29:32,618 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-23 18:29:32,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-23 18:29:32,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382125835]
[2024-11-23 18:29:32,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382125835] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-23 18:29:32,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-23 18:29:32,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-23 18:29:32,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484075388]
[2024-11-23 18:29:32,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-23 18:29:32,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-23 18:29:32,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-23 18:29:32,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-23 18:29:32,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-11-23 18:29:32,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39
[2024-11-23 18:29:32,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 54 transitions, 391 flow. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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-23 18:29:32,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-23 18:29:32,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39
[2024-11-23 18:29:32,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-23 18:29:33,646 INFO L124 PetriNetUnfolderBase]: 2239/4120 cut-off events.
[2024-11-23 18:29:33,646 INFO L125 PetriNetUnfolderBase]: For 22325/22388 co-relation queries the response was YES.
[2024-11-23 18:29:33,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16569 conditions, 4120 events. 2239/4120 cut-off events. For 22325/22388 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 30393 event pairs, 394 based on Foata normal form. 131/4142 useless extension candidates. Maximal degree in co-relation 16535. Up to 2337 conditions per place.
[2024-11-23 18:29:33,692 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 35 selfloop transitions, 7 changer transitions 32/98 dead transitions.
[2024-11-23 18:29:33,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 98 transitions, 809 flow
[2024-11-23 18:29:33,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-23 18:29:33,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-23 18:29:33,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 184 transitions.
[2024-11-23 18:29:33,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898
[2024-11-23 18:29:33,694 INFO L175 Difference]: Start difference. First operand has 71 places, 54 transitions, 391 flow. Second operand 8 states and 184 transitions.
[2024-11-23 18:29:33,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 98 transitions, 809 flow
[2024-11-23 18:29:33,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 98 transitions, 750 flow, removed 24 selfloop flow, removed 5 redundant places.
[2024-11-23 18:29:33,753 INFO L231 Difference]: Finished difference. Result has 74 places, 53 transitions, 371 flow
[2024-11-23 18:29:33,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=371, PETRI_PLACES=74, PETRI_TRANSITIONS=53}
[2024-11-23 18:29:33,756 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places.
[2024-11-23 18:29:33,756 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 53 transitions, 371 flow
[2024-11-23 18:29:33,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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-23 18:29:33,756 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-23 18:29:33,756 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-23 18:29:33,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-23 18:29:33,757 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-23 18:29:33,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 18:29:33,757 INFO L85 PathProgramCache]: Analyzing trace with hash 149705955, now seen corresponding path program 1 times
[2024-11-23 18:29:33,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 18:29:33,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952522416]
[2024-11-23 18:29:33,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-23 18:29:33,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 18:29:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-23 18:29:34,008 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-23 18:29:34,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-23 18:29:34,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952522416]
[2024-11-23 18:29:34,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952522416] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-23 18:29:34,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-23 18:29:34,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-23 18:29:34,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270619794]
[2024-11-23 18:29:34,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-23 18:29:34,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-23 18:29:34,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-23 18:29:34,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-23 18:29:34,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-23 18:29:34,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39
[2024-11-23 18:29:34,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 53 transitions, 371 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 18:29:34,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-23 18:29:34,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39
[2024-11-23 18:29:34,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-23 18:29:35,073 INFO L124 PetriNetUnfolderBase]: 3144/5917 cut-off events.
[2024-11-23 18:29:35,073 INFO L125 PetriNetUnfolderBase]: For 31165/31271 co-relation queries the response was YES.
[2024-11-23 18:29:35,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22471 conditions, 5917 events. 3144/5917 cut-off events. For 31165/31271 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 49104 event pairs, 1191 based on Foata normal form. 190/5883 useless extension candidates. Maximal degree in co-relation 22435. Up to 2106 conditions per place.
[2024-11-23 18:29:35,125 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 41 selfloop transitions, 5 changer transitions 34/99 dead transitions.
[2024-11-23 18:29:35,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 99 transitions, 825 flow
[2024-11-23 18:29:35,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-23 18:29:35,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-23 18:29:35,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions.
[2024-11-23 18:29:35,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5970695970695971
[2024-11-23 18:29:35,127 INFO L175 Difference]: Start difference. First operand has 74 places, 53 transitions, 371 flow. Second operand 7 states and 163 transitions.
[2024-11-23 18:29:35,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 99 transitions, 825 flow
[2024-11-23 18:29:35,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 99 transitions, 779 flow, removed 18 selfloop flow, removed 6 redundant places.
[2024-11-23 18:29:35,198 INFO L231 Difference]: Finished difference. Result has 75 places, 52 transitions, 362 flow
[2024-11-23 18:29:35,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=362, PETRI_PLACES=75, PETRI_TRANSITIONS=52}
[2024-11-23 18:29:35,199 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 30 predicate places.
[2024-11-23 18:29:35,199 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 52 transitions, 362 flow
[2024-11-23 18:29:35,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 18:29:35,200 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-23 18:29:35,200 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-23 18:29:35,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-23 18:29:35,200 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-23 18:29:35,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 18:29:35,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1644694731, now seen corresponding path program 1 times
[2024-11-23 18:29:35,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 18:29:35,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959769229]
[2024-11-23 18:29:35,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-23 18:29:35,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 18:29:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-23 18:29:35,758 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-23 18:29:35,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-23 18:29:35,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959769229]
[2024-11-23 18:29:35,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959769229] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-23 18:29:35,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-23 18:29:35,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-23 18:29:35,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762826496]
[2024-11-23 18:29:35,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-23 18:29:35,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-23 18:29:35,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-23 18:29:35,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-23 18:29:35,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-23 18:29:35,770 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39
[2024-11-23 18:29:35,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 52 transitions, 362 flow. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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-23 18:29:35,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-23 18:29:35,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39
[2024-11-23 18:29:35,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-23 18:29:36,814 INFO L124 PetriNetUnfolderBase]: 3251/6162 cut-off events.
[2024-11-23 18:29:36,814 INFO L125 PetriNetUnfolderBase]: For 33666/33769 co-relation queries the response was YES.
[2024-11-23 18:29:36,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23162 conditions, 6162 events. 3251/6162 cut-off events. For 33666/33769 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 51003 event pairs, 1205 based on Foata normal form. 237/6188 useless extension candidates. Maximal degree in co-relation 23126. Up to 3740 conditions per place.
[2024-11-23 18:29:36,848 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 37 selfloop transitions, 9 changer transitions 27/97 dead transitions.
[2024-11-23 18:29:36,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 97 transitions, 775 flow
[2024-11-23 18:29:36,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-23 18:29:36,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-23 18:29:36,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 184 transitions.
[2024-11-23 18:29:36,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898
[2024-11-23 18:29:36,850 INFO L175 Difference]: Start difference. First operand has 75 places, 52 transitions, 362 flow. Second operand 8 states and 184 transitions.
[2024-11-23 18:29:36,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 97 transitions, 775 flow
[2024-11-23 18:29:36,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 97 transitions, 746 flow, removed 12 selfloop flow, removed 5 redundant places.
[2024-11-23 18:29:36,925 INFO L231 Difference]: Finished difference. Result has 79 places, 60 transitions, 467 flow
[2024-11-23 18:29:36,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=467, PETRI_PLACES=79, PETRI_TRANSITIONS=60}
[2024-11-23 18:29:36,926 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 34 predicate places.
[2024-11-23 18:29:36,926 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 60 transitions, 467 flow
[2024-11-23 18:29:36,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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-23 18:29:36,926 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-23 18:29:36,926 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-23 18:29:36,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-23 18:29:36,927 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-23 18:29:36,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 18:29:36,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1790569789, now seen corresponding path program 2 times
[2024-11-23 18:29:36,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 18:29:36,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393227138]
[2024-11-23 18:29:36,927 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-23 18:29:36,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 18:29:36,968 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-23 18:29:36,968 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-23 18:29:37,078 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-23 18:29:37,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-23 18:29:37,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393227138]
[2024-11-23 18:29:37,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393227138] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-23 18:29:37,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-23 18:29:37,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-23 18:29:37,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623565715]
[2024-11-23 18:29:37,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-23 18:29:37,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-23 18:29:37,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-23 18:29:37,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-23 18:29:37,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-23 18:29:37,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39
[2024-11-23 18:29:37,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 60 transitions, 467 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 18:29:37,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-23 18:29:37,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39
[2024-11-23 18:29:37,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-23 18:29:38,175 INFO L124 PetriNetUnfolderBase]: 5709/9609 cut-off events.
[2024-11-23 18:29:38,175 INFO L125 PetriNetUnfolderBase]: For 38505/38912 co-relation queries the response was YES.
[2024-11-23 18:29:38,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33422 conditions, 9609 events. 5709/9609 cut-off events. For 38505/38912 co-relation queries the response was YES. Maximal size of possible extension queue 578. Compared 71500 event pairs, 981 based on Foata normal form. 696/10085 useless extension candidates. Maximal degree in co-relation 33383. Up to 5001 conditions per place.
[2024-11-23 18:29:38,241 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 66 selfloop transitions, 5 changer transitions 0/96 dead transitions.
[2024-11-23 18:29:38,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 96 transitions, 854 flow
[2024-11-23 18:29:38,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-23 18:29:38,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-23 18:29:38,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions.
[2024-11-23 18:29:38,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666
[2024-11-23 18:29:38,244 INFO L175 Difference]: Start difference. First operand has 79 places, 60 transitions, 467 flow. Second operand 4 states and 104 transitions.
[2024-11-23 18:29:38,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 96 transitions, 854 flow
[2024-11-23 18:29:38,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 96 transitions, 817 flow, removed 13 selfloop flow, removed 3 redundant places.
[2024-11-23 18:29:38,305 INFO L231 Difference]: Finished difference. Result has 77 places, 63 transitions, 471 flow
[2024-11-23 18:29:38,305 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=471, PETRI_PLACES=77, PETRI_TRANSITIONS=63}
[2024-11-23 18:29:38,307 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 32 predicate places.
[2024-11-23 18:29:38,307 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 63 transitions, 471 flow
[2024-11-23 18:29:38,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 18:29:38,308 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-23 18:29:38,308 INFO L206 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]
[2024-11-23 18:29:38,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-23 18:29:38,308 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-23 18:29:38,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 18:29:38,309 INFO L85 PathProgramCache]: Analyzing trace with hash 346236268, now seen corresponding path program 1 times
[2024-11-23 18:29:38,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 18:29:38,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622327873]
[2024-11-23 18:29:38,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-23 18:29:38,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 18:29:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-23 18:29:39,039 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-23 18:29:39,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-23 18:29:39,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622327873]
[2024-11-23 18:29:39,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622327873] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-23 18:29:39,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-23 18:29:39,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-23 18:29:39,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018035606]
[2024-11-23 18:29:39,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-23 18:29:39,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-23 18:29:39,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-23 18:29:39,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-23 18:29:39,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-23 18:29:39,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39
[2024-11-23 18:29:39,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 63 transitions, 471 flow. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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-23 18:29:39,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-23 18:29:39,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39
[2024-11-23 18:29:39,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-23 18:29:40,199 INFO L124 PetriNetUnfolderBase]: 3720/6889 cut-off events.
[2024-11-23 18:29:40,200 INFO L125 PetriNetUnfolderBase]: For 29201/29535 co-relation queries the response was YES.
[2024-11-23 18:29:40,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26442 conditions, 6889 events. 3720/6889 cut-off events. For 29201/29535 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 55758 event pairs, 1766 based on Foata normal form. 91/6446 useless extension candidates. Maximal degree in co-relation 26402. Up to 4885 conditions per place.
[2024-11-23 18:29:40,259 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 36 selfloop transitions, 12 changer transitions 21/97 dead transitions.
[2024-11-23 18:29:40,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 97 transitions, 863 flow
[2024-11-23 18:29:40,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-23 18:29:40,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-23 18:29:40,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions.
[2024-11-23 18:29:40,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154
[2024-11-23 18:29:40,261 INFO L175 Difference]: Start difference. First operand has 77 places, 63 transitions, 471 flow. Second operand 6 states and 144 transitions.
[2024-11-23 18:29:40,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 97 transitions, 863 flow
[2024-11-23 18:29:40,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 97 transitions, 839 flow, removed 11 selfloop flow, removed 3 redundant places.
[2024-11-23 18:29:40,316 INFO L231 Difference]: Finished difference. Result has 82 places, 68 transitions, 554 flow
[2024-11-23 18:29:40,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=554, PETRI_PLACES=82, PETRI_TRANSITIONS=68}
[2024-11-23 18:29:40,319 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 37 predicate places.
[2024-11-23 18:29:40,319 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 68 transitions, 554 flow
[2024-11-23 18:29:40,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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-23 18:29:40,320 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-23 18:29:40,320 INFO L206 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]
[2024-11-23 18:29:40,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-23 18:29:40,320 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-23 18:29:40,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 18:29:40,321 INFO L85 PathProgramCache]: Analyzing trace with hash 2072144776, now seen corresponding path program 1 times
[2024-11-23 18:29:40,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 18:29:40,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465892091]
[2024-11-23 18:29:40,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-23 18:29:40,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 18:29:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-23 18:29:40,527 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-23 18:29:40,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-23 18:29:40,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465892091]
[2024-11-23 18:29:40,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465892091] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-23 18:29:40,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-23 18:29:40,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-23 18:29:40,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798128328]
[2024-11-23 18:29:40,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-23 18:29:40,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-23 18:29:40,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-23 18:29:40,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-23 18:29:40,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-23 18:29:40,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39
[2024-11-23 18:29:40,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 68 transitions, 554 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-23 18:29:40,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-23 18:29:40,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39
[2024-11-23 18:29:40,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-23 18:29:41,471 INFO L124 PetriNetUnfolderBase]: 4292/7182 cut-off events.
[2024-11-23 18:29:41,471 INFO L125 PetriNetUnfolderBase]: For 29133/30046 co-relation queries the response was YES.
[2024-11-23 18:29:41,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26314 conditions, 7182 events. 4292/7182 cut-off events. For 29133/30046 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 50896 event pairs, 434 based on Foata normal form. 637/7553 useless extension candidates. Maximal degree in co-relation 26272. Up to 2608 conditions per place.
[2024-11-23 18:29:41,541 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 64 selfloop transitions, 8 changer transitions 5/100 dead transitions.
[2024-11-23 18:29:41,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 100 transitions, 897 flow
[2024-11-23 18:29:41,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-23 18:29:41,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-23 18:29:41,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions.
[2024-11-23 18:29:41,543 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.676923076923077
[2024-11-23 18:29:41,543 INFO L175 Difference]: Start difference. First operand has 82 places, 68 transitions, 554 flow. Second operand 5 states and 132 transitions.
[2024-11-23 18:29:41,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 100 transitions, 897 flow
[2024-11-23 18:29:41,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 100 transitions, 806 flow, removed 24 selfloop flow, removed 8 redundant places.
[2024-11-23 18:29:41,591 INFO L231 Difference]: Finished difference. Result has 78 places, 61 transitions, 440 flow
[2024-11-23 18:29:41,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=440, PETRI_PLACES=78, PETRI_TRANSITIONS=61}
[2024-11-23 18:29:41,592 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 33 predicate places.
[2024-11-23 18:29:41,592 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 61 transitions, 440 flow
[2024-11-23 18:29:41,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-23 18:29:41,592 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-23 18:29:41,592 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-23 18:29:41,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-11-23 18:29:41,593 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-23 18:29:41,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 18:29:41,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1861499637, now seen corresponding path program 1 times
[2024-11-23 18:29:41,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 18:29:41,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869063755]
[2024-11-23 18:29:41,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-23 18:29:41,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 18:29:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-23 18:29:42,616 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-23 18:29:42,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-23 18:29:42,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869063755]
[2024-11-23 18:29:42,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869063755] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-23 18:29:42,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-23 18:29:42,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-23 18:29:42,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995941880]
[2024-11-23 18:29:42,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-23 18:29:42,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-23 18:29:42,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-23 18:29:42,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-23 18:29:42,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-11-23 18:29:42,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39
[2024-11-23 18:29:42,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 61 transitions, 440 flow. Second operand has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 9 states have internal predecessors, (159), 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-23 18:29:42,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-23 18:29:42,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39
[2024-11-23 18:29:42,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-23 18:29:43,595 INFO L124 PetriNetUnfolderBase]: 2592/5093 cut-off events.
[2024-11-23 18:29:43,596 INFO L125 PetriNetUnfolderBase]: For 16762/17662 co-relation queries the response was YES.
[2024-11-23 18:29:43,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18912 conditions, 5093 events. 2592/5093 cut-off events. For 16762/17662 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 41251 event pairs, 854 based on Foata normal form. 164/4791 useless extension candidates. Maximal degree in co-relation 18873. Up to 3143 conditions per place.
[2024-11-23 18:29:43,652 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 31 selfloop transitions, 13 changer transitions 21/96 dead transitions.
[2024-11-23 18:29:43,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 96 transitions, 764 flow
[2024-11-23 18:29:43,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-23 18:29:43,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-11-23 18:29:43,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 200 transitions.
[2024-11-23 18:29:43,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5698005698005698
[2024-11-23 18:29:43,654 INFO L175 Difference]: Start difference. First operand has 78 places, 61 transitions, 440 flow. Second operand 9 states and 200 transitions.
[2024-11-23 18:29:43,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 96 transitions, 764 flow
[2024-11-23 18:29:43,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 96 transitions, 748 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-11-23 18:29:43,713 INFO L231 Difference]: Finished difference. Result has 87 places, 65 transitions, 522 flow
[2024-11-23 18:29:43,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=522, PETRI_PLACES=87, PETRI_TRANSITIONS=65}
[2024-11-23 18:29:43,713 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 42 predicate places.
[2024-11-23 18:29:43,714 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 65 transitions, 522 flow
[2024-11-23 18:29:43,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 9 states have internal predecessors, (159), 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-23 18:29:43,714 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-23 18:29:43,714 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-23 18:29:43,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-11-23 18:29:43,714 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-23 18:29:43,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 18:29:43,715 INFO L85 PathProgramCache]: Analyzing trace with hash -2011057043, now seen corresponding path program 2 times
[2024-11-23 18:29:43,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 18:29:43,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706953977]
[2024-11-23 18:29:43,715 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-23 18:29:43,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 18:29:43,764 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-23 18:29:43,764 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-23 18:29:43,939 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-23 18:29:43,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-23 18:29:43,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706953977]
[2024-11-23 18:29:43,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706953977] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-23 18:29:43,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-23 18:29:43,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-23 18:29:43,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10155261]
[2024-11-23 18:29:43,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-23 18:29:43,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-23 18:29:43,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-23 18:29:43,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-23 18:29:43,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-23 18:29:43,956 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39
[2024-11-23 18:29:43,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 65 transitions, 522 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 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-23 18:29:43,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-23 18:29:43,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39
[2024-11-23 18:29:43,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-23 18:29:45,093 INFO L124 PetriNetUnfolderBase]: 3679/6169 cut-off events.
[2024-11-23 18:29:45,094 INFO L125 PetriNetUnfolderBase]: For 34392/35490 co-relation queries the response was YES.
[2024-11-23 18:29:45,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25062 conditions, 6169 events. 3679/6169 cut-off events. For 34392/35490 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 43676 event pairs, 396 based on Foata normal form. 566/6469 useless extension candidates. Maximal degree in co-relation 25020. Up to 2588 conditions per place.
[2024-11-23 18:29:45,161 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 43 selfloop transitions, 11 changer transitions 36/105 dead transitions.
[2024-11-23 18:29:45,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 105 transitions, 989 flow
[2024-11-23 18:29:45,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-23 18:29:45,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-23 18:29:45,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions.
[2024-11-23 18:29:45,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6239316239316239
[2024-11-23 18:29:45,164 INFO L175 Difference]: Start difference. First operand has 87 places, 65 transitions, 522 flow. Second operand 6 states and 146 transitions.
[2024-11-23 18:29:45,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 105 transitions, 989 flow
[2024-11-23 18:29:45,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 105 transitions, 825 flow, removed 64 selfloop flow, removed 14 redundant places.
[2024-11-23 18:29:45,240 INFO L231 Difference]: Finished difference. Result has 76 places, 49 transitions, 332 flow
[2024-11-23 18:29:45,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=332, PETRI_PLACES=76, PETRI_TRANSITIONS=49}
[2024-11-23 18:29:45,240 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 31 predicate places.
[2024-11-23 18:29:45,240 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 49 transitions, 332 flow
[2024-11-23 18:29:45,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 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-23 18:29:45,241 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-23 18:29:45,241 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-23 18:29:45,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-11-23 18:29:45,241 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-23 18:29:45,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 18:29:45,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1560816879, now seen corresponding path program 1 times
[2024-11-23 18:29:45,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 18:29:45,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873845153]
[2024-11-23 18:29:45,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-23 18:29:45,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 18:29:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-23 18:29:46,609 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-23 18:29:46,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-23 18:29:46,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873845153]
[2024-11-23 18:29:46,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873845153] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-23 18:29:46,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-23 18:29:46,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-11-23 18:29:46,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891730976]
[2024-11-23 18:29:46,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-23 18:29:46,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-23 18:29:46,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-23 18:29:46,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-23 18:29:46,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-11-23 18:29:46,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39
[2024-11-23 18:29:46,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 49 transitions, 332 flow. Second operand has 10 states, 10 states have (on average 17.6) internal successors, (176), 10 states have internal predecessors, (176), 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-23 18:29:46,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-23 18:29:46,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39
[2024-11-23 18:29:46,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-23 18:29:47,098 INFO L124 PetriNetUnfolderBase]: 495/1031 cut-off events.
[2024-11-23 18:29:47,098 INFO L125 PetriNetUnfolderBase]: For 2741/2929 co-relation queries the response was YES.
[2024-11-23 18:29:47,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3455 conditions, 1031 events. 495/1031 cut-off events. For 2741/2929 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 6306 event pairs, 139 based on Foata normal form. 27/934 useless extension candidates. Maximal degree in co-relation 3422. Up to 381 conditions per place.
[2024-11-23 18:29:47,104 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 21 selfloop transitions, 4 changer transitions 20/68 dead transitions.
[2024-11-23 18:29:47,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 68 transitions, 484 flow
[2024-11-23 18:29:47,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-23 18:29:47,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-23 18:29:47,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions.
[2024-11-23 18:29:47,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666
[2024-11-23 18:29:47,106 INFO L175 Difference]: Start difference. First operand has 76 places, 49 transitions, 332 flow. Second operand 8 states and 169 transitions.
[2024-11-23 18:29:47,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 68 transitions, 484 flow
[2024-11-23 18:29:47,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 68 transitions, 391 flow, removed 31 selfloop flow, removed 14 redundant places.
[2024-11-23 18:29:47,134 INFO L231 Difference]: Finished difference. Result has 70 places, 44 transitions, 235 flow
[2024-11-23 18:29:47,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=235, PETRI_PLACES=70, PETRI_TRANSITIONS=44}
[2024-11-23 18:29:47,135 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 25 predicate places.
[2024-11-23 18:29:47,136 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 44 transitions, 235 flow
[2024-11-23 18:29:47,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.6) internal successors, (176), 10 states have internal predecessors, (176), 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-23 18:29:47,136 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-23 18:29:47,136 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-23 18:29:47,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-11-23 18:29:47,136 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-23 18:29:47,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 18:29:47,137 INFO L85 PathProgramCache]: Analyzing trace with hash 720872757, now seen corresponding path program 2 times
[2024-11-23 18:29:47,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 18:29:47,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644882566]
[2024-11-23 18:29:47,138 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-23 18:29:47,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 18:29:47,223 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-23 18:29:47,223 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-23 18:29:47,223 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-23 18:29:47,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-23 18:29:47,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-23 18:29:47,382 INFO L340 BasicCegarLoop]: Counterexample is feasible
[2024-11-23 18:29:47,383 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining)
[2024-11-23 18:29:47,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining)
[2024-11-23 18:29:47,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining)
[2024-11-23 18:29:47,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining)
[2024-11-23 18:29:47,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining)
[2024-11-23 18:29:47,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining)
[2024-11-23 18:29:47,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-11-23 18:29:47,387 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1]
[2024-11-23 18:29:47,503 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-23 18:29:47,503 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-23 18:29:47,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 06:29:47 BasicIcfg
[2024-11-23 18:29:47,517 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-23 18:29:47,517 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-23 18:29:47,518 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-23 18:29:47,518 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-23 18:29:47,519 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:29:22" (3/4) ...
[2024-11-23 18:29:47,520 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample
[2024-11-23 18:29:47,662 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 9.
[2024-11-23 18:29:47,719 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_003eb478-30dd-4c19-8763-f5484914fa35/bin/uautomizer-verify-LYvppIcaGC/witness.graphml
[2024-11-23 18:29:47,719 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_003eb478-30dd-4c19-8763-f5484914fa35/bin/uautomizer-verify-LYvppIcaGC/witness.yml
[2024-11-23 18:29:47,719 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-23 18:29:47,722 INFO L158 Benchmark]: Toolchain (without parser) took 27148.53ms. Allocated memory was 117.4MB in the beginning and 796.9MB in the end (delta: 679.5MB). Free memory was 91.1MB in the beginning and 643.4MB in the end (delta: -552.3MB). Peak memory consumption was 124.2MB. Max. memory is 16.1GB.
[2024-11-23 18:29:47,723 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 117.4MB. Free memory was 74.7MB in the beginning and 74.6MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-23 18:29:47,723 INFO L158 Benchmark]: CACSL2BoogieTranslator took 566.63ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 68.0MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-23 18:29:47,724 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.42ms. Allocated memory is still 117.4MB. Free memory was 68.0MB in the beginning and 65.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-23 18:29:47,724 INFO L158 Benchmark]: Boogie Preprocessor took 55.11ms. Allocated memory is still 117.4MB. Free memory was 65.5MB in the beginning and 62.7MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-23 18:29:47,725 INFO L158 Benchmark]: RCFGBuilder took 904.55ms. Allocated memory is still 117.4MB. Free memory was 62.7MB in the beginning and 68.9MB in the end (delta: -6.1MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB.
[2024-11-23 18:29:47,725 INFO L158 Benchmark]: TraceAbstraction took 25367.24ms. Allocated memory was 117.4MB in the beginning and 796.9MB in the end (delta: 679.5MB). Free memory was 68.3MB in the beginning and 656.0MB in the end (delta: -587.7MB). Peak memory consumption was 93.9MB. Max. memory is 16.1GB.
[2024-11-23 18:29:47,726 INFO L158 Benchmark]: Witness Printer took 202.09ms. Allocated memory is still 796.9MB. Free memory was 656.0MB in the beginning and 643.4MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-23 18:29:47,728 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.36ms. Allocated memory is still 117.4MB. Free memory was 74.7MB in the beginning and 74.6MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 566.63ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 68.0MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 46.42ms. Allocated memory is still 117.4MB. Free memory was 68.0MB in the beginning and 65.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 55.11ms. Allocated memory is still 117.4MB. Free memory was 65.5MB in the beginning and 62.7MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* RCFGBuilder took 904.55ms. Allocated memory is still 117.4MB. Free memory was 62.7MB in the beginning and 68.9MB in the end (delta: -6.1MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB.
* TraceAbstraction took 25367.24ms. Allocated memory was 117.4MB in the beginning and 796.9MB in the end (delta: 679.5MB). Free memory was 68.3MB in the beginning and 656.0MB in the end (delta: -587.7MB). Peak memory consumption was 93.9MB. Max. memory is 16.1GB.
* Witness Printer took 202.09ms. Allocated memory is still 796.9MB. Free memory was 656.0MB in the beginning and 643.4MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
[L710] 0 _Bool main$tmp_guard0;
[L711] 0 _Bool main$tmp_guard1;
[L713] 0 int x = 0;
[L715] 0 int y = 0;
[L716] 0 _Bool y$flush_delayed;
[L717] 0 int y$mem_tmp;
[L718] 0 _Bool y$r_buff0_thd0;
[L719] 0 _Bool y$r_buff0_thd1;
[L720] 0 _Bool y$r_buff0_thd2;
[L721] 0 _Bool y$r_buff0_thd3;
[L722] 0 _Bool y$r_buff1_thd0;
[L723] 0 _Bool y$r_buff1_thd1;
[L724] 0 _Bool y$r_buff1_thd2;
[L725] 0 _Bool y$r_buff1_thd3;
[L726] 0 _Bool y$read_delayed;
[L727] 0 int *y$read_delayed_var;
[L728] 0 int y$w_buff0;
[L729] 0 _Bool y$w_buff0_used;
[L730] 0 int y$w_buff1;
[L731] 0 _Bool y$w_buff1_used;
[L733] 0 int z = 0;
[L734] 0 _Bool weak$$choice0;
[L735] 0 _Bool weak$$choice2;
[L811] 0 pthread_t t2492;
[L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2492=-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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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]
[L813] 0 pthread_t t2493;
[L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492=-2, t2493=-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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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]
[L815] 0 pthread_t t2494;
[L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492=-2, t2493=-1, t2494=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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]
[L774] 3 y$w_buff1 = y$w_buff0
[L775] 3 y$w_buff0 = 2
[L776] 3 y$w_buff1_used = y$w_buff0_used
[L777] 3 y$w_buff0_used = (_Bool)1
[L778] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L18] COND FALSE 3 !(!expression)
[L778] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0
[L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1
[L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2
[L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3
[L783] 3 y$r_buff0_thd3 = (_Bool)1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0: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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L786] 3 z = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0: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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L739] 1 z = 2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2]
[L742] 1 x = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2]
[L754] 2 x = 2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2]
[L757] 2 y = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2]
[L760] 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)
[L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L762] 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
[L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L764] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2]
[L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2]
[L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2]
[L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2]
[L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2]
[L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492=-2, t2493=-1, t2494=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2]
[L820] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L820] RET 0 assume_abort_if_not(main$tmp_guard0)
[L822] 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)
[L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L824] 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
[L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L826] 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}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492=-2, t2493=-1, t2494=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2]
[L829] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L830] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L831] 0 y$flush_delayed = weak$$choice2
[L832] 0 y$mem_tmp = y
[L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2)
[L841] 0 y = y$flush_delayed ? y$mem_tmp : y
[L842] 0 y$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492=-2, t2493=-1, t2494=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2]
[L844] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2]
[L18] 0 reach_error()
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2]
- UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: Not analyzed.
- UnprovableResult [Line: 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.
- UnprovableResult [Line: 812]: 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: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 7 procedures, 64 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 25.1s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 15.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 621 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 598 mSDsluCounter, 242 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 191 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1936 IncrementalHoareTripleChecker+Invalid, 2010 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 51 mSDtfsCounter, 1936 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=554occurred in iteration=12, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 343 NumberOfCodeBlocks, 343 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 298 ConstructedInterpolants, 0 QuantifiedInterpolants, 2285 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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, ConComCheckerStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-11-23 18:29:47,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_003eb478-30dd-4c19-8763-f5484914fa35/bin/uautomizer-verify-LYvppIcaGC/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