./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 9bd2c7ff
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e07261-4ce3-46a2-a4f1-09956a0bdb12/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e07261-4ce3-46a2-a4f1-09956a0bdb12/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e07261-4ce3-46a2-a4f1-09956a0bdb12/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e07261-4ce3-46a2-a4f1-09956a0bdb12/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e07261-4ce3-46a2-a4f1-09956a0bdb12/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e07261-4ce3-46a2-a4f1-09956a0bdb12/bin/uautomizer-verify-uCwYo4JHxu --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 a843579fcb7bb5d5833d499f834986a668bfbdfa4c59a86e5d344f532fcebd9f
--- Real Ultimate output ---
This is Ultimate 0.2.3-dev-9bd2c7f
[2023-11-19 07:38:16,890 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2023-11-19 07:38:17,013 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e07261-4ce3-46a2-a4f1-09956a0bdb12/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf
[2023-11-19 07:38:17,022 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2023-11-19 07:38:17,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-19 07:38:17,061 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-19 07:38:17,062 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-19 07:38:17,063 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-19 07:38:17,064 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-19 07:38:17,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-19 07:38:17,070 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-19 07:38:17,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2023-11-19 07:38:17,071 INFO L153 SettingsManager]: * Use SBE=true
[2023-11-19 07:38:17,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-19 07:38:17,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2023-11-19 07:38:17,074 INFO L153 SettingsManager]: * sizeof long=4
[2023-11-19 07:38:17,074 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2023-11-19 07:38:17,075 INFO L153 SettingsManager]: * sizeof POINTER=4
[2023-11-19 07:38:17,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2023-11-19 07:38:17,075 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2023-11-19 07:38:17,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-19 07:38:17,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2023-11-19 07:38:17,077 INFO L153 SettingsManager]: * sizeof long double=12
[2023-11-19 07:38:17,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2023-11-19 07:38:17,078 INFO L153 SettingsManager]: * Use constant arrays=true
[2023-11-19 07:38:17,078 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-19 07:38:17,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-11-19 07:38:17,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2023-11-19 07:38:17,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:38:17,082 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-19 07:38:17,083 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-11-19 07:38:17,083 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2023-11-19 07:38:17,084 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2023-11-19 07:38:17,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-19 07:38:17,084 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-19 07:38:17,084 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-19 07:38:17,085 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-11-19 07:38:17,085 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-19 07:38:17,085 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-19 07:38:17,085 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e07261-4ce3-46a2-a4f1-09956a0bdb12/bin/uautomizer-verify-uCwYo4JHxu/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
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_55e07261-4ce3-46a2-a4f1-09956a0bdb12/bin/uautomizer-verify-uCwYo4JHxu
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 -> a843579fcb7bb5d5833d499f834986a668bfbdfa4c59a86e5d344f532fcebd9f
[2023-11-19 07:38:17,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-19 07:38:17,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-19 07:38:17,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-19 07:38:17,455 INFO L270 PluginConnector]: Initializing CDTParser...
[2023-11-19 07:38:17,456 INFO L274 PluginConnector]: CDTParser initialized
[2023-11-19 07:38:17,457 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e07261-4ce3-46a2-a4f1-09956a0bdb12/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i
[2023-11-19 07:38:20,752 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2023-11-19 07:38:21,073 INFO L384 CDTParser]: Found 1 translation units.
[2023-11-19 07:38:21,073 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e07261-4ce3-46a2-a4f1-09956a0bdb12/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i
[2023-11-19 07:38:21,098 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e07261-4ce3-46a2-a4f1-09956a0bdb12/bin/uautomizer-verify-uCwYo4JHxu/data/77330a635/7b25aedd76d14b0b8ec3268d8f06bb60/FLAG3e68b0b48
[2023-11-19 07:38:21,117 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e07261-4ce3-46a2-a4f1-09956a0bdb12/bin/uautomizer-verify-uCwYo4JHxu/data/77330a635/7b25aedd76d14b0b8ec3268d8f06bb60
[2023-11-19 07:38:21,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-19 07:38:21,126 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-19 07:38:21,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-19 07:38:21,130 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-19 07:38:21,135 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-19 07:38:21,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:38:21" (1/1) ...
[2023-11-19 07:38:21,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aaa9ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:21, skipping insertion in model container
[2023-11-19 07:38:21,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:38:21" (1/1) ...
[2023-11-19 07:38:21,219 INFO L177 MainTranslator]: Built tables and reachable declarations
[2023-11-19 07:38:21,411 WARN L240 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_55e07261-4ce3-46a2-a4f1-09956a0bdb12/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i[976,989]
[2023-11-19 07:38:21,663 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:38:21,683 INFO L202 MainTranslator]: Completed pre-run
[2023-11-19 07:38:21,698 WARN L240 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_55e07261-4ce3-46a2-a4f1-09956a0bdb12/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i[976,989]
[2023-11-19 07:38:21,781 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:38:21,822 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-11-19 07:38:21,822 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-11-19 07:38:21,830 INFO L206 MainTranslator]: Completed translation
[2023-11-19 07:38:21,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:21 WrapperNode
[2023-11-19 07:38:21,831 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-19 07:38:21,833 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-19 07:38:21,833 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-19 07:38:21,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-19 07:38:21,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:21" (1/1) ...
[2023-11-19 07:38:21,867 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:21" (1/1) ...
[2023-11-19 07:38:21,925 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143
[2023-11-19 07:38:21,925 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-19 07:38:21,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-19 07:38:21,926 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-19 07:38:21,926 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2023-11-19 07:38:21,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:21" (1/1) ...
[2023-11-19 07:38:21,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:21" (1/1) ...
[2023-11-19 07:38:21,941 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:21" (1/1) ...
[2023-11-19 07:38:21,941 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:21" (1/1) ...
[2023-11-19 07:38:21,951 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:21" (1/1) ...
[2023-11-19 07:38:21,953 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:21" (1/1) ...
[2023-11-19 07:38:21,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:21" (1/1) ...
[2023-11-19 07:38:21,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:21" (1/1) ...
[2023-11-19 07:38:21,962 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-19 07:38:21,964 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-19 07:38:21,964 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2023-11-19 07:38:21,964 INFO L274 PluginConnector]: RCFGBuilder initialized
[2023-11-19 07:38:21,965 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:21" (1/1) ...
[2023-11-19 07:38:21,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:38:21,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e07261-4ce3-46a2-a4f1-09956a0bdb12/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 07:38:22,000 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e07261-4ce3-46a2-a4f1-09956a0bdb12/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-19 07:38:22,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e07261-4ce3-46a2-a4f1-09956a0bdb12/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-19 07:38:22,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2023-11-19 07:38:22,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-11-19 07:38:22,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-19 07:38:22,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-19 07:38:22,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-19 07:38:22,089 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2023-11-19 07:38:22,089 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2023-11-19 07:38:22,089 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2023-11-19 07:38:22,089 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2023-11-19 07:38:22,090 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2023-11-19 07:38:22,090 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2023-11-19 07:38:22,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-19 07:38:22,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-11-19 07:38:22,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-19 07:38:22,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-19 07:38:22,092 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2023-11-19 07:38:22,286 INFO L236 CfgBuilder]: Building ICFG
[2023-11-19 07:38:22,288 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-19 07:38:22,712 INFO L277 CfgBuilder]: Performing block encoding
[2023-11-19 07:38:22,868 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-19 07:38:22,869 INFO L302 CfgBuilder]: Removed 0 assume(true) statements.
[2023-11-19 07:38:22,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:38:22 BoogieIcfgContainer
[2023-11-19 07:38:22,875 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-19 07:38:22,879 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-19 07:38:22,879 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2023-11-19 07:38:22,882 INFO L274 PluginConnector]: TraceAbstraction initialized
[2023-11-19 07:38:22,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:38:21" (1/3) ...
[2023-11-19 07:38:22,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a5669a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:38:22, skipping insertion in model container
[2023-11-19 07:38:22,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:21" (2/3) ...
[2023-11-19 07:38:22,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a5669a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:38:22, skipping insertion in model container
[2023-11-19 07:38:22,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:38:22" (3/3) ...
[2023-11-19 07:38:22,888 INFO L112 eAbstractionObserver]: Analyzing ICFG safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i
[2023-11-19 07:38:22,895 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-11-19 07:38:22,903 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-19 07:38:22,903 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2023-11-19 07:38:22,904 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-19 07:38:22,960 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-11-19 07:38:23,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 111 transitions, 234 flow
[2023-11-19 07:38:23,078 INFO L124 PetriNetUnfolderBase]: 3/108 cut-off events.
[2023-11-19 07:38:23,079 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:38:23,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 3/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place.
[2023-11-19 07:38:23,085 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 111 transitions, 234 flow
[2023-11-19 07:38:23,090 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 108 transitions, 225 flow
[2023-11-19 07:38:23,094 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-19 07:38:23,105 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 108 transitions, 225 flow
[2023-11-19 07:38:23,108 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 108 transitions, 225 flow
[2023-11-19 07:38:23,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 108 transitions, 225 flow
[2023-11-19 07:38:23,164 INFO L124 PetriNetUnfolderBase]: 3/108 cut-off events.
[2023-11-19 07:38:23,165 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:38:23,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 3/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place.
[2023-11-19 07:38:23,171 INFO L119 LiptonReduction]: Number of co-enabled transitions 2190
[2023-11-19 07:38:28,399 INFO L134 LiptonReduction]: Checked pairs total: 5208
[2023-11-19 07:38:28,399 INFO L136 LiptonReduction]: Total number of compositions: 98
[2023-11-19 07:38:28,416 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-19 07:38:28,424 INFO L357 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, mHoare=true, 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;@20387da3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-19 07:38:28,424 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2023-11-19 07:38:28,430 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-11-19 07:38:28,430 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events.
[2023-11-19 07:38:28,431 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:38:28,431 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:38:28,432 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2023-11-19 07:38:28,432 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-19 07:38:28,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:38:28,438 INFO L85 PathProgramCache]: Analyzing trace with hash 465624676, now seen corresponding path program 1 times
[2023-11-19 07:38:28,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:38:28,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048523344]
[2023-11-19 07:38:28,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:38:28,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:38:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:28,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:38:28,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:38:28,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048523344]
[2023-11-19 07:38:28,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048523344] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:38:28,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:38:28,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-19 07:38:28,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593288334]
[2023-11-19 07:38:28,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:38:28,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:38:28,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:38:28,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:38:28,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:38:28,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 209
[2023-11-19 07:38:29,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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)
[2023-11-19 07:38:29,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:38:29,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 209
[2023-11-19 07:38:29,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:38:29,402 INFO L124 PetriNetUnfolderBase]: 711/1165 cut-off events.
[2023-11-19 07:38:29,402 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES.
[2023-11-19 07:38:29,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2284 conditions, 1165 events. 711/1165 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5980 event pairs, 117 based on Foata normal form. 0/1096 useless extension candidates. Maximal degree in co-relation 2273. Up to 859 conditions per place.
[2023-11-19 07:38:29,414 INFO L140 encePairwiseOnDemand]: 206/209 looper letters, 27 selfloop transitions, 2 changer transitions 2/34 dead transitions.
[2023-11-19 07:38:29,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 142 flow
[2023-11-19 07:38:29,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:38:29,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-19 07:38:29,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions.
[2023-11-19 07:38:29,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5103668261562998
[2023-11-19 07:38:29,439 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions.
[2023-11-19 07:38:29,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions.
[2023-11-19 07:38:29,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:38:29,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions.
[2023-11-19 07:38:29,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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)
[2023-11-19 07:38:29,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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)
[2023-11-19 07:38:29,459 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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)
[2023-11-19 07:38:29,461 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 55 flow. Second operand 3 states and 320 transitions.
[2023-11-19 07:38:29,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 34 transitions, 142 flow
[2023-11-19 07:38:29,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 3 redundant places.
[2023-11-19 07:38:29,466 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow
[2023-11-19 07:38:29,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21}
[2023-11-19 07:38:29,474 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places.
[2023-11-19 07:38:29,474 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow
[2023-11-19 07:38:29,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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)
[2023-11-19 07:38:29,475 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:38:29,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:38:29,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-19 07:38:29,476 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-19 07:38:29,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:38:29,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2092549551, now seen corresponding path program 1 times
[2023-11-19 07:38:29,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:38:29,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162225730]
[2023-11-19 07:38:29,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:38:29,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:38:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:38:29,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:38:29,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162225730]
[2023-11-19 07:38:29,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162225730] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:38:29,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:38:29,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-19 07:38:29,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697615980]
[2023-11-19 07:38:29,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:38:29,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:38:29,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:38:29,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:38:29,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:38:29,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 209
[2023-11-19 07:38:29,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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)
[2023-11-19 07:38:29,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:38:29,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 209
[2023-11-19 07:38:29,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:38:30,042 INFO L124 PetriNetUnfolderBase]: 527/871 cut-off events.
[2023-11-19 07:38:30,042 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES.
[2023-11-19 07:38:30,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1793 conditions, 871 events. 527/871 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4234 event pairs, 95 based on Foata normal form. 16/883 useless extension candidates. Maximal degree in co-relation 1783. Up to 687 conditions per place.
[2023-11-19 07:38:30,050 INFO L140 encePairwiseOnDemand]: 206/209 looper letters, 28 selfloop transitions, 2 changer transitions 0/33 dead transitions.
[2023-11-19 07:38:30,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 142 flow
[2023-11-19 07:38:30,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:38:30,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-19 07:38:30,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 316 transitions.
[2023-11-19 07:38:30,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5039872408293461
[2023-11-19 07:38:30,053 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 316 transitions.
[2023-11-19 07:38:30,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 316 transitions.
[2023-11-19 07:38:30,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:38:30,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 316 transitions.
[2023-11-19 07:38:30,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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)
[2023-11-19 07:38:30,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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)
[2023-11-19 07:38:30,058 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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)
[2023-11-19 07:38:30,059 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 3 states and 316 transitions.
[2023-11-19 07:38:30,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 142 flow
[2023-11-19 07:38:30,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-19 07:38:30,061 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 56 flow
[2023-11-19 07:38:30,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=21}
[2023-11-19 07:38:30,062 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places.
[2023-11-19 07:38:30,062 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow
[2023-11-19 07:38:30,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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)
[2023-11-19 07:38:30,063 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:38:30,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:38:30,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-19 07:38:30,063 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-19 07:38:30,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:38:30,064 INFO L85 PathProgramCache]: Analyzing trace with hash 444525560, now seen corresponding path program 1 times
[2023-11-19 07:38:30,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:38:30,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995710793]
[2023-11-19 07:38:30,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:38:30,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:38:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:30,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:38:30,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:38:30,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995710793]
[2023-11-19 07:38:30,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995710793] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:38:30,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:38:30,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:38:30,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708326915]
[2023-11-19 07:38:30,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:38:30,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:38:30,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:38:30,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:38:30,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:38:30,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 209
[2023-11-19 07:38:30,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 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)
[2023-11-19 07:38:30,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:38:30,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 209
[2023-11-19 07:38:30,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:38:31,189 INFO L124 PetriNetUnfolderBase]: 1013/1536 cut-off events.
[2023-11-19 07:38:31,189 INFO L125 PetriNetUnfolderBase]: For 181/181 co-relation queries the response was YES.
[2023-11-19 07:38:31,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3397 conditions, 1536 events. 1013/1536 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6740 event pairs, 182 based on Foata normal form. 33/1568 useless extension candidates. Maximal degree in co-relation 3386. Up to 1135 conditions per place.
[2023-11-19 07:38:31,202 INFO L140 encePairwiseOnDemand]: 199/209 looper letters, 33 selfloop transitions, 11 changer transitions 0/45 dead transitions.
[2023-11-19 07:38:31,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 45 transitions, 202 flow
[2023-11-19 07:38:31,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-11-19 07:38:31,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-19 07:38:31,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 390 transitions.
[2023-11-19 07:38:31,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4665071770334928
[2023-11-19 07:38:31,207 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 390 transitions.
[2023-11-19 07:38:31,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 390 transitions.
[2023-11-19 07:38:31,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:38:31,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 390 transitions.
[2023-11-19 07:38:31,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 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)
[2023-11-19 07:38:31,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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)
[2023-11-19 07:38:31,213 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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)
[2023-11-19 07:38:31,213 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 4 states and 390 transitions.
[2023-11-19 07:38:31,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 45 transitions, 202 flow
[2023-11-19 07:38:31,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 45 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-19 07:38:31,216 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 133 flow
[2023-11-19 07:38:31,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=35, PETRI_TRANSITIONS=30}
[2023-11-19 07:38:31,217 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places.
[2023-11-19 07:38:31,218 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 133 flow
[2023-11-19 07:38:31,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 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)
[2023-11-19 07:38:31,219 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:38:31,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:38:31,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-19 07:38:31,219 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-19 07:38:31,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:38:31,220 INFO L85 PathProgramCache]: Analyzing trace with hash 2071922421, now seen corresponding path program 1 times
[2023-11-19 07:38:31,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:38:31,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899450421]
[2023-11-19 07:38:31,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:38:31,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:38:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:31,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:38:31,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:38:31,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899450421]
[2023-11-19 07:38:31,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899450421] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:38:31,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:38:31,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:38:31,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196300569]
[2023-11-19 07:38:31,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:38:31,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:38:31,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:38:31,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:38:31,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:38:31,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 209
[2023-11-19 07:38:31,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 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)
[2023-11-19 07:38:31,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:38:31,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 209
[2023-11-19 07:38:31,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:38:32,257 INFO L124 PetriNetUnfolderBase]: 1219/1878 cut-off events.
[2023-11-19 07:38:32,257 INFO L125 PetriNetUnfolderBase]: For 959/959 co-relation queries the response was YES.
[2023-11-19 07:38:32,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5513 conditions, 1878 events. 1219/1878 cut-off events. For 959/959 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8961 event pairs, 256 based on Foata normal form. 45/1923 useless extension candidates. Maximal degree in co-relation 5499. Up to 923 conditions per place.
[2023-11-19 07:38:32,275 INFO L140 encePairwiseOnDemand]: 200/209 looper letters, 42 selfloop transitions, 12 changer transitions 0/55 dead transitions.
[2023-11-19 07:38:32,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 55 transitions, 327 flow
[2023-11-19 07:38:32,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-11-19 07:38:32,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-19 07:38:32,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 391 transitions.
[2023-11-19 07:38:32,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4677033492822967
[2023-11-19 07:38:32,278 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 391 transitions.
[2023-11-19 07:38:32,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 391 transitions.
[2023-11-19 07:38:32,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:38:32,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 391 transitions.
[2023-11-19 07:38:32,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 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)
[2023-11-19 07:38:32,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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)
[2023-11-19 07:38:32,284 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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)
[2023-11-19 07:38:32,285 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 133 flow. Second operand 4 states and 391 transitions.
[2023-11-19 07:38:32,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 55 transitions, 327 flow
[2023-11-19 07:38:32,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 55 transitions, 327 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-19 07:38:32,289 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 226 flow
[2023-11-19 07:38:32,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=41, PETRI_TRANSITIONS=37}
[2023-11-19 07:38:32,291 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places.
[2023-11-19 07:38:32,291 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 226 flow
[2023-11-19 07:38:32,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 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)
[2023-11-19 07:38:32,292 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:38:32,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:38:32,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-19 07:38:32,293 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-19 07:38:32,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:38:32,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1933757629, now seen corresponding path program 1 times
[2023-11-19 07:38:32,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:38:32,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125246239]
[2023-11-19 07:38:32,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:38:32,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:38:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:32,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:38:32,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:38:32,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125246239]
[2023-11-19 07:38:32,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125246239] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:38:32,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:38:32,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:38:32,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16736916]
[2023-11-19 07:38:32,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:38:32,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-19 07:38:32,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:38:32,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-19 07:38:32,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2023-11-19 07:38:32,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 209
[2023-11-19 07:38:32,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 226 flow. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 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)
[2023-11-19 07:38:32,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:38:32,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 209
[2023-11-19 07:38:32,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:38:33,617 INFO L124 PetriNetUnfolderBase]: 1815/2836 cut-off events.
[2023-11-19 07:38:33,617 INFO L125 PetriNetUnfolderBase]: For 3423/3423 co-relation queries the response was YES.
[2023-11-19 07:38:33,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9456 conditions, 2836 events. 1815/2836 cut-off events. For 3423/3423 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 15137 event pairs, 364 based on Foata normal form. 45/2880 useless extension candidates. Maximal degree in co-relation 9437. Up to 1300 conditions per place.
[2023-11-19 07:38:33,640 INFO L140 encePairwiseOnDemand]: 199/209 looper letters, 44 selfloop transitions, 14 changer transitions 10/69 dead transitions.
[2023-11-19 07:38:33,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 69 transitions, 505 flow
[2023-11-19 07:38:33,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-19 07:38:33,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-11-19 07:38:33,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 485 transitions.
[2023-11-19 07:38:33,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46411483253588515
[2023-11-19 07:38:33,644 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 485 transitions.
[2023-11-19 07:38:33,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 485 transitions.
[2023-11-19 07:38:33,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:38:33,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 485 transitions.
[2023-11-19 07:38:33,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.0) internal successors, (485), 5 states have internal predecessors, (485), 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)
[2023-11-19 07:38:33,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 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)
[2023-11-19 07:38:33,651 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 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)
[2023-11-19 07:38:33,651 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 226 flow. Second operand 5 states and 485 transitions.
[2023-11-19 07:38:33,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 69 transitions, 505 flow
[2023-11-19 07:38:33,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 69 transitions, 499 flow, removed 3 selfloop flow, removed 0 redundant places.
[2023-11-19 07:38:33,661 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 296 flow
[2023-11-19 07:38:33,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=296, PETRI_PLACES=48, PETRI_TRANSITIONS=39}
[2023-11-19 07:38:33,662 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 15 predicate places.
[2023-11-19 07:38:33,662 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 296 flow
[2023-11-19 07:38:33,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 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)
[2023-11-19 07:38:33,663 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:38:33,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:38:33,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-19 07:38:33,664 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-19 07:38:33,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:38:33,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1935425119, now seen corresponding path program 2 times
[2023-11-19 07:38:33,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:38:33,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045471212]
[2023-11-19 07:38:33,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:38:33,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:38:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:33,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:38:33,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:38:33,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045471212]
[2023-11-19 07:38:33,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045471212] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:38:33,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:38:33,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:38:33,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710177295]
[2023-11-19 07:38:33,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:38:33,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:38:33,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:38:33,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:38:33,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:38:33,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 209
[2023-11-19 07:38:33,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 296 flow. Second operand has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 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)
[2023-11-19 07:38:33,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:38:33,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 209
[2023-11-19 07:38:33,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:38:34,260 INFO L124 PetriNetUnfolderBase]: 1119/1759 cut-off events.
[2023-11-19 07:38:34,260 INFO L125 PetriNetUnfolderBase]: For 3675/3675 co-relation queries the response was YES.
[2023-11-19 07:38:34,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6379 conditions, 1759 events. 1119/1759 cut-off events. For 3675/3675 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 8634 event pairs, 274 based on Foata normal form. 45/1796 useless extension candidates. Maximal degree in co-relation 6355. Up to 1069 conditions per place.
[2023-11-19 07:38:34,277 INFO L140 encePairwiseOnDemand]: 204/209 looper letters, 41 selfloop transitions, 5 changer transitions 15/62 dead transitions.
[2023-11-19 07:38:34,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 62 transitions, 558 flow
[2023-11-19 07:38:34,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-11-19 07:38:34,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-19 07:38:34,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 407 transitions.
[2023-11-19 07:38:34,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579
[2023-11-19 07:38:34,280 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 407 transitions.
[2023-11-19 07:38:34,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 407 transitions.
[2023-11-19 07:38:34,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:38:34,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 407 transitions.
[2023-11-19 07:38:34,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 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)
[2023-11-19 07:38:34,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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)
[2023-11-19 07:38:34,285 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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)
[2023-11-19 07:38:34,285 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 296 flow. Second operand 4 states and 407 transitions.
[2023-11-19 07:38:34,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 62 transitions, 558 flow
[2023-11-19 07:38:34,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 62 transitions, 531 flow, removed 2 selfloop flow, removed 4 redundant places.
[2023-11-19 07:38:34,297 INFO L231 Difference]: Finished difference. Result has 48 places, 33 transitions, 229 flow
[2023-11-19 07:38:34,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=229, PETRI_PLACES=48, PETRI_TRANSITIONS=33}
[2023-11-19 07:38:34,298 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 15 predicate places.
[2023-11-19 07:38:34,299 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 33 transitions, 229 flow
[2023-11-19 07:38:34,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 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)
[2023-11-19 07:38:34,299 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:38:34,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:38:34,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-19 07:38:34,300 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-19 07:38:34,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:38:34,300 INFO L85 PathProgramCache]: Analyzing trace with hash -244390844, now seen corresponding path program 1 times
[2023-11-19 07:38:34,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:38:34,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826824994]
[2023-11-19 07:38:34,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:38:34,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:38:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:34,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:38:34,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:38:34,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826824994]
[2023-11-19 07:38:34,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826824994] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:38:34,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:38:34,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 07:38:34,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674633488]
[2023-11-19 07:38:34,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:38:34,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-19 07:38:34,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:38:34,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-19 07:38:34,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2023-11-19 07:38:34,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 209
[2023-11-19 07:38:34,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 33 transitions, 229 flow. Second operand has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 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)
[2023-11-19 07:38:34,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:38:34,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 209
[2023-11-19 07:38:34,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:38:35,100 INFO L124 PetriNetUnfolderBase]: 642/1044 cut-off events.
[2023-11-19 07:38:35,100 INFO L125 PetriNetUnfolderBase]: For 1912/1912 co-relation queries the response was YES.
[2023-11-19 07:38:35,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3653 conditions, 1044 events. 642/1044 cut-off events. For 1912/1912 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4670 event pairs, 138 based on Foata normal form. 27/1071 useless extension candidates. Maximal degree in co-relation 3630. Up to 505 conditions per place.
[2023-11-19 07:38:35,109 INFO L140 encePairwiseOnDemand]: 202/209 looper letters, 29 selfloop transitions, 6 changer transitions 24/60 dead transitions.
[2023-11-19 07:38:35,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 448 flow
[2023-11-19 07:38:35,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-11-19 07:38:35,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-19 07:38:35,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 567 transitions.
[2023-11-19 07:38:35,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45215311004784686
[2023-11-19 07:38:35,113 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 567 transitions.
[2023-11-19 07:38:35,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 567 transitions.
[2023-11-19 07:38:35,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:38:35,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 567 transitions.
[2023-11-19 07:38:35,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 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)
[2023-11-19 07:38:35,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 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)
[2023-11-19 07:38:35,120 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 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)
[2023-11-19 07:38:35,120 INFO L175 Difference]: Start difference. First operand has 48 places, 33 transitions, 229 flow. Second operand 6 states and 567 transitions.
[2023-11-19 07:38:35,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 448 flow
[2023-11-19 07:38:35,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 411 flow, removed 2 selfloop flow, removed 7 redundant places.
[2023-11-19 07:38:35,127 INFO L231 Difference]: Finished difference. Result has 48 places, 27 transitions, 153 flow
[2023-11-19 07:38:35,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=153, PETRI_PLACES=48, PETRI_TRANSITIONS=27}
[2023-11-19 07:38:35,128 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 15 predicate places.
[2023-11-19 07:38:35,128 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 27 transitions, 153 flow
[2023-11-19 07:38:35,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 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)
[2023-11-19 07:38:35,129 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:38:35,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:38:35,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-19 07:38:35,129 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-19 07:38:35,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:38:35,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1313314748, now seen corresponding path program 2 times
[2023-11-19 07:38:35,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:38:35,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874588167]
[2023-11-19 07:38:35,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:38:35,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:38:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:36,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:38:36,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:38:36,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874588167]
[2023-11-19 07:38:36,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874588167] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:38:36,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:38:36,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:38:36,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957903630]
[2023-11-19 07:38:36,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:38:36,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-19 07:38:36,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:38:36,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-19 07:38:36,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2023-11-19 07:38:36,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 209
[2023-11-19 07:38:36,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 27 transitions, 153 flow. Second operand has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 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)
[2023-11-19 07:38:36,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:38:36,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 209
[2023-11-19 07:38:36,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:38:36,317 INFO L124 PetriNetUnfolderBase]: 279/470 cut-off events.
[2023-11-19 07:38:36,317 INFO L125 PetriNetUnfolderBase]: For 802/808 co-relation queries the response was YES.
[2023-11-19 07:38:36,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1595 conditions, 470 events. 279/470 cut-off events. For 802/808 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1714 event pairs, 121 based on Foata normal form. 1/456 useless extension candidates. Maximal degree in co-relation 1574. Up to 411 conditions per place.
[2023-11-19 07:38:36,322 INFO L140 encePairwiseOnDemand]: 203/209 looper letters, 29 selfloop transitions, 7 changer transitions 0/40 dead transitions.
[2023-11-19 07:38:36,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 40 transitions, 289 flow
[2023-11-19 07:38:36,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-11-19 07:38:36,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-19 07:38:36,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 404 transitions.
[2023-11-19 07:38:36,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48325358851674644
[2023-11-19 07:38:36,330 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 404 transitions.
[2023-11-19 07:38:36,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 404 transitions.
[2023-11-19 07:38:36,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:38:36,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 404 transitions.
[2023-11-19 07:38:36,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 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)
[2023-11-19 07:38:36,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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)
[2023-11-19 07:38:36,334 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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)
[2023-11-19 07:38:36,335 INFO L175 Difference]: Start difference. First operand has 48 places, 27 transitions, 153 flow. Second operand 4 states and 404 transitions.
[2023-11-19 07:38:36,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 40 transitions, 289 flow
[2023-11-19 07:38:36,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 40 transitions, 255 flow, removed 8 selfloop flow, removed 7 redundant places.
[2023-11-19 07:38:36,339 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 166 flow
[2023-11-19 07:38:36,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=42, PETRI_TRANSITIONS=30}
[2023-11-19 07:38:36,342 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 9 predicate places.
[2023-11-19 07:38:36,342 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 166 flow
[2023-11-19 07:38:36,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 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)
[2023-11-19 07:38:36,343 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:38:36,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:38:36,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-19 07:38:36,344 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-19 07:38:36,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:38:36,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1160556835, now seen corresponding path program 1 times
[2023-11-19 07:38:36,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:38:36,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364127287]
[2023-11-19 07:38:36,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:38:36,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:38:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:36,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:38:36,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:38:36,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364127287]
[2023-11-19 07:38:36,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364127287] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:38:36,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:38:36,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:38:36,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665836103]
[2023-11-19 07:38:36,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:38:36,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:38:36,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:38:36,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:38:36,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:38:36,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 209
[2023-11-19 07:38:36,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 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)
[2023-11-19 07:38:36,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:38:36,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 209
[2023-11-19 07:38:36,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:38:36,805 INFO L124 PetriNetUnfolderBase]: 221/400 cut-off events.
[2023-11-19 07:38:36,806 INFO L125 PetriNetUnfolderBase]: For 790/806 co-relation queries the response was YES.
[2023-11-19 07:38:36,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 400 events. 221/400 cut-off events. For 790/806 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1553 event pairs, 70 based on Foata normal form. 49/446 useless extension candidates. Maximal degree in co-relation 1369. Up to 246 conditions per place.
[2023-11-19 07:38:36,810 INFO L140 encePairwiseOnDemand]: 203/209 looper letters, 34 selfloop transitions, 6 changer transitions 17/61 dead transitions.
[2023-11-19 07:38:36,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 61 transitions, 450 flow
[2023-11-19 07:38:36,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-19 07:38:36,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-11-19 07:38:36,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 503 transitions.
[2023-11-19 07:38:36,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4813397129186603
[2023-11-19 07:38:36,814 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 503 transitions.
[2023-11-19 07:38:36,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 503 transitions.
[2023-11-19 07:38:36,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:38:36,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 503 transitions.
[2023-11-19 07:38:36,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 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)
[2023-11-19 07:38:36,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 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)
[2023-11-19 07:38:36,819 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 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)
[2023-11-19 07:38:36,820 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 166 flow. Second operand 5 states and 503 transitions.
[2023-11-19 07:38:36,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 61 transitions, 450 flow
[2023-11-19 07:38:36,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 61 transitions, 430 flow, removed 0 selfloop flow, removed 4 redundant places.
[2023-11-19 07:38:36,823 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 194 flow
[2023-11-19 07:38:36,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=45, PETRI_TRANSITIONS=33}
[2023-11-19 07:38:36,824 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 12 predicate places.
[2023-11-19 07:38:36,824 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 194 flow
[2023-11-19 07:38:36,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 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)
[2023-11-19 07:38:36,825 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:38:36,825 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:38:36,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-19 07:38:36,826 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-19 07:38:36,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:38:36,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1800068596, now seen corresponding path program 1 times
[2023-11-19 07:38:36,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:38:36,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749615014]
[2023-11-19 07:38:36,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:38:36,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:38:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:37,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:38:37,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:38:37,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749615014]
[2023-11-19 07:38:37,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749615014] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:38:37,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:38:37,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 07:38:37,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487911352]
[2023-11-19 07:38:37,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:38:37,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-19 07:38:37,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:38:37,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-19 07:38:37,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-11-19 07:38:37,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 209
[2023-11-19 07:38:37,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 93.8) internal successors, (469), 5 states have internal predecessors, (469), 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)
[2023-11-19 07:38:37,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:38:37,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 209
[2023-11-19 07:38:37,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:38:37,251 INFO L124 PetriNetUnfolderBase]: 141/285 cut-off events.
[2023-11-19 07:38:37,251 INFO L125 PetriNetUnfolderBase]: For 768/785 co-relation queries the response was YES.
[2023-11-19 07:38:37,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1182 conditions, 285 events. 141/285 cut-off events. For 768/785 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1109 event pairs, 14 based on Foata normal form. 30/312 useless extension candidates. Maximal degree in co-relation 1163. Up to 133 conditions per place.
[2023-11-19 07:38:37,254 INFO L140 encePairwiseOnDemand]: 203/209 looper letters, 37 selfloop transitions, 10 changer transitions 22/73 dead transitions.
[2023-11-19 07:38:37,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 73 transitions, 584 flow
[2023-11-19 07:38:37,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-11-19 07:38:37,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-19 07:38:37,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 698 transitions.
[2023-11-19 07:38:37,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47710184552289814
[2023-11-19 07:38:37,259 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 698 transitions.
[2023-11-19 07:38:37,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 698 transitions.
[2023-11-19 07:38:37,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:38:37,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 698 transitions.
[2023-11-19 07:38:37,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.71428571428571) internal successors, (698), 7 states have internal predecessors, (698), 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)
[2023-11-19 07:38:37,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 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)
[2023-11-19 07:38:37,267 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 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)
[2023-11-19 07:38:37,267 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 194 flow. Second operand 7 states and 698 transitions.
[2023-11-19 07:38:37,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 73 transitions, 584 flow
[2023-11-19 07:38:37,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 73 transitions, 584 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-19 07:38:37,271 INFO L231 Difference]: Finished difference. Result has 54 places, 36 transitions, 251 flow
[2023-11-19 07:38:37,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=251, PETRI_PLACES=54, PETRI_TRANSITIONS=36}
[2023-11-19 07:38:37,272 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 21 predicate places.
[2023-11-19 07:38:37,273 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 36 transitions, 251 flow
[2023-11-19 07:38:37,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.8) internal successors, (469), 5 states have internal predecessors, (469), 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)
[2023-11-19 07:38:37,273 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:38:37,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:38:37,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-19 07:38:37,274 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-19 07:38:37,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:38:37,274 INFO L85 PathProgramCache]: Analyzing trace with hash 2105454088, now seen corresponding path program 1 times
[2023-11-19 07:38:37,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:38:37,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427560065]
[2023-11-19 07:38:37,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:38:37,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:38:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:37,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:38:37,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:38:37,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427560065]
[2023-11-19 07:38:37,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427560065] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:38:37,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:38:37,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-19 07:38:37,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441988311]
[2023-11-19 07:38:37,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:38:37,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-19 07:38:37,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:38:37,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-19 07:38:37,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2023-11-19 07:38:37,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 209
[2023-11-19 07:38:37,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 36 transitions, 251 flow. Second operand has 6 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 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)
[2023-11-19 07:38:37,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:38:37,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 209
[2023-11-19 07:38:37,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:38:37,728 INFO L124 PetriNetUnfolderBase]: 110/225 cut-off events.
[2023-11-19 07:38:37,728 INFO L125 PetriNetUnfolderBase]: For 867/880 co-relation queries the response was YES.
[2023-11-19 07:38:37,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1065 conditions, 225 events. 110/225 cut-off events. For 867/880 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 861 event pairs, 8 based on Foata normal form. 12/235 useless extension candidates. Maximal degree in co-relation 1041. Up to 106 conditions per place.
[2023-11-19 07:38:37,731 INFO L140 encePairwiseOnDemand]: 203/209 looper letters, 34 selfloop transitions, 13 changer transitions 20/71 dead transitions.
[2023-11-19 07:38:37,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 71 transitions, 629 flow
[2023-11-19 07:38:37,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2023-11-19 07:38:37,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2023-11-19 07:38:37,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 878 transitions.
[2023-11-19 07:38:37,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46677299308878256
[2023-11-19 07:38:37,736 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 878 transitions.
[2023-11-19 07:38:37,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 878 transitions.
[2023-11-19 07:38:37,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:38:37,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 878 transitions.
[2023-11-19 07:38:37,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.55555555555556) internal successors, (878), 9 states have internal predecessors, (878), 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)
[2023-11-19 07:38:37,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 209.0) internal successors, (2090), 10 states have internal predecessors, (2090), 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)
[2023-11-19 07:38:37,745 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 209.0) internal successors, (2090), 10 states have internal predecessors, (2090), 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)
[2023-11-19 07:38:37,745 INFO L175 Difference]: Start difference. First operand has 54 places, 36 transitions, 251 flow. Second operand 9 states and 878 transitions.
[2023-11-19 07:38:37,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 71 transitions, 629 flow
[2023-11-19 07:38:37,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 71 transitions, 560 flow, removed 25 selfloop flow, removed 6 redundant places.
[2023-11-19 07:38:37,751 INFO L231 Difference]: Finished difference. Result has 58 places, 36 transitions, 247 flow
[2023-11-19 07:38:37,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=247, PETRI_PLACES=58, PETRI_TRANSITIONS=36}
[2023-11-19 07:38:37,752 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 25 predicate places.
[2023-11-19 07:38:37,752 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 36 transitions, 247 flow
[2023-11-19 07:38:37,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 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)
[2023-11-19 07:38:37,753 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:38:37,753 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:38:37,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-11-19 07:38:37,753 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-19 07:38:37,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:38:37,754 INFO L85 PathProgramCache]: Analyzing trace with hash -2053365370, now seen corresponding path program 1 times
[2023-11-19 07:38:37,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:38:37,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750065335]
[2023-11-19 07:38:37,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:38:37,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:38:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:39,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:38:39,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:38:39,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750065335]
[2023-11-19 07:38:39,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750065335] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:38:39,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:38:39,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2023-11-19 07:38:39,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643753428]
[2023-11-19 07:38:39,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:38:39,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-11-19 07:38:39,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:38:39,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-11-19 07:38:39,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2023-11-19 07:38:39,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 209
[2023-11-19 07:38:39,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 36 transitions, 247 flow. Second operand has 9 states, 9 states have (on average 93.11111111111111) internal successors, (838), 9 states have internal predecessors, (838), 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)
[2023-11-19 07:38:39,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:38:39,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 209
[2023-11-19 07:38:39,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:38:39,970 INFO L124 PetriNetUnfolderBase]: 192/394 cut-off events.
[2023-11-19 07:38:39,970 INFO L125 PetriNetUnfolderBase]: For 1078/1078 co-relation queries the response was YES.
[2023-11-19 07:38:39,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1759 conditions, 394 events. 192/394 cut-off events. For 1078/1078 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1687 event pairs, 61 based on Foata normal form. 1/391 useless extension candidates. Maximal degree in co-relation 1735. Up to 161 conditions per place.
[2023-11-19 07:38:39,974 INFO L140 encePairwiseOnDemand]: 203/209 looper letters, 42 selfloop transitions, 6 changer transitions 32/82 dead transitions.
[2023-11-19 07:38:39,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 82 transitions, 762 flow
[2023-11-19 07:38:39,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-11-19 07:38:39,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-19 07:38:39,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 595 transitions.
[2023-11-19 07:38:39,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.474481658692185
[2023-11-19 07:38:39,979 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 595 transitions.
[2023-11-19 07:38:39,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 595 transitions.
[2023-11-19 07:38:39,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:38:39,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 595 transitions.
[2023-11-19 07:38:39,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 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)
[2023-11-19 07:38:39,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 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)
[2023-11-19 07:38:39,987 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 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)
[2023-11-19 07:38:39,988 INFO L175 Difference]: Start difference. First operand has 58 places, 36 transitions, 247 flow. Second operand 6 states and 595 transitions.
[2023-11-19 07:38:39,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 82 transitions, 762 flow
[2023-11-19 07:38:39,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 82 transitions, 616 flow, removed 39 selfloop flow, removed 7 redundant places.
[2023-11-19 07:38:39,997 INFO L231 Difference]: Finished difference. Result has 57 places, 32 transitions, 197 flow
[2023-11-19 07:38:39,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=197, PETRI_PLACES=57, PETRI_TRANSITIONS=32}
[2023-11-19 07:38:39,999 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 24 predicate places.
[2023-11-19 07:38:39,999 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 32 transitions, 197 flow
[2023-11-19 07:38:40,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.11111111111111) internal successors, (838), 9 states have internal predecessors, (838), 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)
[2023-11-19 07:38:40,000 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:38:40,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:38:40,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-11-19 07:38:40,001 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-19 07:38:40,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:38:40,002 INFO L85 PathProgramCache]: Analyzing trace with hash -454775138, now seen corresponding path program 2 times
[2023-11-19 07:38:40,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:38:40,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234271085]
[2023-11-19 07:38:40,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:38:40,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:38:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 07:38:40,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-19 07:38:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 07:38:40,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-19 07:38:40,231 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2023-11-19 07:38:40,233 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining)
[2023-11-19 07:38:40,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining)
[2023-11-19 07:38:40,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining)
[2023-11-19 07:38:40,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining)
[2023-11-19 07:38:40,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining)
[2023-11-19 07:38:40,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining)
[2023-11-19 07:38:40,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-11-19 07:38:40,237 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:38:40,244 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-11-19 07:38:40,244 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2023-11-19 07:38:40,316 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated
[2023-11-19 07:38:40,319 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2023-11-19 07:38:40,321 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
[2023-11-19 07:38:40,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:38:40 BasicIcfg
[2023-11-19 07:38:40,351 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-19 07:38:40,353 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2023-11-19 07:38:40,354 INFO L270 PluginConnector]: Initializing Witness Printer...
[2023-11-19 07:38:40,354 INFO L274 PluginConnector]: Witness Printer initialized
[2023-11-19 07:38:40,354 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:38:22" (3/4) ...
[2023-11-19 07:38:40,355 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample
[2023-11-19 07:38:40,386 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated
[2023-11-19 07:38:40,387 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2023-11-19 07:38:40,388 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
[2023-11-19 07:38:40,455 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e07261-4ce3-46a2-a4f1-09956a0bdb12/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml
[2023-11-19 07:38:40,455 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-11-19 07:38:40,456 INFO L158 Benchmark]: Toolchain (without parser) took 19330.47ms. Allocated memory was 130.0MB in the beginning and 394.3MB in the end (delta: 264.2MB). Free memory was 90.9MB in the beginning and 281.6MB in the end (delta: -190.7MB). Peak memory consumption was 74.8MB. Max. memory is 16.1GB.
[2023-11-19 07:38:40,456 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 98.6MB. Free memory was 49.2MB in the beginning and 49.0MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 16.1GB.
[2023-11-19 07:38:40,457 INFO L158 Benchmark]: CACSL2BoogieTranslator took 702.52ms. Allocated memory is still 130.0MB. Free memory was 90.9MB in the beginning and 67.5MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
[2023-11-19 07:38:40,457 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.56ms. Allocated memory is still 130.0MB. Free memory was 67.5MB in the beginning and 64.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2023-11-19 07:38:40,457 INFO L158 Benchmark]: Boogie Preprocessor took 36.63ms. Allocated memory is still 130.0MB. Free memory was 64.6MB in the beginning and 62.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB.
[2023-11-19 07:38:40,458 INFO L158 Benchmark]: RCFGBuilder took 912.49ms. Allocated memory is still 130.0MB. Free memory was 62.8MB in the beginning and 69.2MB in the end (delta: -6.4MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB.
[2023-11-19 07:38:40,458 INFO L158 Benchmark]: TraceAbstraction took 17472.01ms. Allocated memory was 130.0MB in the beginning and 394.3MB in the end (delta: 264.2MB). Free memory was 68.6MB in the beginning and 291.0MB in the end (delta: -222.5MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB.
[2023-11-19 07:38:40,459 INFO L158 Benchmark]: Witness Printer took 102.04ms. Allocated memory is still 394.3MB. Free memory was 291.0MB in the beginning and 281.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2023-11-19 07:38:40,461 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.52ms. Allocated memory is still 98.6MB. Free memory was 49.2MB in the beginning and 49.0MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 702.52ms. Allocated memory is still 130.0MB. Free memory was 90.9MB in the beginning and 67.5MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 92.56ms. Allocated memory is still 130.0MB. Free memory was 67.5MB in the beginning and 64.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 36.63ms. Allocated memory is still 130.0MB. Free memory was 64.6MB in the beginning and 62.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 912.49ms. Allocated memory is still 130.0MB. Free memory was 62.8MB in the beginning and 69.2MB in the end (delta: -6.4MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB.
* TraceAbstraction took 17472.01ms. Allocated memory was 130.0MB in the beginning and 394.3MB in the end (delta: 264.2MB). Free memory was 68.6MB in the beginning and 291.0MB in the end (delta: -222.5MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB.
* Witness Printer took 102.04ms. Allocated memory is still 394.3MB. Free memory was 291.0MB in the beginning and 281.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
- GenericResult: Unfinished Backtranslation
The program execution was not completely translated back.
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
- GenericResult: Unfinished Backtranslation
The program execution was not completely translated back.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 5.3s, 115 PlacesBefore, 33 PlacesAfterwards, 108 TransitionsBefore, 23 TransitionsAfterwards, 2190 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 98 TotalNumberOfCompositions, 5208 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2458, independent: 2281, independent conditional: 0, independent unconditional: 2281, dependent: 177, dependent conditional: 0, dependent unconditional: 177, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1100, independent: 1063, independent conditional: 0, independent unconditional: 1063, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2458, independent: 1218, independent conditional: 0, independent unconditional: 1218, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 1100, unknown conditional: 0, unknown unconditional: 1100] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 59, Positive conditional cache size: 0, Positive unconditional cache size: 59, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
[L711] 0 int __unbuffered_p0_EAX = 0;
[L713] 0 int __unbuffered_p2_EAX = 0;
[L714] 0 _Bool main$tmp_guard0;
[L715] 0 _Bool main$tmp_guard1;
[L717] 0 int x = 0;
[L718] 0 _Bool x$flush_delayed;
[L719] 0 int x$mem_tmp;
[L720] 0 _Bool x$r_buff0_thd0;
[L721] 0 _Bool x$r_buff0_thd1;
[L722] 0 _Bool x$r_buff0_thd2;
[L723] 0 _Bool x$r_buff0_thd3;
[L724] 0 _Bool x$r_buff1_thd0;
[L725] 0 _Bool x$r_buff1_thd1;
[L726] 0 _Bool x$r_buff1_thd2;
[L727] 0 _Bool x$r_buff1_thd3;
[L728] 0 _Bool x$read_delayed;
[L729] 0 int *x$read_delayed_var;
[L730] 0 int x$w_buff0;
[L731] 0 _Bool x$w_buff0_used;
[L732] 0 int x$w_buff1;
[L733] 0 _Bool x$w_buff1_used;
[L735] 0 int y = 0;
[L736] 0 _Bool weak$$choice0;
[L737] 0 _Bool weak$$choice2;
[L818] 0 pthread_t t1804;
[L819] FCALL, FORK 0 pthread_create(&t1804, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1804={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L820] 0 pthread_t t1805;
[L821] FCALL, FORK 0 pthread_create(&t1805, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1804={5:0}, t1805={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L822] 0 pthread_t t1806;
[L823] FCALL, FORK 0 pthread_create(&t1806, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1804={5:0}, t1805={6:0}, t1806={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L761] 2 x$w_buff1 = x$w_buff0
[L762] 2 x$w_buff0 = 2
[L763] 2 x$w_buff1_used = x$w_buff0_used
[L764] 2 x$w_buff0_used = (_Bool)1
[L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L18] COND FALSE 2 !(!expression)
[L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0
[L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1
[L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2
[L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3
[L770] 2 x$r_buff0_thd2 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0: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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L773] 2 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0: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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1]
[L790] 3 __unbuffered_p2_EAX = y
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1]
[L793] 3 y = 2
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2]
[L741] 1 __unbuffered_p0_EAX = y
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0: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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2]
[L744] 1 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0: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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
[L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0: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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2]
[L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L785] 2 return 0;
[L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0: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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2]
[L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1
[L805] 3 return 0;
[L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0: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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2]
[L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L756] 1 return 0;
[L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3
[L827] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L827] RET 0 assume_abort_if_not(main$tmp_guard0)
[L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804={5:0}, t1805={6:0}, t1806={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2]
[L836] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L837] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L838] 0 x$flush_delayed = weak$$choice2
[L839] 0 x$mem_tmp = x
[L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1)
[L848] 0 x = x$flush_delayed ? x$mem_tmp : x
[L849] 0 x$flush_delayed = (_Bool)0
[L851] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
[L18] 0 reach_error()
VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=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: 821]: 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: 823]: 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: 819]: 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, 137 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: 17.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 526 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 367 mSDsluCounter, 270 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 161 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1091 IncrementalHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 109 mSDtfsCounter, 1091 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=296occurred in iteration=5, InterpolantAutomatonStates: 60, 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.4s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 1634 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2023-11-19 07:38:40,513 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e07261-4ce3-46a2-a4f1-09956a0bdb12/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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