./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix017_power.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_6d848dba-211b-4faa-9172-239e3ce294bf/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d848dba-211b-4faa-9172-239e3ce294bf/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_6d848dba-211b-4faa-9172-239e3ce294bf/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d848dba-211b-4faa-9172-239e3ce294bf/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix017_power.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d848dba-211b-4faa-9172-239e3ce294bf/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_6d848dba-211b-4faa-9172-239e3ce294bf/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 c394bf0b454616c76d3ba114fe7f9b161b2a3a1a85dec23beec05d3a021c1c91
--- Real Ultimate output ---
This is Ultimate 0.2.3-dev-9bd2c7f
[2023-11-19 07:51:07,408 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2023-11-19 07:51:07,488 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d848dba-211b-4faa-9172-239e3ce294bf/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf
[2023-11-19 07:51:07,493 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2023-11-19 07:51:07,493 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-19 07:51:07,520 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-19 07:51:07,521 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-19 07:51:07,522 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-19 07:51:07,523 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-19 07:51:07,523 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-19 07:51:07,524 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-19 07:51:07,525 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2023-11-19 07:51:07,525 INFO L153 SettingsManager]: * Use SBE=true
[2023-11-19 07:51:07,526 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-19 07:51:07,526 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2023-11-19 07:51:07,527 INFO L153 SettingsManager]: * sizeof long=4
[2023-11-19 07:51:07,527 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2023-11-19 07:51:07,528 INFO L153 SettingsManager]: * sizeof POINTER=4
[2023-11-19 07:51:07,528 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2023-11-19 07:51:07,529 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2023-11-19 07:51:07,529 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-19 07:51:07,530 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2023-11-19 07:51:07,530 INFO L153 SettingsManager]: * sizeof long double=12
[2023-11-19 07:51:07,531 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2023-11-19 07:51:07,531 INFO L153 SettingsManager]: * Use constant arrays=true
[2023-11-19 07:51:07,532 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-19 07:51:07,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-11-19 07:51:07,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2023-11-19 07:51:07,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:51:07,533 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-19 07:51:07,534 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-11-19 07:51:07,534 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2023-11-19 07:51:07,535 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2023-11-19 07:51:07,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-19 07:51:07,535 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-19 07:51:07,536 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-19 07:51:07,536 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-11-19 07:51:07,536 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-19 07:51:07,537 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-19 07:51:07,537 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_6d848dba-211b-4faa-9172-239e3ce294bf/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_6d848dba-211b-4faa-9172-239e3ce294bf/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 -> c394bf0b454616c76d3ba114fe7f9b161b2a3a1a85dec23beec05d3a021c1c91
[2023-11-19 07:51:07,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-19 07:51:07,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-19 07:51:07,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-19 07:51:07,975 INFO L270 PluginConnector]: Initializing CDTParser...
[2023-11-19 07:51:07,976 INFO L274 PluginConnector]: CDTParser initialized
[2023-11-19 07:51:07,977 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d848dba-211b-4faa-9172-239e3ce294bf/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix017_power.opt_rmo.opt.i
[2023-11-19 07:51:11,041 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2023-11-19 07:51:11,425 INFO L384 CDTParser]: Found 1 translation units.
[2023-11-19 07:51:11,429 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d848dba-211b-4faa-9172-239e3ce294bf/sv-benchmarks/c/pthread-wmm/mix017_power.opt_rmo.opt.i
[2023-11-19 07:51:11,455 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d848dba-211b-4faa-9172-239e3ce294bf/bin/uautomizer-verify-uCwYo4JHxu/data/24814e65c/994ffd21c78c440887989cb097e09daf/FLAGa9e146c72
[2023-11-19 07:51:11,473 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d848dba-211b-4faa-9172-239e3ce294bf/bin/uautomizer-verify-uCwYo4JHxu/data/24814e65c/994ffd21c78c440887989cb097e09daf
[2023-11-19 07:51:11,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-19 07:51:11,482 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-19 07:51:11,484 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-19 07:51:11,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-19 07:51:11,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-19 07:51:11,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:51:11" (1/1) ...
[2023-11-19 07:51:11,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36a435dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:51:11, skipping insertion in model container
[2023-11-19 07:51:11,494 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:51:11" (1/1) ...
[2023-11-19 07:51:11,602 INFO L177 MainTranslator]: Built tables and reachable declarations
[2023-11-19 07:51:11,819 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_6d848dba-211b-4faa-9172-239e3ce294bf/sv-benchmarks/c/pthread-wmm/mix017_power.opt_rmo.opt.i[958,971]
[2023-11-19 07:51:12,041 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:51:12,055 INFO L202 MainTranslator]: Completed pre-run
[2023-11-19 07:51:12,070 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_6d848dba-211b-4faa-9172-239e3ce294bf/sv-benchmarks/c/pthread-wmm/mix017_power.opt_rmo.opt.i[958,971]
[2023-11-19 07:51:12,143 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:51:12,184 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-11-19 07:51:12,184 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-11-19 07:51:12,191 INFO L206 MainTranslator]: Completed translation
[2023-11-19 07:51:12,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:51:12 WrapperNode
[2023-11-19 07:51:12,192 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-19 07:51:12,193 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-19 07:51:12,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-19 07:51:12,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-19 07:51:12,201 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:51:12" (1/1) ...
[2023-11-19 07:51:12,239 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:51:12" (1/1) ...
[2023-11-19 07:51:12,283 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145
[2023-11-19 07:51:12,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-19 07:51:12,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-19 07:51:12,296 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-19 07:51:12,297 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2023-11-19 07:51:12,307 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:51:12" (1/1) ...
[2023-11-19 07:51:12,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:51:12" (1/1) ...
[2023-11-19 07:51:12,329 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:51:12" (1/1) ...
[2023-11-19 07:51:12,329 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:51:12" (1/1) ...
[2023-11-19 07:51:12,340 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:51:12" (1/1) ...
[2023-11-19 07:51:12,342 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:51:12" (1/1) ...
[2023-11-19 07:51:12,345 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:51:12" (1/1) ...
[2023-11-19 07:51:12,348 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:51:12" (1/1) ...
[2023-11-19 07:51:12,352 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-19 07:51:12,353 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-19 07:51:12,354 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2023-11-19 07:51:12,354 INFO L274 PluginConnector]: RCFGBuilder initialized
[2023-11-19 07:51:12,355 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:51:12" (1/1) ...
[2023-11-19 07:51:12,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:51:12,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d848dba-211b-4faa-9172-239e3ce294bf/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 07:51:12,411 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d848dba-211b-4faa-9172-239e3ce294bf/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:51:12,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d848dba-211b-4faa-9172-239e3ce294bf/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:51:12,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2023-11-19 07:51:12,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-11-19 07:51:12,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-19 07:51:12,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-19 07:51:12,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-19 07:51:12,449 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2023-11-19 07:51:12,449 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2023-11-19 07:51:12,449 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2023-11-19 07:51:12,449 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2023-11-19 07:51:12,449 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2023-11-19 07:51:12,449 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2023-11-19 07:51:12,450 INFO L130 BoogieDeclarations]: Found specification of procedure P3
[2023-11-19 07:51:12,450 INFO L138 BoogieDeclarations]: Found implementation of procedure P3
[2023-11-19 07:51:12,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-19 07:51:12,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-11-19 07:51:12,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-19 07:51:12,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-19 07:51:12,452 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:51:12,629 INFO L236 CfgBuilder]: Building ICFG
[2023-11-19 07:51:12,631 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-19 07:51:13,123 INFO L277 CfgBuilder]: Performing block encoding
[2023-11-19 07:51:13,301 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-19 07:51:13,301 INFO L302 CfgBuilder]: Removed 0 assume(true) statements.
[2023-11-19 07:51:13,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:51:13 BoogieIcfgContainer
[2023-11-19 07:51:13,308 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-19 07:51:13,314 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-19 07:51:13,314 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2023-11-19 07:51:13,317 INFO L274 PluginConnector]: TraceAbstraction initialized
[2023-11-19 07:51:13,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:51:11" (1/3) ...
[2023-11-19 07:51:13,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5a44e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:51:13, skipping insertion in model container
[2023-11-19 07:51:13,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:51:12" (2/3) ...
[2023-11-19 07:51:13,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5a44e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:51:13, skipping insertion in model container
[2023-11-19 07:51:13,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:51:13" (3/3) ...
[2023-11-19 07:51:13,323 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017_power.opt_rmo.opt.i
[2023-11-19 07:51:13,333 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-11-19 07:51:13,344 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-19 07:51:13,344 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2023-11-19 07:51:13,345 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-19 07:51:13,419 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-11-19 07:51:13,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 135 transitions, 286 flow
[2023-11-19 07:51:13,533 INFO L124 PetriNetUnfolderBase]: 2/131 cut-off events.
[2023-11-19 07:51:13,533 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:51:13,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 131 events. 2/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place.
[2023-11-19 07:51:13,541 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 135 transitions, 286 flow
[2023-11-19 07:51:13,547 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 131 transitions, 274 flow
[2023-11-19 07:51:13,551 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-19 07:51:13,562 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 131 transitions, 274 flow
[2023-11-19 07:51:13,565 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 131 transitions, 274 flow
[2023-11-19 07:51:13,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 274 flow
[2023-11-19 07:51:13,602 INFO L124 PetriNetUnfolderBase]: 2/131 cut-off events.
[2023-11-19 07:51:13,602 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:51:13,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 131 events. 2/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place.
[2023-11-19 07:51:13,607 INFO L119 LiptonReduction]: Number of co-enabled transitions 3376
[2023-11-19 07:51:18,810 INFO L134 LiptonReduction]: Checked pairs total: 7624
[2023-11-19 07:51:18,811 INFO L136 LiptonReduction]: Total number of compositions: 111
[2023-11-19 07:51:18,827 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-19 07:51:18,835 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;@4bbd8767, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-19 07:51:18,835 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2023-11-19 07:51:18,840 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-11-19 07:51:18,840 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events.
[2023-11-19 07:51:18,840 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:51:18,841 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:51:18,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:51:18,842 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-19 07:51:18,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:51:18,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1944234757, now seen corresponding path program 1 times
[2023-11-19 07:51:18,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:51:18,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154221444]
[2023-11-19 07:51:18,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:51:18,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:51:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:51:19,424 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:51:19,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:51:19,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154221444]
[2023-11-19 07:51:19,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154221444] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:51:19,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:51:19,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-19 07:51:19,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60643799]
[2023-11-19 07:51:19,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:51:19,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:51:19,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:51:19,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:51:19,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:51:19,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 246
[2023-11-19 07:51:19,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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:51:19,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:51:19,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 246
[2023-11-19 07:51:19,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:51:20,548 INFO L124 PetriNetUnfolderBase]: 3415/5055 cut-off events.
[2023-11-19 07:51:20,549 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES.
[2023-11-19 07:51:20,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9883 conditions, 5055 events. 3415/5055 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 28479 event pairs, 649 based on Foata normal form. 0/4826 useless extension candidates. Maximal degree in co-relation 9871. Up to 3703 conditions per place.
[2023-11-19 07:51:20,595 INFO L140 encePairwiseOnDemand]: 242/246 looper letters, 35 selfloop transitions, 2 changer transitions 2/43 dead transitions.
[2023-11-19 07:51:20,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 179 flow
[2023-11-19 07:51:20,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:51:20,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-19 07:51:20,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions.
[2023-11-19 07:51:20,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5487804878048781
[2023-11-19 07:51:20,613 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions.
[2023-11-19 07:51:20,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions.
[2023-11-19 07:51:20,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:51:20,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions.
[2023-11-19 07:51:20,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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:51:20,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 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:51:20,630 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 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:51:20,632 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 405 transitions.
[2023-11-19 07:51:20,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 179 flow
[2023-11-19 07:51:20,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 174 flow, removed 0 selfloop flow, removed 4 redundant places.
[2023-11-19 07:51:20,640 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 66 flow
[2023-11-19 07:51:20,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=27}
[2023-11-19 07:51:20,645 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places.
[2023-11-19 07:51:20,646 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 66 flow
[2023-11-19 07:51:20,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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:51:20,647 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:51:20,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:51:20,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-19 07:51:20,647 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-19 07:51:20,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:51:20,648 INFO L85 PathProgramCache]: Analyzing trace with hash -330211665, now seen corresponding path program 1 times
[2023-11-19 07:51:20,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:51:20,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180783137]
[2023-11-19 07:51:20,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:51:20,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:51:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:51:21,031 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:51:21,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:51:21,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180783137]
[2023-11-19 07:51:21,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180783137] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:51:21,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:51:21,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:51:21,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928370169]
[2023-11-19 07:51:21,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:51:21,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:51:21,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:51:21,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:51:21,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:51:21,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 246
[2023-11-19 07:51:21,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 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:51:21,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:51:21,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 246
[2023-11-19 07:51:21,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:51:22,920 INFO L124 PetriNetUnfolderBase]: 8375/11424 cut-off events.
[2023-11-19 07:51:22,920 INFO L125 PetriNetUnfolderBase]: For 588/588 co-relation queries the response was YES.
[2023-11-19 07:51:22,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23646 conditions, 11424 events. 8375/11424 cut-off events. For 588/588 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 53630 event pairs, 3715 based on Foata normal form. 480/11904 useless extension candidates. Maximal degree in co-relation 23636. Up to 9713 conditions per place.
[2023-11-19 07:51:23,065 INFO L140 encePairwiseOnDemand]: 239/246 looper letters, 38 selfloop transitions, 5 changer transitions 24/67 dead transitions.
[2023-11-19 07:51:23,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 67 transitions, 292 flow
[2023-11-19 07:51:23,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-19 07:51:23,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-11-19 07:51:23,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions.
[2023-11-19 07:51:23,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4991869918699187
[2023-11-19 07:51:23,072 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 614 transitions.
[2023-11-19 07:51:23,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 614 transitions.
[2023-11-19 07:51:23,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:51:23,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 614 transitions.
[2023-11-19 07:51:23,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 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:51:23,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 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:51:23,087 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 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:51:23,087 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 5 states and 614 transitions.
[2023-11-19 07:51:23,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 67 transitions, 292 flow
[2023-11-19 07:51:23,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 67 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-19 07:51:23,093 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 107 flow
[2023-11-19 07:51:23,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=43, PETRI_TRANSITIONS=31}
[2023-11-19 07:51:23,101 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places.
[2023-11-19 07:51:23,101 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 107 flow
[2023-11-19 07:51:23,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 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:51:23,102 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:51:23,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:51:23,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-19 07:51:23,103 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-19 07:51:23,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:51:23,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1592463598, now seen corresponding path program 1 times
[2023-11-19 07:51:23,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:51:23,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267416801]
[2023-11-19 07:51:23,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:51:23,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:51:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:51:23,349 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:51:23,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:51:23,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267416801]
[2023-11-19 07:51:23,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267416801] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:51:23,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:51:23,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:51:23,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353794410]
[2023-11-19 07:51:23,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:51:23,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-19 07:51:23,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:51:23,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-19 07:51:23,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-11-19 07:51:23,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 246
[2023-11-19 07:51:23,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 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:51:23,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:51:23,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 246
[2023-11-19 07:51:23,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:51:24,939 INFO L124 PetriNetUnfolderBase]: 7439/10152 cut-off events.
[2023-11-19 07:51:24,939 INFO L125 PetriNetUnfolderBase]: For 5755/5755 co-relation queries the response was YES.
[2023-11-19 07:51:24,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25941 conditions, 10152 events. 7439/10152 cut-off events. For 5755/5755 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 45957 event pairs, 1907 based on Foata normal form. 432/10584 useless extension candidates. Maximal degree in co-relation 25928. Up to 6401 conditions per place.
[2023-11-19 07:51:25,030 INFO L140 encePairwiseOnDemand]: 242/246 looper letters, 40 selfloop transitions, 3 changer transitions 26/69 dead transitions.
[2023-11-19 07:51:25,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 69 transitions, 363 flow
[2023-11-19 07:51:25,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-19 07:51:25,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-11-19 07:51:25,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions.
[2023-11-19 07:51:25,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4975609756097561
[2023-11-19 07:51:25,035 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 612 transitions.
[2023-11-19 07:51:25,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 612 transitions.
[2023-11-19 07:51:25,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:51:25,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 612 transitions.
[2023-11-19 07:51:25,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 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:51:25,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 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:51:25,045 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 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:51:25,045 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 107 flow. Second operand 5 states and 612 transitions.
[2023-11-19 07:51:25,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 69 transitions, 363 flow
[2023-11-19 07:51:25,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 69 transitions, 356 flow, removed 1 selfloop flow, removed 2 redundant places.
[2023-11-19 07:51:25,129 INFO L231 Difference]: Finished difference. Result has 46 places, 31 transitions, 115 flow
[2023-11-19 07:51:25,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=46, PETRI_TRANSITIONS=31}
[2023-11-19 07:51:25,130 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places.
[2023-11-19 07:51:25,131 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 115 flow
[2023-11-19 07:51:25,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 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:51:25,132 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:51:25,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:51:25,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-19 07:51:25,133 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-19 07:51:25,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:51:25,133 INFO L85 PathProgramCache]: Analyzing trace with hash 439086541, now seen corresponding path program 1 times
[2023-11-19 07:51:25,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:51:25,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123871645]
[2023-11-19 07:51:25,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:51:25,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:51:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:51:25,312 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:51:25,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:51:25,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123871645]
[2023-11-19 07:51:25,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123871645] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:51:25,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:51:25,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:51:25,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118504694]
[2023-11-19 07:51:25,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:51:25,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:51:25,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:51:25,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:51:25,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:51:25,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 246
[2023-11-19 07:51:25,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 31 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 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:51:25,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:51:25,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 246
[2023-11-19 07:51:25,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:51:26,326 INFO L124 PetriNetUnfolderBase]: 3496/5171 cut-off events.
[2023-11-19 07:51:26,326 INFO L125 PetriNetUnfolderBase]: For 2351/2490 co-relation queries the response was YES.
[2023-11-19 07:51:26,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12489 conditions, 5171 events. 3496/5171 cut-off events. For 2351/2490 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 27720 event pairs, 686 based on Foata normal form. 336/5351 useless extension candidates. Maximal degree in co-relation 12473. Up to 3511 conditions per place.
[2023-11-19 07:51:26,373 INFO L140 encePairwiseOnDemand]: 239/246 looper letters, 55 selfloop transitions, 10 changer transitions 0/72 dead transitions.
[2023-11-19 07:51:26,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 72 transitions, 347 flow
[2023-11-19 07:51:26,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-19 07:51:26,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-11-19 07:51:26,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 640 transitions.
[2023-11-19 07:51:26,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5203252032520326
[2023-11-19 07:51:26,377 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 640 transitions.
[2023-11-19 07:51:26,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 640 transitions.
[2023-11-19 07:51:26,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:51:26,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 640 transitions.
[2023-11-19 07:51:26,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 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:51:26,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 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:51:26,385 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 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:51:26,385 INFO L175 Difference]: Start difference. First operand has 46 places, 31 transitions, 115 flow. Second operand 5 states and 640 transitions.
[2023-11-19 07:51:26,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 72 transitions, 347 flow
[2023-11-19 07:51:26,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 72 transitions, 337 flow, removed 2 selfloop flow, removed 4 redundant places.
[2023-11-19 07:51:26,403 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 180 flow
[2023-11-19 07:51:26,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=180, PETRI_PLACES=47, PETRI_TRANSITIONS=40}
[2023-11-19 07:51:26,405 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places.
[2023-11-19 07:51:26,405 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 180 flow
[2023-11-19 07:51:26,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 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:51:26,407 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:51:26,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:51:26,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-19 07:51:26,407 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-19 07:51:26,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:51:26,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1541523592, now seen corresponding path program 1 times
[2023-11-19 07:51:26,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:51:26,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374054980]
[2023-11-19 07:51:26,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:51:26,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:51:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:51:26,603 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:51:26,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:51:26,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374054980]
[2023-11-19 07:51:26,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374054980] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:51:26,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:51:26,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 07:51:26,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189183477]
[2023-11-19 07:51:26,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:51:26,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-19 07:51:26,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:51:26,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-19 07:51:26,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-11-19 07:51:26,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 246
[2023-11-19 07:51:26,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 180 flow. Second operand has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 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:51:26,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:51:26,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 246
[2023-11-19 07:51:26,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:51:27,470 INFO L124 PetriNetUnfolderBase]: 2560/3974 cut-off events.
[2023-11-19 07:51:27,470 INFO L125 PetriNetUnfolderBase]: For 2825/2918 co-relation queries the response was YES.
[2023-11-19 07:51:27,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11975 conditions, 3974 events. 2560/3974 cut-off events. For 2825/2918 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 21986 event pairs, 318 based on Foata normal form. 227/4092 useless extension candidates. Maximal degree in co-relation 11958. Up to 1302 conditions per place.
[2023-11-19 07:51:27,506 INFO L140 encePairwiseOnDemand]: 239/246 looper letters, 73 selfloop transitions, 19 changer transitions 0/99 dead transitions.
[2023-11-19 07:51:27,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 99 transitions, 564 flow
[2023-11-19 07:51:27,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-11-19 07:51:27,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-19 07:51:27,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 897 transitions.
[2023-11-19 07:51:27,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5209059233449478
[2023-11-19 07:51:27,511 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 897 transitions.
[2023-11-19 07:51:27,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 897 transitions.
[2023-11-19 07:51:27,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:51:27,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 897 transitions.
[2023-11-19 07:51:27,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.14285714285714) internal successors, (897), 7 states have internal predecessors, (897), 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:51:27,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 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:51:27,521 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 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:51:27,521 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 180 flow. Second operand 7 states and 897 transitions.
[2023-11-19 07:51:27,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 99 transitions, 564 flow
[2023-11-19 07:51:27,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 99 transitions, 559 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-19 07:51:27,534 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 309 flow
[2023-11-19 07:51:27,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=309, PETRI_PLACES=55, PETRI_TRANSITIONS=49}
[2023-11-19 07:51:27,537 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places.
[2023-11-19 07:51:27,538 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 309 flow
[2023-11-19 07:51:27,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 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:51:27,538 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:51:27,538 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]
[2023-11-19 07:51:27,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-19 07:51:27,539 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-19 07:51:27,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:51:27,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1221811233, now seen corresponding path program 1 times
[2023-11-19 07:51:27,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:51:27,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120308926]
[2023-11-19 07:51:27,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:51:27,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:51:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:51:27,795 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:51:27,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:51:27,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120308926]
[2023-11-19 07:51:27,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120308926] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:51:27,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:51:27,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-19 07:51:27,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992157281]
[2023-11-19 07:51:27,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:51:27,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-19 07:51:27,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:51:27,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-19 07:51:27,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2023-11-19 07:51:27,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 246
[2023-11-19 07:51:27,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 309 flow. Second operand has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 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:51:27,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:51:27,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 246
[2023-11-19 07:51:27,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:51:28,503 INFO L124 PetriNetUnfolderBase]: 2220/3473 cut-off events.
[2023-11-19 07:51:28,503 INFO L125 PetriNetUnfolderBase]: For 5120/5208 co-relation queries the response was YES.
[2023-11-19 07:51:28,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12331 conditions, 3473 events. 2220/3473 cut-off events. For 5120/5208 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 19300 event pairs, 240 based on Foata normal form. 85/3461 useless extension candidates. Maximal degree in co-relation 12310. Up to 1195 conditions per place.
[2023-11-19 07:51:28,542 INFO L140 encePairwiseOnDemand]: 239/246 looper letters, 80 selfloop transitions, 28 changer transitions 9/124 dead transitions.
[2023-11-19 07:51:28,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 124 transitions, 835 flow
[2023-11-19 07:51:28,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2023-11-19 07:51:28,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2023-11-19 07:51:28,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1152 transitions.
[2023-11-19 07:51:28,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5203252032520326
[2023-11-19 07:51:28,548 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1152 transitions.
[2023-11-19 07:51:28,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1152 transitions.
[2023-11-19 07:51:28,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:51:28,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1152 transitions.
[2023-11-19 07:51:28,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 128.0) internal successors, (1152), 9 states have internal predecessors, (1152), 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:51:28,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 246.0) internal successors, (2460), 10 states have internal predecessors, (2460), 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:51:28,559 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 246.0) internal successors, (2460), 10 states have internal predecessors, (2460), 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:51:28,559 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 309 flow. Second operand 9 states and 1152 transitions.
[2023-11-19 07:51:28,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 124 transitions, 835 flow
[2023-11-19 07:51:28,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 124 transitions, 785 flow, removed 17 selfloop flow, removed 3 redundant places.
[2023-11-19 07:51:28,715 INFO L231 Difference]: Finished difference. Result has 63 places, 58 transitions, 437 flow
[2023-11-19 07:51:28,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=437, PETRI_PLACES=63, PETRI_TRANSITIONS=58}
[2023-11-19 07:51:28,717 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places.
[2023-11-19 07:51:28,717 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 437 flow
[2023-11-19 07:51:28,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 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:51:28,718 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:51:28,718 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, 1, 1]
[2023-11-19 07:51:28,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-19 07:51:28,718 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-19 07:51:28,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:51:28,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1912793972, now seen corresponding path program 1 times
[2023-11-19 07:51:28,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:51:28,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068655617]
[2023-11-19 07:51:28,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:51:28,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:51:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:51:29,018 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:51:29,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:51:29,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068655617]
[2023-11-19 07:51:29,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068655617] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:51:29,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:51:29,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 07:51:29,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384512224]
[2023-11-19 07:51:29,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:51:29,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-19 07:51:29,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:51:29,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-19 07:51:29,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-11-19 07:51:29,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 246
[2023-11-19 07:51:29,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 58 transitions, 437 flow. Second operand has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 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:51:29,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:51:29,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 246
[2023-11-19 07:51:29,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:51:29,980 INFO L124 PetriNetUnfolderBase]: 4656/6865 cut-off events.
[2023-11-19 07:51:29,980 INFO L125 PetriNetUnfolderBase]: For 18914/18914 co-relation queries the response was YES.
[2023-11-19 07:51:30,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26119 conditions, 6865 events. 4656/6865 cut-off events. For 18914/18914 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 35510 event pairs, 716 based on Foata normal form. 17/6882 useless extension candidates. Maximal degree in co-relation 26095. Up to 4380 conditions per place.
[2023-11-19 07:51:30,030 INFO L140 encePairwiseOnDemand]: 237/246 looper letters, 98 selfloop transitions, 14 changer transitions 62/174 dead transitions.
[2023-11-19 07:51:30,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 174 transitions, 1624 flow
[2023-11-19 07:51:30,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-11-19 07:51:30,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-19 07:51:30,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 850 transitions.
[2023-11-19 07:51:30,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49361207897793263
[2023-11-19 07:51:30,034 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 850 transitions.
[2023-11-19 07:51:30,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 850 transitions.
[2023-11-19 07:51:30,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:51:30,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 850 transitions.
[2023-11-19 07:51:30,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.42857142857143) internal successors, (850), 7 states have internal predecessors, (850), 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:51:30,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 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:51:30,043 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 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:51:30,043 INFO L175 Difference]: Start difference. First operand has 63 places, 58 transitions, 437 flow. Second operand 7 states and 850 transitions.
[2023-11-19 07:51:30,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 174 transitions, 1624 flow
[2023-11-19 07:51:30,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 174 transitions, 1355 flow, removed 94 selfloop flow, removed 4 redundant places.
[2023-11-19 07:51:30,518 INFO L231 Difference]: Finished difference. Result has 69 places, 51 transitions, 335 flow
[2023-11-19 07:51:30,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=335, PETRI_PLACES=69, PETRI_TRANSITIONS=51}
[2023-11-19 07:51:30,519 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places.
[2023-11-19 07:51:30,519 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 51 transitions, 335 flow
[2023-11-19 07:51:30,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 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:51:30,520 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:51:30,520 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, 1, 1]
[2023-11-19 07:51:30,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-19 07:51:30,521 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-19 07:51:30,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:51:30,521 INFO L85 PathProgramCache]: Analyzing trace with hash 208070426, now seen corresponding path program 2 times
[2023-11-19 07:51:30,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:51:30,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119231332]
[2023-11-19 07:51:30,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:51:30,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:51:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:51:30,821 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:51:30,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:51:30,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119231332]
[2023-11-19 07:51:30,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119231332] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:51:30,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:51:30,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-19 07:51:30,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097971942]
[2023-11-19 07:51:30,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:51:30,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-19 07:51:30,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:51:30,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-19 07:51:30,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2023-11-19 07:51:30,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 246
[2023-11-19 07:51:30,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 51 transitions, 335 flow. Second operand has 6 states, 6 states have (on average 110.83333333333333) internal successors, (665), 6 states have internal predecessors, (665), 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:51:30,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:51:30,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 246
[2023-11-19 07:51:30,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:51:31,563 INFO L124 PetriNetUnfolderBase]: 2205/3360 cut-off events.
[2023-11-19 07:51:31,563 INFO L125 PetriNetUnfolderBase]: For 8622/8622 co-relation queries the response was YES.
[2023-11-19 07:51:31,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13048 conditions, 3360 events. 2205/3360 cut-off events. For 8622/8622 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 15665 event pairs, 356 based on Foata normal form. 12/3372 useless extension candidates. Maximal degree in co-relation 13019. Up to 1712 conditions per place.
[2023-11-19 07:51:31,601 INFO L140 encePairwiseOnDemand]: 237/246 looper letters, 83 selfloop transitions, 11 changer transitions 38/132 dead transitions.
[2023-11-19 07:51:31,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 132 transitions, 1063 flow
[2023-11-19 07:51:31,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-11-19 07:51:31,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-19 07:51:31,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 849 transitions.
[2023-11-19 07:51:31,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4930313588850174
[2023-11-19 07:51:31,606 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 849 transitions.
[2023-11-19 07:51:31,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 849 transitions.
[2023-11-19 07:51:31,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:51:31,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 849 transitions.
[2023-11-19 07:51:31,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.28571428571429) internal successors, (849), 7 states have internal predecessors, (849), 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:51:31,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 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:51:31,616 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 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:51:31,616 INFO L175 Difference]: Start difference. First operand has 69 places, 51 transitions, 335 flow. Second operand 7 states and 849 transitions.
[2023-11-19 07:51:31,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 132 transitions, 1063 flow
[2023-11-19 07:51:31,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 132 transitions, 975 flow, removed 44 selfloop flow, removed 7 redundant places.
[2023-11-19 07:51:31,679 INFO L231 Difference]: Finished difference. Result has 62 places, 48 transitions, 304 flow
[2023-11-19 07:51:31,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=304, PETRI_PLACES=62, PETRI_TRANSITIONS=48}
[2023-11-19 07:51:31,680 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places.
[2023-11-19 07:51:31,680 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 304 flow
[2023-11-19 07:51:31,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.83333333333333) internal successors, (665), 6 states have internal predecessors, (665), 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:51:31,681 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:51:31,681 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, 1, 1]
[2023-11-19 07:51:31,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-19 07:51:31,682 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-19 07:51:31,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:51:31,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1338717734, now seen corresponding path program 3 times
[2023-11-19 07:51:31,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:51:31,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933208883]
[2023-11-19 07:51:31,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:51:31,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:51:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:51:31,948 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:51:31,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:51:31,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933208883]
[2023-11-19 07:51:31,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933208883] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:51:31,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:51:31,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 07:51:31,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301565187]
[2023-11-19 07:51:31,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:51:31,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-19 07:51:31,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:51:31,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-19 07:51:31,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-11-19 07:51:31,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 246
[2023-11-19 07:51:31,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 48 transitions, 304 flow. Second operand has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 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:51:31,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:51:31,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 246
[2023-11-19 07:51:31,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:51:32,707 INFO L124 PetriNetUnfolderBase]: 1914/3146 cut-off events.
[2023-11-19 07:51:32,707 INFO L125 PetriNetUnfolderBase]: For 5440/5517 co-relation queries the response was YES.
[2023-11-19 07:51:32,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11136 conditions, 3146 events. 1914/3146 cut-off events. For 5440/5517 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 17487 event pairs, 396 based on Foata normal form. 31/3050 useless extension candidates. Maximal degree in co-relation 11110. Up to 1618 conditions per place.
[2023-11-19 07:51:32,732 INFO L140 encePairwiseOnDemand]: 242/246 looper letters, 63 selfloop transitions, 2 changer transitions 37/110 dead transitions.
[2023-11-19 07:51:32,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 110 transitions, 857 flow
[2023-11-19 07:51:32,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-19 07:51:32,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-11-19 07:51:32,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 637 transitions.
[2023-11-19 07:51:32,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5178861788617887
[2023-11-19 07:51:32,736 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 637 transitions.
[2023-11-19 07:51:32,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 637 transitions.
[2023-11-19 07:51:32,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:51:32,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 637 transitions.
[2023-11-19 07:51:32,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 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:51:32,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 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:51:32,744 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 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:51:32,744 INFO L175 Difference]: Start difference. First operand has 62 places, 48 transitions, 304 flow. Second operand 5 states and 637 transitions.
[2023-11-19 07:51:32,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 110 transitions, 857 flow
[2023-11-19 07:51:32,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 110 transitions, 807 flow, removed 6 selfloop flow, removed 7 redundant places.
[2023-11-19 07:51:32,798 INFO L231 Difference]: Finished difference. Result has 61 places, 48 transitions, 285 flow
[2023-11-19 07:51:32,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=285, PETRI_PLACES=61, PETRI_TRANSITIONS=48}
[2023-11-19 07:51:32,799 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places.
[2023-11-19 07:51:32,799 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 48 transitions, 285 flow
[2023-11-19 07:51:32,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 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:51:32,800 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:51:32,800 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, 1, 1]
[2023-11-19 07:51:32,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-19 07:51:32,801 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-19 07:51:32,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:51:32,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1867628272, now seen corresponding path program 4 times
[2023-11-19 07:51:32,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:51:32,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191544136]
[2023-11-19 07:51:32,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:51:32,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:51:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:51:33,115 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:51:33,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:51:33,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191544136]
[2023-11-19 07:51:33,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191544136] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:51:33,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:51:33,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-11-19 07:51:33,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578400421]
[2023-11-19 07:51:33,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:51:33,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-19 07:51:33,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:51:33,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-19 07:51:33,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2023-11-19 07:51:33,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 246
[2023-11-19 07:51:33,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 285 flow. Second operand has 7 states, 7 states have (on average 117.85714285714286) internal successors, (825), 7 states have internal predecessors, (825), 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:51:33,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:51:33,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 246
[2023-11-19 07:51:33,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:51:33,715 INFO L124 PetriNetUnfolderBase]: 1656/2735 cut-off events.
[2023-11-19 07:51:33,716 INFO L125 PetriNetUnfolderBase]: For 4313/4486 co-relation queries the response was YES.
[2023-11-19 07:51:33,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9341 conditions, 2735 events. 1656/2735 cut-off events. For 4313/4486 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 15551 event pairs, 298 based on Foata normal form. 75/2696 useless extension candidates. Maximal degree in co-relation 9320. Up to 1022 conditions per place.
[2023-11-19 07:51:33,730 INFO L140 encePairwiseOnDemand]: 239/246 looper letters, 39 selfloop transitions, 18 changer transitions 30/93 dead transitions.
[2023-11-19 07:51:33,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 93 transitions, 637 flow
[2023-11-19 07:51:33,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2023-11-19 07:51:33,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-11-19 07:51:33,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1002 transitions.
[2023-11-19 07:51:33,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5091463414634146
[2023-11-19 07:51:33,735 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1002 transitions.
[2023-11-19 07:51:33,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1002 transitions.
[2023-11-19 07:51:33,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:51:33,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1002 transitions.
[2023-11-19 07:51:33,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.25) internal successors, (1002), 8 states have internal predecessors, (1002), 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:51:33,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 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:51:33,744 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 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:51:33,744 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 285 flow. Second operand 8 states and 1002 transitions.
[2023-11-19 07:51:33,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 93 transitions, 637 flow
[2023-11-19 07:51:33,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 93 transitions, 604 flow, removed 12 selfloop flow, removed 3 redundant places.
[2023-11-19 07:51:33,806 INFO L231 Difference]: Finished difference. Result has 67 places, 42 transitions, 273 flow
[2023-11-19 07:51:33,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=273, PETRI_PLACES=67, PETRI_TRANSITIONS=42}
[2023-11-19 07:51:33,807 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places.
[2023-11-19 07:51:33,807 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 42 transitions, 273 flow
[2023-11-19 07:51:33,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.85714285714286) internal successors, (825), 7 states have internal predecessors, (825), 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:51:33,808 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:51:33,808 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, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:51:33,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-19 07:51:33,808 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-19 07:51:33,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:51:33,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1942655587, now seen corresponding path program 1 times
[2023-11-19 07:51:33,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:51:33,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456146571]
[2023-11-19 07:51:33,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:51:33,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:51:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:51:34,439 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:51:34,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:51:34,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456146571]
[2023-11-19 07:51:34,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456146571] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:51:34,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:51:34,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-19 07:51:34,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028562026]
[2023-11-19 07:51:34,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:51:34,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-19 07:51:34,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:51:34,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-19 07:51:34,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2023-11-19 07:51:34,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 246
[2023-11-19 07:51:34,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 42 transitions, 273 flow. Second operand has 7 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 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:51:34,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:51:34,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 246
[2023-11-19 07:51:34,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:51:35,016 INFO L124 PetriNetUnfolderBase]: 1091/1879 cut-off events.
[2023-11-19 07:51:35,016 INFO L125 PetriNetUnfolderBase]: For 4398/4422 co-relation queries the response was YES.
[2023-11-19 07:51:35,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7416 conditions, 1879 events. 1091/1879 cut-off events. For 4398/4422 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10146 event pairs, 128 based on Foata normal form. 2/1816 useless extension candidates. Maximal degree in co-relation 7389. Up to 597 conditions per place.
[2023-11-19 07:51:35,029 INFO L140 encePairwiseOnDemand]: 238/246 looper letters, 71 selfloop transitions, 6 changer transitions 48/131 dead transitions.
[2023-11-19 07:51:35,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 131 transitions, 1199 flow
[2023-11-19 07:51:35,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2023-11-19 07:51:35,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-11-19 07:51:35,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 964 transitions.
[2023-11-19 07:51:35,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4898373983739837
[2023-11-19 07:51:35,034 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 964 transitions.
[2023-11-19 07:51:35,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 964 transitions.
[2023-11-19 07:51:35,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:51:35,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 964 transitions.
[2023-11-19 07:51:35,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.5) internal successors, (964), 8 states have internal predecessors, (964), 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:51:35,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 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:51:35,043 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 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:51:35,043 INFO L175 Difference]: Start difference. First operand has 67 places, 42 transitions, 273 flow. Second operand 8 states and 964 transitions.
[2023-11-19 07:51:35,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 131 transitions, 1199 flow
[2023-11-19 07:51:35,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 131 transitions, 904 flow, removed 81 selfloop flow, removed 9 redundant places.
[2023-11-19 07:51:35,077 INFO L231 Difference]: Finished difference. Result has 66 places, 46 transitions, 238 flow
[2023-11-19 07:51:35,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=238, PETRI_PLACES=66, PETRI_TRANSITIONS=46}
[2023-11-19 07:51:35,078 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places.
[2023-11-19 07:51:35,078 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 46 transitions, 238 flow
[2023-11-19 07:51:35,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 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:51:35,079 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:51:35,079 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, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:51:35,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-11-19 07:51:35,079 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-19 07:51:35,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:51:35,080 INFO L85 PathProgramCache]: Analyzing trace with hash -211709079, now seen corresponding path program 2 times
[2023-11-19 07:51:35,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:51:35,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280450169]
[2023-11-19 07:51:35,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:51:35,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:51:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:51:35,343 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:51:35,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:51:35,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280450169]
[2023-11-19 07:51:35,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280450169] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:51:35,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:51:35,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 07:51:35,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794135124]
[2023-11-19 07:51:35,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:51:35,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-19 07:51:35,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:51:35,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-19 07:51:35,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-11-19 07:51:35,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 246
[2023-11-19 07:51:35,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 46 transitions, 238 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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:51:35,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:51:35,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 246
[2023-11-19 07:51:35,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:51:35,785 INFO L124 PetriNetUnfolderBase]: 1243/2152 cut-off events.
[2023-11-19 07:51:35,786 INFO L125 PetriNetUnfolderBase]: For 3818/3833 co-relation queries the response was YES.
[2023-11-19 07:51:35,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7834 conditions, 2152 events. 1243/2152 cut-off events. For 3818/3833 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 12037 event pairs, 415 based on Foata normal form. 2/2112 useless extension candidates. Maximal degree in co-relation 7813. Up to 850 conditions per place.
[2023-11-19 07:51:35,798 INFO L140 encePairwiseOnDemand]: 242/246 looper letters, 39 selfloop transitions, 1 changer transitions 46/89 dead transitions.
[2023-11-19 07:51:35,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 89 transitions, 654 flow
[2023-11-19 07:51:35,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-19 07:51:35,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-11-19 07:51:35,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 617 transitions.
[2023-11-19 07:51:35,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5016260162601626
[2023-11-19 07:51:35,802 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 617 transitions.
[2023-11-19 07:51:35,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 617 transitions.
[2023-11-19 07:51:35,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:51:35,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 617 transitions.
[2023-11-19 07:51:35,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 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:51:35,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 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:51:35,808 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 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:51:35,808 INFO L175 Difference]: Start difference. First operand has 66 places, 46 transitions, 238 flow. Second operand 5 states and 617 transitions.
[2023-11-19 07:51:35,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 89 transitions, 654 flow
[2023-11-19 07:51:35,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 89 transitions, 633 flow, removed 10 selfloop flow, removed 5 redundant places.
[2023-11-19 07:51:35,847 INFO L231 Difference]: Finished difference. Result has 65 places, 41 transitions, 208 flow
[2023-11-19 07:51:35,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=208, PETRI_PLACES=65, PETRI_TRANSITIONS=41}
[2023-11-19 07:51:35,849 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places.
[2023-11-19 07:51:35,849 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 41 transitions, 208 flow
[2023-11-19 07:51:35,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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:51:35,850 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:51:35,850 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, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:51:35,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-11-19 07:51:35,850 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-19 07:51:35,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:51:35,851 INFO L85 PathProgramCache]: Analyzing trace with hash -652279695, now seen corresponding path program 3 times
[2023-11-19 07:51:35,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:51:35,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975193524]
[2023-11-19 07:51:35,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:51:35,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:51:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:51:36,800 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:51:36,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:51:36,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975193524]
[2023-11-19 07:51:36,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975193524] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:51:36,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:51:36,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-11-19 07:51:36,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134015915]
[2023-11-19 07:51:36,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:51:36,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-11-19 07:51:36,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:51:36,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-11-19 07:51:36,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2023-11-19 07:51:36,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 246
[2023-11-19 07:51:36,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 41 transitions, 208 flow. Second operand has 8 states, 8 states have (on average 114.875) internal successors, (919), 8 states have internal predecessors, (919), 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:51:36,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:51:36,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 246
[2023-11-19 07:51:36,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:51:37,258 INFO L124 PetriNetUnfolderBase]: 568/968 cut-off events.
[2023-11-19 07:51:37,258 INFO L125 PetriNetUnfolderBase]: For 1566/1587 co-relation queries the response was YES.
[2023-11-19 07:51:37,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3479 conditions, 968 events. 568/968 cut-off events. For 1566/1587 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4312 event pairs, 92 based on Foata normal form. 10/952 useless extension candidates. Maximal degree in co-relation 3459. Up to 603 conditions per place.
[2023-11-19 07:51:37,262 INFO L140 encePairwiseOnDemand]: 239/246 looper letters, 43 selfloop transitions, 5 changer transitions 28/80 dead transitions.
[2023-11-19 07:51:37,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 80 transitions, 568 flow
[2023-11-19 07:51:37,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2023-11-19 07:51:37,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-11-19 07:51:37,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 942 transitions.
[2023-11-19 07:51:37,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47865853658536583
[2023-11-19 07:51:37,272 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 942 transitions.
[2023-11-19 07:51:37,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 942 transitions.
[2023-11-19 07:51:37,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:51:37,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 942 transitions.
[2023-11-19 07:51:37,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 117.75) internal successors, (942), 8 states have internal predecessors, (942), 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:51:37,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 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:51:37,281 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 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:51:37,281 INFO L175 Difference]: Start difference. First operand has 65 places, 41 transitions, 208 flow. Second operand 8 states and 942 transitions.
[2023-11-19 07:51:37,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 80 transitions, 568 flow
[2023-11-19 07:51:37,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 80 transitions, 545 flow, removed 7 selfloop flow, removed 6 redundant places.
[2023-11-19 07:51:37,292 INFO L231 Difference]: Finished difference. Result has 66 places, 41 transitions, 212 flow
[2023-11-19 07:51:37,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=212, PETRI_PLACES=66, PETRI_TRANSITIONS=41}
[2023-11-19 07:51:37,293 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places.
[2023-11-19 07:51:37,294 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 41 transitions, 212 flow
[2023-11-19 07:51:37,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.875) internal successors, (919), 8 states have internal predecessors, (919), 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:51:37,294 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:51:37,295 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, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:51:37,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-11-19 07:51:37,295 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-19 07:51:37,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:51:37,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1948656789, now seen corresponding path program 4 times
[2023-11-19 07:51:37,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:51:37,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691102869]
[2023-11-19 07:51:37,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:51:37,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:51:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 07:51:37,345 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-19 07:51:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 07:51:37,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-19 07:51:37,424 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2023-11-19 07:51:37,424 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining)
[2023-11-19 07:51:37,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining)
[2023-11-19 07:51:37,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining)
[2023-11-19 07:51:37,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining)
[2023-11-19 07:51:37,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining)
[2023-11-19 07:51:37,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining)
[2023-11-19 07:51:37,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining)
[2023-11-19 07:51:37,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-11-19 07:51:37,428 INFO L445 BasicCegarLoop]: Path program histogram: [4, 4, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:51:37,434 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-11-19 07:51:37,434 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2023-11-19 07:51:37,508 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2023-11-19 07:51:37,510 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
[2023-11-19 07:51:37,511 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated
[2023-11-19 07:51:37,522 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated
[2023-11-19 07:51:37,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:51:37 BasicIcfg
[2023-11-19 07:51:37,553 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-19 07:51:37,558 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2023-11-19 07:51:37,558 INFO L270 PluginConnector]: Initializing Witness Printer...
[2023-11-19 07:51:37,559 INFO L274 PluginConnector]: Witness Printer initialized
[2023-11-19 07:51:37,559 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:51:13" (3/4) ...
[2023-11-19 07:51:37,560 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample
[2023-11-19 07:51:37,597 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2023-11-19 07:51:37,598 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
[2023-11-19 07:51:37,599 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated
[2023-11-19 07:51:37,606 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated
[2023-11-19 07:51:37,685 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d848dba-211b-4faa-9172-239e3ce294bf/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml
[2023-11-19 07:51:37,685 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-11-19 07:51:37,686 INFO L158 Benchmark]: Toolchain (without parser) took 26203.75ms. Allocated memory was 138.4MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 69.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 176.3MB. Max. memory is 16.1GB.
[2023-11-19 07:51:37,686 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 138.4MB. Free memory was 111.1MB in the beginning and 111.0MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.1GB.
[2023-11-19 07:51:37,687 INFO L158 Benchmark]: CACSL2BoogieTranslator took 707.80ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 69.3MB in the beginning and 137.9MB in the end (delta: -68.6MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB.
[2023-11-19 07:51:37,687 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.39ms. Allocated memory is still 186.6MB. Free memory was 137.7MB in the beginning and 134.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2023-11-19 07:51:37,688 INFO L158 Benchmark]: Boogie Preprocessor took 60.77ms. Allocated memory is still 186.6MB. Free memory was 134.6MB in the beginning and 132.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-19 07:51:37,688 INFO L158 Benchmark]: RCFGBuilder took 955.03ms. Allocated memory is still 186.6MB. Free memory was 132.5MB in the beginning and 128.1MB in the end (delta: 4.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2023-11-19 07:51:37,688 INFO L158 Benchmark]: TraceAbstraction took 24239.66ms. Allocated memory was 186.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 127.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 171.8MB. Max. memory is 16.1GB.
[2023-11-19 07:51:37,689 INFO L158 Benchmark]: Witness Printer took 127.18ms. Allocated memory is still 1.6GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
[2023-11-19 07:51:37,691 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.21ms. Allocated memory is still 138.4MB. Free memory was 111.1MB in the beginning and 111.0MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 707.80ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 69.3MB in the beginning and 137.9MB in the end (delta: -68.6MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 98.39ms. Allocated memory is still 186.6MB. Free memory was 137.7MB in the beginning and 134.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 60.77ms. Allocated memory is still 186.6MB. Free memory was 134.6MB in the beginning and 132.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 955.03ms. Allocated memory is still 186.6MB. Free memory was 132.5MB in the beginning and 128.1MB in the end (delta: 4.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
* TraceAbstraction took 24239.66ms. Allocated memory was 186.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 127.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 171.8MB. Max. memory is 16.1GB.
* Witness Printer took 127.18ms. Allocated memory is still 1.6GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
- 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
Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated
- GenericResult: Unfinished Backtranslation
The program execution was not completely translated back.
- 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
Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre11 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.2s, 142 PlacesBefore, 42 PlacesAfterwards, 131 TransitionsBefore, 30 TransitionsAfterwards, 3376 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 111 TotalNumberOfCompositions, 7624 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3775, independent: 3568, independent conditional: 0, independent unconditional: 3568, dependent: 207, dependent conditional: 0, dependent unconditional: 207, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1769, independent: 1733, independent conditional: 0, independent unconditional: 1733, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3775, independent: 1835, independent conditional: 0, independent unconditional: 1835, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 1769, unknown conditional: 0, unknown unconditional: 1769] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 127, Positive conditional cache size: 0, Positive unconditional cache size: 127, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, 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:
[L710] 0 int __unbuffered_cnt = 0;
[L712] 0 int __unbuffered_p0_EAX = 0;
[L714] 0 int __unbuffered_p1_EAX = 0;
[L716] 0 int __unbuffered_p2_EAX = 0;
[L718] 0 int __unbuffered_p3_EAX = 0;
[L720] 0 int __unbuffered_p3_EBX = 0;
[L722] 0 int a = 0;
[L723] 0 _Bool main$tmp_guard0;
[L724] 0 _Bool main$tmp_guard1;
[L726] 0 int x = 0;
[L728] 0 int y = 0;
[L729] 0 _Bool y$flush_delayed;
[L730] 0 int y$mem_tmp;
[L731] 0 _Bool y$r_buff0_thd0;
[L732] 0 _Bool y$r_buff0_thd1;
[L733] 0 _Bool y$r_buff0_thd2;
[L734] 0 _Bool y$r_buff0_thd3;
[L735] 0 _Bool y$r_buff0_thd4;
[L736] 0 _Bool y$r_buff1_thd0;
[L737] 0 _Bool y$r_buff1_thd1;
[L738] 0 _Bool y$r_buff1_thd2;
[L739] 0 _Bool y$r_buff1_thd3;
[L740] 0 _Bool y$r_buff1_thd4;
[L741] 0 _Bool y$read_delayed;
[L742] 0 int *y$read_delayed_var;
[L743] 0 int y$w_buff0;
[L744] 0 _Bool y$w_buff0_used;
[L745] 0 int y$w_buff1;
[L746] 0 _Bool y$w_buff1_used;
[L748] 0 int z = 0;
[L749] 0 _Bool weak$$choice0;
[L750] 0 _Bool weak$$choice2;
[L858] 0 pthread_t t437;
[L859] FCALL, FORK 0 pthread_create(&t437, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t437={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L860] 0 pthread_t t438;
[L861] FCALL, FORK 0 pthread_create(&t438, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t437={6:0}, t438={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L862] 0 pthread_t t439;
[L863] FCALL, FORK 0 pthread_create(&t439, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t437={6:0}, t438={7:0}, t439={8:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L864] 0 pthread_t t440;
[L865] FCALL, FORK 0 pthread_create(&t440, ((void *)0), P3, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t437={6:0}, t438={7:0}, t439={8:0}, t440={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L797] 3 y$w_buff1 = y$w_buff0
[L798] 3 y$w_buff0 = 1
[L799] 3 y$w_buff1_used = y$w_buff0_used
[L800] 3 y$w_buff0_used = (_Bool)1
[L801] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L18] COND FALSE 3 !(!expression)
[L801] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L802] 3 y$r_buff1_thd0 = y$r_buff0_thd0
[L803] 3 y$r_buff1_thd1 = y$r_buff0_thd1
[L804] 3 y$r_buff1_thd2 = y$r_buff0_thd2
[L805] 3 y$r_buff1_thd3 = y$r_buff0_thd3
[L806] 3 y$r_buff1_thd4 = y$r_buff0_thd4
[L807] 3 y$r_buff0_thd3 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L810] 3 __unbuffered_p2_EAX = z
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L827] 4 z = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L830] 4 __unbuffered_p3_EAX = z
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L833] 4 __unbuffered_p3_EBX = a
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L754] 1 a = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L757] 1 __unbuffered_p0_EAX = x
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L769] 2 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L772] 2 weak$$choice0 = __VERIFIER_nondet_bool()
[L773] 2 weak$$choice2 = __VERIFIER_nondet_bool()
[L774] 2 y$flush_delayed = weak$$choice2
[L775] 2 y$mem_tmp = y
[L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)
[L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))
[L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))
[L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))
[L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))
[L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L783] 2 __unbuffered_p1_EAX = y
[L784] 2 y = y$flush_delayed ? y$mem_tmp : y
[L785] 2 y$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1
[L822] 3 return 0;
[L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L764] 1 return 0;
[L836] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L837] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used
[L838] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used
[L839] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4
[L840] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4
VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L790] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L792] 2 return 0;
[L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1
[L845] 4 return 0;
[L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4
[L869] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L869] RET 0 assume_abort_if_not(main$tmp_guard0)
[L871] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L872] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L873] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L874] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L875] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t437={6:0}, t438={7:0}, t439={8:0}, t440={5:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0)
[L880] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
- UnprovableResult [Line: 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: 863]: 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: 859]: 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: 865]: 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: 861]: 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 9 procedures, 172 locations, 7 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: 24.0s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 13.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 958 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 773 mSDsluCounter, 562 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 436 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2238 IncrementalHoareTripleChecker+Invalid, 2319 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 126 mSDtfsCounter, 2238 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=437occurred in iteration=6, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 284 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 244 ConstructedInterpolants, 0 QuantifiedInterpolants, 1537 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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:51:37,735 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d848dba-211b-4faa-9172-239e3ce294bf/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