./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 9bd2c7ff
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697728d-4b23-42f8-ac00-9aadfe595b32/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697728d-4b23-42f8-ac00-9aadfe595b32/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_8697728d-4b23-42f8-ac00-9aadfe595b32/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697728d-4b23-42f8-ac00-9aadfe595b32/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697728d-4b23-42f8-ac00-9aadfe595b32/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_8697728d-4b23-42f8-ac00-9aadfe595b32/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 28f58acc3eb15266c6a84eca373e682a200492b696916dc340e2c03025141f5c
--- Real Ultimate output ---
This is Ultimate 0.2.3-dev-9bd2c7f
[2023-11-19 07:46:12,603 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2023-11-19 07:46:12,733 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697728d-4b23-42f8-ac00-9aadfe595b32/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf
[2023-11-19 07:46:12,743 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2023-11-19 07:46:12,744 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-19 07:46:12,784 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-19 07:46:12,785 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-19 07:46:12,785 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-19 07:46:12,787 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-19 07:46:12,792 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-19 07:46:12,792 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-19 07:46:12,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2023-11-19 07:46:12,794 INFO L153 SettingsManager]: * Use SBE=true
[2023-11-19 07:46:12,795 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-19 07:46:12,796 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2023-11-19 07:46:12,797 INFO L153 SettingsManager]: * sizeof long=4
[2023-11-19 07:46:12,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2023-11-19 07:46:12,798 INFO L153 SettingsManager]: * sizeof POINTER=4
[2023-11-19 07:46:12,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2023-11-19 07:46:12,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2023-11-19 07:46:12,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-19 07:46:12,800 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2023-11-19 07:46:12,800 INFO L153 SettingsManager]: * sizeof long double=12
[2023-11-19 07:46:12,801 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2023-11-19 07:46:12,801 INFO L153 SettingsManager]: * Use constant arrays=true
[2023-11-19 07:46:12,802 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-19 07:46:12,803 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-11-19 07:46:12,803 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2023-11-19 07:46:12,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:46:12,804 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-19 07:46:12,806 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-11-19 07:46:12,806 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2023-11-19 07:46:12,807 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2023-11-19 07:46:12,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-19 07:46:12,807 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-19 07:46:12,808 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-19 07:46:12,808 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-11-19 07:46:12,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-19 07:46:12,809 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-19 07:46:12,809 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_8697728d-4b23-42f8-ac00-9aadfe595b32/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_8697728d-4b23-42f8-ac00-9aadfe595b32/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 -> 28f58acc3eb15266c6a84eca373e682a200492b696916dc340e2c03025141f5c
[2023-11-19 07:46:13,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-19 07:46:13,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-19 07:46:13,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-19 07:46:13,170 INFO L270 PluginConnector]: Initializing CDTParser...
[2023-11-19 07:46:13,171 INFO L274 PluginConnector]: CDTParser initialized
[2023-11-19 07:46:13,172 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697728d-4b23-42f8-ac00-9aadfe595b32/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i
[2023-11-19 07:46:16,254 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2023-11-19 07:46:16,554 INFO L384 CDTParser]: Found 1 translation units.
[2023-11-19 07:46:16,555 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697728d-4b23-42f8-ac00-9aadfe595b32/sv-benchmarks/c/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i
[2023-11-19 07:46:16,582 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697728d-4b23-42f8-ac00-9aadfe595b32/bin/uautomizer-verify-uCwYo4JHxu/data/0fc244181/fc5dd3969eef4c358e8d6cacd7d57fef/FLAGfe89dcc23
[2023-11-19 07:46:16,602 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697728d-4b23-42f8-ac00-9aadfe595b32/bin/uautomizer-verify-uCwYo4JHxu/data/0fc244181/fc5dd3969eef4c358e8d6cacd7d57fef
[2023-11-19 07:46:16,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-19 07:46:16,606 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-19 07:46:16,608 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-19 07:46:16,608 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-19 07:46:16,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-19 07:46:16,615 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:46:16" (1/1) ...
[2023-11-19 07:46:16,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@605e8831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:16, skipping insertion in model container
[2023-11-19 07:46:16,616 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:46:16" (1/1) ...
[2023-11-19 07:46:16,672 INFO L177 MainTranslator]: Built tables and reachable declarations
[2023-11-19 07:46:16,876 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_8697728d-4b23-42f8-ac00-9aadfe595b32/sv-benchmarks/c/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i[966,979]
[2023-11-19 07:46:17,115 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:46:17,127 INFO L202 MainTranslator]: Completed pre-run
[2023-11-19 07:46:17,140 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_8697728d-4b23-42f8-ac00-9aadfe595b32/sv-benchmarks/c/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i[966,979]
[2023-11-19 07:46:17,212 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:46:17,253 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-11-19 07:46:17,254 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-11-19 07:46:17,260 INFO L206 MainTranslator]: Completed translation
[2023-11-19 07:46:17,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:17 WrapperNode
[2023-11-19 07:46:17,261 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-19 07:46:17,262 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-19 07:46:17,262 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-19 07:46:17,262 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-19 07:46:17,269 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:46:17" (1/1) ...
[2023-11-19 07:46:17,289 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:46:17" (1/1) ...
[2023-11-19 07:46:17,319 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144
[2023-11-19 07:46:17,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-19 07:46:17,321 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-19 07:46:17,321 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-19 07:46:17,321 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2023-11-19 07:46:17,331 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:17" (1/1) ...
[2023-11-19 07:46:17,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:17" (1/1) ...
[2023-11-19 07:46:17,345 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:17" (1/1) ...
[2023-11-19 07:46:17,346 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:17" (1/1) ...
[2023-11-19 07:46:17,356 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:17" (1/1) ...
[2023-11-19 07:46:17,358 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:17" (1/1) ...
[2023-11-19 07:46:17,361 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:17" (1/1) ...
[2023-11-19 07:46:17,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:17" (1/1) ...
[2023-11-19 07:46:17,369 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-19 07:46:17,370 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-19 07:46:17,370 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2023-11-19 07:46:17,370 INFO L274 PluginConnector]: RCFGBuilder initialized
[2023-11-19 07:46:17,371 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:17" (1/1) ...
[2023-11-19 07:46:17,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:46:17,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697728d-4b23-42f8-ac00-9aadfe595b32/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 07:46:17,423 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697728d-4b23-42f8-ac00-9aadfe595b32/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:46:17,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697728d-4b23-42f8-ac00-9aadfe595b32/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:46:17,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2023-11-19 07:46:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-11-19 07:46:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-19 07:46:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-19 07:46:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-19 07:46:17,472 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2023-11-19 07:46:17,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2023-11-19 07:46:17,472 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2023-11-19 07:46:17,473 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2023-11-19 07:46:17,473 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2023-11-19 07:46:17,475 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2023-11-19 07:46:17,475 INFO L130 BoogieDeclarations]: Found specification of procedure P3
[2023-11-19 07:46:17,476 INFO L138 BoogieDeclarations]: Found implementation of procedure P3
[2023-11-19 07:46:17,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-19 07:46:17,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-11-19 07:46:17,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-19 07:46:17,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-19 07:46:17,478 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:46:17,682 INFO L236 CfgBuilder]: Building ICFG
[2023-11-19 07:46:17,685 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-19 07:46:18,038 INFO L277 CfgBuilder]: Performing block encoding
[2023-11-19 07:46:18,246 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-19 07:46:18,246 INFO L302 CfgBuilder]: Removed 0 assume(true) statements.
[2023-11-19 07:46:18,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:46:18 BoogieIcfgContainer
[2023-11-19 07:46:18,255 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-19 07:46:18,258 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-19 07:46:18,258 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2023-11-19 07:46:18,262 INFO L274 PluginConnector]: TraceAbstraction initialized
[2023-11-19 07:46:18,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:46:16" (1/3) ...
[2023-11-19 07:46:18,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d6b09b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:46:18, skipping insertion in model container
[2023-11-19 07:46:18,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:17" (2/3) ...
[2023-11-19 07:46:18,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d6b09b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:46:18, skipping insertion in model container
[2023-11-19 07:46:18,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:46:18" (3/3) ...
[2023-11-19 07:46:18,266 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_power.opt_pso.opt_rmo.opt.i
[2023-11-19 07:46:18,275 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-11-19 07:46:18,285 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-19 07:46:18,286 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2023-11-19 07:46:18,286 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-19 07:46:18,354 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-11-19 07:46:18,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 135 transitions, 286 flow
[2023-11-19 07:46:18,472 INFO L124 PetriNetUnfolderBase]: 2/131 cut-off events.
[2023-11-19 07:46:18,472 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:46:18,479 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 4. Compared 79 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place.
[2023-11-19 07:46:18,479 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 135 transitions, 286 flow
[2023-11-19 07:46:18,485 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 131 transitions, 274 flow
[2023-11-19 07:46:18,489 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-19 07:46:18,500 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 131 transitions, 274 flow
[2023-11-19 07:46:18,503 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 131 transitions, 274 flow
[2023-11-19 07:46:18,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 274 flow
[2023-11-19 07:46:18,541 INFO L124 PetriNetUnfolderBase]: 2/131 cut-off events.
[2023-11-19 07:46:18,541 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:46:18,543 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 4. Compared 79 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place.
[2023-11-19 07:46:18,547 INFO L119 LiptonReduction]: Number of co-enabled transitions 3520
[2023-11-19 07:46:23,878 INFO L134 LiptonReduction]: Checked pairs total: 7803
[2023-11-19 07:46:23,879 INFO L136 LiptonReduction]: Total number of compositions: 112
[2023-11-19 07:46:23,897 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-19 07:46:23,906 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;@53013254, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-19 07:46:23,907 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2023-11-19 07:46:23,914 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-11-19 07:46:23,914 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events.
[2023-11-19 07:46:23,915 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:46:23,915 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:46:23,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:46:23,917 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:46:23,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:46:23,923 INFO L85 PathProgramCache]: Analyzing trace with hash -128566491, now seen corresponding path program 1 times
[2023-11-19 07:46:23,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:46:23,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369772142]
[2023-11-19 07:46:23,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:46:23,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:46:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:46:24,605 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:46:24,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:46:24,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369772142]
[2023-11-19 07:46:24,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369772142] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:46:24,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:46:24,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-19 07:46:24,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100952868]
[2023-11-19 07:46:24,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:46:24,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:46:24,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:46:24,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:46:24,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:46:24,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 247
[2023-11-19 07:46:24,686 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:46:24,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:46:24,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 247
[2023-11-19 07:46:24,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:46:25,828 INFO L124 PetriNetUnfolderBase]: 3927/5764 cut-off events.
[2023-11-19 07:46:25,829 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES.
[2023-11-19 07:46:25,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11316 conditions, 5764 events. 3927/5764 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 32007 event pairs, 759 based on Foata normal form. 0/5456 useless extension candidates. Maximal degree in co-relation 11304. Up to 4225 conditions per place.
[2023-11-19 07:46:25,888 INFO L140 encePairwiseOnDemand]: 243/247 looper letters, 35 selfloop transitions, 2 changer transitions 2/43 dead transitions.
[2023-11-19 07:46:25,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 179 flow
[2023-11-19 07:46:25,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:46:25,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-19 07:46:25,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions.
[2023-11-19 07:46:25,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5465587044534413
[2023-11-19 07:46:25,907 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions.
[2023-11-19 07:46:25,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions.
[2023-11-19 07:46:25,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:46:25,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions.
[2023-11-19 07:46:25,919 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:46:25,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 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:46:25,928 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 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:46:25,930 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:46:25,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 179 flow
[2023-11-19 07:46:25,939 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:46:25,942 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 66 flow
[2023-11-19 07:46:25,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, 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:46:25,949 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places.
[2023-11-19 07:46:25,950 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 66 flow
[2023-11-19 07:46:25,950 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:46:25,951 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:46:25,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:46:25,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-19 07:46:25,952 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:46:25,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:46:25,965 INFO L85 PathProgramCache]: Analyzing trace with hash 562461536, now seen corresponding path program 1 times
[2023-11-19 07:46:25,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:46:25,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328873701]
[2023-11-19 07:46:25,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:46:25,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:46:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:46:26,339 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:46:26,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:46:26,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328873701]
[2023-11-19 07:46:26,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328873701] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:46:26,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:46:26,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-19 07:46:26,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615699744]
[2023-11-19 07:46:26,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:46:26,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:46:26,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:46:26,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:46:26,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:46:26,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 247
[2023-11-19 07:46:26,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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:46:26,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:46:26,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 247
[2023-11-19 07:46:26,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:46:28,938 INFO L124 PetriNetUnfolderBase]: 12556/17185 cut-off events.
[2023-11-19 07:46:28,939 INFO L125 PetriNetUnfolderBase]: For 752/752 co-relation queries the response was YES.
[2023-11-19 07:46:28,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35532 conditions, 17185 events. 12556/17185 cut-off events. For 752/752 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 88909 event pairs, 4324 based on Foata normal form. 484/17669 useless extension candidates. Maximal degree in co-relation 35522. Up to 10805 conditions per place.
[2023-11-19 07:46:29,102 INFO L140 encePairwiseOnDemand]: 237/247 looper letters, 40 selfloop transitions, 9 changer transitions 0/49 dead transitions.
[2023-11-19 07:46:29,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 214 flow
[2023-11-19 07:46:29,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:46:29,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-19 07:46:29,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions.
[2023-11-19 07:46:29,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5087719298245614
[2023-11-19 07:46:29,108 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 377 transitions.
[2023-11-19 07:46:29,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 377 transitions.
[2023-11-19 07:46:29,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:46:29,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 377 transitions.
[2023-11-19 07:46:29,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:46:29,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 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:46:29,123 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 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:46:29,123 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 3 states and 377 transitions.
[2023-11-19 07:46:29,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 49 transitions, 214 flow
[2023-11-19 07:46:29,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-19 07:46:29,135 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 132 flow
[2023-11-19 07:46:29,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, 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=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=40, PETRI_TRANSITIONS=35}
[2023-11-19 07:46:29,143 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places.
[2023-11-19 07:46:29,144 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 132 flow
[2023-11-19 07:46:29,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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:46:29,144 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:46:29,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:46:29,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-19 07:46:29,145 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:46:29,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:46:29,149 INFO L85 PathProgramCache]: Analyzing trace with hash 256436244, now seen corresponding path program 1 times
[2023-11-19 07:46:29,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:46:29,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176026136]
[2023-11-19 07:46:29,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:46:29,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:46:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:46:29,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:46:29,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:46:29,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176026136]
[2023-11-19 07:46:29,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176026136] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:46:29,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:46:29,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:46:29,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61125684]
[2023-11-19 07:46:29,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:46:29,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:46:29,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:46:29,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:46:29,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:46:29,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 247
[2023-11-19 07:46:29,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 132 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:46:29,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:46:29,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 247
[2023-11-19 07:46:29,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:46:31,955 INFO L124 PetriNetUnfolderBase]: 11418/15651 cut-off events.
[2023-11-19 07:46:31,955 INFO L125 PetriNetUnfolderBase]: For 7275/7275 co-relation queries the response was YES.
[2023-11-19 07:46:31,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40918 conditions, 15651 events. 11418/15651 cut-off events. For 7275/7275 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 81168 event pairs, 2615 based on Foata normal form. 220/15871 useless extension candidates. Maximal degree in co-relation 40906. Up to 6937 conditions per place.
[2023-11-19 07:46:32,066 INFO L140 encePairwiseOnDemand]: 238/247 looper letters, 63 selfloop transitions, 9 changer transitions 0/72 dead transitions.
[2023-11-19 07:46:32,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 72 transitions, 388 flow
[2023-11-19 07:46:32,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-11-19 07:46:32,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-19 07:46:32,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 502 transitions.
[2023-11-19 07:46:32,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5080971659919028
[2023-11-19 07:46:32,070 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 502 transitions.
[2023-11-19 07:46:32,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 502 transitions.
[2023-11-19 07:46:32,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:46:32,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 502 transitions.
[2023-11-19 07:46:32,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 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:46:32,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 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:46:32,077 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 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:46:32,077 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 132 flow. Second operand 4 states and 502 transitions.
[2023-11-19 07:46:32,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 72 transitions, 388 flow
[2023-11-19 07:46:32,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 72 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-19 07:46:32,128 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 182 flow
[2023-11-19 07:46:32,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=44, PETRI_TRANSITIONS=40}
[2023-11-19 07:46:32,130 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places.
[2023-11-19 07:46:32,134 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 182 flow
[2023-11-19 07:46:32,135 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:46:32,135 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:46:32,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:46:32,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-19 07:46:32,135 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:46:32,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:46:32,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1403075017, now seen corresponding path program 1 times
[2023-11-19 07:46:32,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:46:32,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123849120]
[2023-11-19 07:46:32,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:46:32,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:46:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:46:32,392 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:46:32,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:46:32,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123849120]
[2023-11-19 07:46:32,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123849120] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:46:32,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:46:32,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:46:32,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716462600]
[2023-11-19 07:46:32,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:46:32,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:46:32,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:46:32,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:46:32,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:46:32,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 247
[2023-11-19 07:46:32,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 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:46:32,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:46:32,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 247
[2023-11-19 07:46:32,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:46:34,288 INFO L124 PetriNetUnfolderBase]: 10830/14847 cut-off events.
[2023-11-19 07:46:34,289 INFO L125 PetriNetUnfolderBase]: For 13287/13287 co-relation queries the response was YES.
[2023-11-19 07:46:34,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41193 conditions, 14847 events. 10830/14847 cut-off events. For 13287/13287 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 73133 event pairs, 2795 based on Foata normal form. 120/14967 useless extension candidates. Maximal degree in co-relation 41178. Up to 6293 conditions per place.
[2023-11-19 07:46:34,377 INFO L140 encePairwiseOnDemand]: 238/247 looper letters, 57 selfloop transitions, 13 changer transitions 0/70 dead transitions.
[2023-11-19 07:46:34,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 70 transitions, 430 flow
[2023-11-19 07:46:34,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-11-19 07:46:34,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-19 07:46:34,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions.
[2023-11-19 07:46:34,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49898785425101216
[2023-11-19 07:46:34,381 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 493 transitions.
[2023-11-19 07:46:34,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 493 transitions.
[2023-11-19 07:46:34,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:46:34,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 493 transitions.
[2023-11-19 07:46:34,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 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:46:34,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 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:46:34,388 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 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:46:34,388 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 182 flow. Second operand 4 states and 493 transitions.
[2023-11-19 07:46:34,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 70 transitions, 430 flow
[2023-11-19 07:46:34,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 425 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-19 07:46:34,416 INFO L231 Difference]: Finished difference. Result has 49 places, 47 transitions, 294 flow
[2023-11-19 07:46:34,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=294, PETRI_PLACES=49, PETRI_TRANSITIONS=47}
[2023-11-19 07:46:34,418 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places.
[2023-11-19 07:46:34,419 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 294 flow
[2023-11-19 07:46:34,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 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:46:34,419 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:46:34,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:46:34,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-19 07:46:34,420 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:46:34,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:46:34,421 INFO L85 PathProgramCache]: Analyzing trace with hash 613310246, now seen corresponding path program 1 times
[2023-11-19 07:46:34,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:46:34,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873356708]
[2023-11-19 07:46:34,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:46:34,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:46:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:46:34,671 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:46:34,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:46:34,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873356708]
[2023-11-19 07:46:34,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873356708] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:46:34,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:46:34,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:46:34,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182035422]
[2023-11-19 07:46:34,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:46:34,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:46:34,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:46:34,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:46:34,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:46:34,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 247
[2023-11-19 07:46:34,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 294 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:46:34,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:46:34,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 247
[2023-11-19 07:46:34,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:46:36,057 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([403] L835-->L842: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_103 256) 0)) .cse0)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 .cse5))) (and (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_102 256) 0)) .cse0) (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse1)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21) (= (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_103) v_~y$w_buff1_used~0_102) (= v_~y~0_72 (ite .cse4 v_~y$w_buff0~0_54 (ite .cse2 v_~y$w_buff1~0_47 v_~y~0_73))) (= v_~y$w_buff0_used~0_117 (ite .cse4 0 v_~y$w_buff0_used~0_118)) (= v_~y$r_buff0_thd4~0_25 (ite .cse3 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][89], [113#L812true, 72#L2true, Black: 161#(= ~__unbuffered_p1_EAX~0 0), Black: 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 117#P0EXITtrue, Black: 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 159#true, P0Thread1of1ForFork3InUse, Black: 169#(= ~__unbuffered_p3_EAX~0 0), 167#true, P3Thread1of1ForFork0InUse, 40#L842true, P1Thread1of1ForFork1InUse, 101#P1EXITtrue, P2Thread1of1ForFork2InUse, 175#true, Black: 155#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))])
[2023-11-19 07:46:36,057 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event
[2023-11-19 07:46:36,057 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:36,058 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:36,058 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:36,071 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([403] L835-->L842: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_103 256) 0)) .cse0)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 .cse5))) (and (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_102 256) 0)) .cse0) (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse1)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21) (= (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_103) v_~y$w_buff1_used~0_102) (= v_~y~0_72 (ite .cse4 v_~y$w_buff0~0_54 (ite .cse2 v_~y$w_buff1~0_47 v_~y~0_73))) (= v_~y$w_buff0_used~0_117 (ite .cse4 0 v_~y$w_buff0_used~0_118)) (= v_~y$r_buff0_thd4~0_25 (ite .cse3 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][89], [113#L812true, 72#L2true, Black: 161#(= ~__unbuffered_p1_EAX~0 0), Black: 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 117#P0EXITtrue, 159#true, Black: 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 169#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork3InUse, 167#true, P3Thread1of1ForFork0InUse, 40#L842true, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 101#P1EXITtrue, 175#true, Black: 155#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))])
[2023-11-19 07:46:36,072 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event
[2023-11-19 07:46:36,072 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:36,072 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:36,072 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:36,072 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:36,112 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([403] L835-->L842: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_103 256) 0)) .cse0)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 .cse5))) (and (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_102 256) 0)) .cse0) (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse1)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21) (= (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_103) v_~y$w_buff1_used~0_102) (= v_~y~0_72 (ite .cse4 v_~y$w_buff0~0_54 (ite .cse2 v_~y$w_buff1~0_47 v_~y~0_73))) (= v_~y$w_buff0_used~0_117 (ite .cse4 0 v_~y$w_buff0_used~0_118)) (= v_~y$r_buff0_thd4~0_25 (ite .cse3 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][90], [113#L812true, 72#L2true, Black: 161#(= ~__unbuffered_p1_EAX~0 0), Black: 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 117#P0EXITtrue, 159#true, Black: 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 169#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork3InUse, 167#true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, 40#L842true, P2Thread1of1ForFork2InUse, 101#P1EXITtrue, Black: 155#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 178#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)])
[2023-11-19 07:46:36,112 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event
[2023-11-19 07:46:36,113 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:36,113 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:36,113 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:36,135 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L812-->L819: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0)))) (let ((.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse1)) (.cse0 (and .cse5 .cse2)) (.cse3 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd3~0_27) v_~y$r_buff0_thd3~0_26) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_88 256) 0))) (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse2)) 0 v_~y$r_buff1_thd3~0_20) v_~y$r_buff1_thd3~0_19) (= v_~y~0_60 (ite .cse3 v_~y$w_buff0~0_40 (ite .cse4 v_~y$w_buff1~0_37 v_~y~0_61))) (= (ite (or .cse4 .cse0) 0 v_~y$w_buff1_used~0_89) v_~y$w_buff1_used~0_88) (= v_~y$w_buff0_used~0_99 (ite .cse3 0 v_~y$w_buff0_used~0_100))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_60, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][48], [72#L2true, 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 161#(= ~__unbuffered_p1_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 159#true, 80#L835true, 117#P0EXITtrue, P0Thread1of1ForFork3InUse, Black: 169#(= ~__unbuffered_p3_EAX~0 0), Black: 167#true, 81#L819true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, 101#P1EXITtrue, P2Thread1of1ForFork2InUse, 175#true, Black: 153#true])
[2023-11-19 07:46:36,135 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event
[2023-11-19 07:46:36,135 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:36,135 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:36,135 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:36,150 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L812-->L819: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0)))) (let ((.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse1)) (.cse0 (and .cse5 .cse2)) (.cse3 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd3~0_27) v_~y$r_buff0_thd3~0_26) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_88 256) 0))) (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse2)) 0 v_~y$r_buff1_thd3~0_20) v_~y$r_buff1_thd3~0_19) (= v_~y~0_60 (ite .cse3 v_~y$w_buff0~0_40 (ite .cse4 v_~y$w_buff1~0_37 v_~y~0_61))) (= (ite (or .cse4 .cse0) 0 v_~y$w_buff1_used~0_89) v_~y$w_buff1_used~0_88) (= v_~y$w_buff0_used~0_99 (ite .cse3 0 v_~y$w_buff0_used~0_100))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_60, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][87], [72#L2true, 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 161#(= ~__unbuffered_p1_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 159#true, 80#L835true, 117#P0EXITtrue, P0Thread1of1ForFork3InUse, Black: 169#(= ~__unbuffered_p3_EAX~0 0), Black: 167#true, 81#L819true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 101#P1EXITtrue, Black: 153#true, 178#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)])
[2023-11-19 07:46:36,151 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event
[2023-11-19 07:46:36,151 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:36,151 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:36,151 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:36,202 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([403] L835-->L842: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_103 256) 0)) .cse0)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 .cse5))) (and (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_102 256) 0)) .cse0) (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse1)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21) (= (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_103) v_~y$w_buff1_used~0_102) (= v_~y~0_72 (ite .cse4 v_~y$w_buff0~0_54 (ite .cse2 v_~y$w_buff1~0_47 v_~y~0_73))) (= v_~y$w_buff0_used~0_117 (ite .cse4 0 v_~y$w_buff0_used~0_118)) (= v_~y$r_buff0_thd4~0_25 (ite .cse3 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][89], [113#L812true, Black: 161#(= ~__unbuffered_p1_EAX~0 0), Black: 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 117#P0EXITtrue, Black: 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 159#true, P0Thread1of1ForFork3InUse, Black: 169#(= ~__unbuffered_p3_EAX~0 0), 167#true, P3Thread1of1ForFork0InUse, 40#L842true, P1Thread1of1ForFork1InUse, 101#P1EXITtrue, P2Thread1of1ForFork2InUse, 15#L877true, 175#true, Black: 155#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))])
[2023-11-19 07:46:36,203 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event
[2023-11-19 07:46:36,203 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event
[2023-11-19 07:46:36,203 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event
[2023-11-19 07:46:36,203 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event
[2023-11-19 07:46:36,205 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([509] L877-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_12 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_18|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_30| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_18| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|) (= v_~main$tmp_guard1~0_12 (ite (= (ite (not (and (= v_~z~0_18 2) (= v_~__unbuffered_p1_EBX~0_24 0) (= v_~x~0_20 2) (= 2 v_~__unbuffered_p3_EAX~0_14) (= 0 v_~__unbuffered_p3_EBX~0_14) (= 2 v_~__unbuffered_p1_EAX~0_16))) 1 0) 0) 0 1))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~x~0=v_~x~0_20} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_18|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][109], [113#L812true, Black: 161#(= ~__unbuffered_p1_EAX~0 0), Black: 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 80#L835true, 117#P0EXITtrue, Black: 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 159#true, Black: 169#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork3InUse, 167#true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, 101#P1EXITtrue, P2Thread1of1ForFork2InUse, 175#true, 127#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 155#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))])
[2023-11-19 07:46:36,205 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event
[2023-11-19 07:46:36,205 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event
[2023-11-19 07:46:36,206 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event
[2023-11-19 07:46:36,206 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event
[2023-11-19 07:46:36,228 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([509] L877-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_12 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_18|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_30| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_18| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|) (= v_~main$tmp_guard1~0_12 (ite (= (ite (not (and (= v_~z~0_18 2) (= v_~__unbuffered_p1_EBX~0_24 0) (= v_~x~0_20 2) (= 2 v_~__unbuffered_p3_EAX~0_14) (= 0 v_~__unbuffered_p3_EBX~0_14) (= 2 v_~__unbuffered_p1_EAX~0_16))) 1 0) 0) 0 1))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~x~0=v_~x~0_20} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_18|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][109], [113#L812true, Black: 161#(= ~__unbuffered_p1_EAX~0 0), Black: 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 80#L835true, 117#P0EXITtrue, 159#true, Black: 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork3InUse, Black: 169#(= ~__unbuffered_p3_EAX~0 0), 167#true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 101#P1EXITtrue, 175#true, 127#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 155#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))])
[2023-11-19 07:46:36,228 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event
[2023-11-19 07:46:36,228 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event
[2023-11-19 07:46:36,228 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event
[2023-11-19 07:46:36,229 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event
[2023-11-19 07:46:36,229 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event
[2023-11-19 07:46:36,229 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([403] L835-->L842: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_103 256) 0)) .cse0)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 .cse5))) (and (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_102 256) 0)) .cse0) (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse1)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21) (= (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_103) v_~y$w_buff1_used~0_102) (= v_~y~0_72 (ite .cse4 v_~y$w_buff0~0_54 (ite .cse2 v_~y$w_buff1~0_47 v_~y~0_73))) (= v_~y$w_buff0_used~0_117 (ite .cse4 0 v_~y$w_buff0_used~0_118)) (= v_~y$r_buff0_thd4~0_25 (ite .cse3 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][89], [113#L812true, Black: 161#(= ~__unbuffered_p1_EAX~0 0), Black: 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 117#P0EXITtrue, 159#true, Black: 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 169#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork3InUse, 167#true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, 40#L842true, P2Thread1of1ForFork2InUse, 101#P1EXITtrue, 15#L877true, 175#true, Black: 155#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))])
[2023-11-19 07:46:36,230 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event
[2023-11-19 07:46:36,230 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event
[2023-11-19 07:46:36,230 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event
[2023-11-19 07:46:36,230 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event
[2023-11-19 07:46:36,231 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event
[2023-11-19 07:46:36,300 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L812-->L819: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0)))) (let ((.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse1)) (.cse0 (and .cse5 .cse2)) (.cse3 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd3~0_27) v_~y$r_buff0_thd3~0_26) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_88 256) 0))) (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse2)) 0 v_~y$r_buff1_thd3~0_20) v_~y$r_buff1_thd3~0_19) (= v_~y~0_60 (ite .cse3 v_~y$w_buff0~0_40 (ite .cse4 v_~y$w_buff1~0_37 v_~y~0_61))) (= (ite (or .cse4 .cse0) 0 v_~y$w_buff1_used~0_89) v_~y$w_buff1_used~0_88) (= v_~y$w_buff0_used~0_99 (ite .cse3 0 v_~y$w_buff0_used~0_100))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_60, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][48], [170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 161#(= ~__unbuffered_p1_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 159#true, 80#L835true, 117#P0EXITtrue, P0Thread1of1ForFork3InUse, Black: 169#(= ~__unbuffered_p3_EAX~0 0), Black: 167#true, 81#L819true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, 101#P1EXITtrue, P2Thread1of1ForFork2InUse, 15#L877true, 175#true, Black: 153#true])
[2023-11-19 07:46:36,300 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event
[2023-11-19 07:46:36,300 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event
[2023-11-19 07:46:36,301 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event
[2023-11-19 07:46:36,301 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event
[2023-11-19 07:46:36,404 INFO L124 PetriNetUnfolderBase]: 7872/11566 cut-off events.
[2023-11-19 07:46:36,404 INFO L125 PetriNetUnfolderBase]: For 17911/18766 co-relation queries the response was YES.
[2023-11-19 07:46:36,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33141 conditions, 11566 events. 7872/11566 cut-off events. For 17911/18766 co-relation queries the response was YES. Maximal size of possible extension queue 717. Compared 71177 event pairs, 1308 based on Foata normal form. 1028/12095 useless extension candidates. Maximal degree in co-relation 33122. Up to 7030 conditions per place.
[2023-11-19 07:46:36,523 INFO L140 encePairwiseOnDemand]: 240/247 looper letters, 96 selfloop transitions, 10 changer transitions 0/120 dead transitions.
[2023-11-19 07:46:36,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 120 transitions, 892 flow
[2023-11-19 07:46:36,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-19 07:46:36,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-11-19 07:46:36,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 643 transitions.
[2023-11-19 07:46:36,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5206477732793522
[2023-11-19 07:46:36,528 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 643 transitions.
[2023-11-19 07:46:36,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 643 transitions.
[2023-11-19 07:46:36,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:46:36,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 643 transitions.
[2023-11-19 07:46:36,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 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:46:36,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 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:46:36,538 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 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:46:36,538 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 294 flow. Second operand 5 states and 643 transitions.
[2023-11-19 07:46:36,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 120 transitions, 892 flow
[2023-11-19 07:46:36,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 120 transitions, 888 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-19 07:46:36,567 INFO L231 Difference]: Finished difference. Result has 55 places, 56 transitions, 365 flow
[2023-11-19 07:46:36,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=365, PETRI_PLACES=55, PETRI_TRANSITIONS=56}
[2023-11-19 07:46:36,568 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places.
[2023-11-19 07:46:36,568 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 56 transitions, 365 flow
[2023-11-19 07:46:36,569 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:46:36,569 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:46:36,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:46:36,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-19 07:46:36,570 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:46:36,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:46:36,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1898632935, now seen corresponding path program 1 times
[2023-11-19 07:46:36,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:46:36,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421953357]
[2023-11-19 07:46:36,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:46:36,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:46:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:46:36,790 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:46:36,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:46:36,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421953357]
[2023-11-19 07:46:36,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421953357] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:46:36,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:46:36,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 07:46:36,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855554506]
[2023-11-19 07:46:36,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:46:36,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-19 07:46:36,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:46:36,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-19 07:46:36,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-11-19 07:46:36,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 247
[2023-11-19 07:46:36,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 56 transitions, 365 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:46:36,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:46:36,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 247
[2023-11-19 07:46:36,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:46:38,099 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([403] L835-->L842: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_103 256) 0)) .cse0)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 .cse5))) (and (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_102 256) 0)) .cse0) (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse1)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21) (= (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_103) v_~y$w_buff1_used~0_102) (= v_~y~0_72 (ite .cse4 v_~y$w_buff0~0_54 (ite .cse2 v_~y$w_buff1~0_47 v_~y~0_73))) (= v_~y$w_buff0_used~0_117 (ite .cse4 0 v_~y$w_buff0_used~0_118)) (= v_~y$r_buff0_thd4~0_25 (ite .cse3 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][147], [72#L2true, 113#L812true, 189#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 161#(= ~__unbuffered_p1_EAX~0 0), Black: 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 117#P0EXITtrue, 159#true, Black: 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork3InUse, Black: 169#(= ~__unbuffered_p3_EAX~0 0), 167#true, P3Thread1of1ForFork0InUse, 40#L842true, P1Thread1of1ForFork1InUse, 101#P1EXITtrue, P2Thread1of1ForFork2InUse, Black: 177#(= ~__unbuffered_cnt~0 0), Black: 180#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 178#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 175#true, Black: 155#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))])
[2023-11-19 07:46:38,099 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event
[2023-11-19 07:46:38,099 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:38,099 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:38,099 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:38,124 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([403] L835-->L842: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_103 256) 0)) .cse0)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 .cse5))) (and (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_102 256) 0)) .cse0) (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse1)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21) (= (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_103) v_~y$w_buff1_used~0_102) (= v_~y~0_72 (ite .cse4 v_~y$w_buff0~0_54 (ite .cse2 v_~y$w_buff1~0_47 v_~y~0_73))) (= v_~y$w_buff0_used~0_117 (ite .cse4 0 v_~y$w_buff0_used~0_118)) (= v_~y$r_buff0_thd4~0_25 (ite .cse3 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][147], [72#L2true, 113#L812true, 189#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 161#(= ~__unbuffered_p1_EAX~0 0), Black: 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 117#P0EXITtrue, 159#true, Black: 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork3InUse, Black: 169#(= ~__unbuffered_p3_EAX~0 0), 167#true, P3Thread1of1ForFork0InUse, 40#L842true, P1Thread1of1ForFork1InUse, 101#P1EXITtrue, P2Thread1of1ForFork2InUse, Black: 177#(= ~__unbuffered_cnt~0 0), Black: 180#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 178#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)])
[2023-11-19 07:46:38,124 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event
[2023-11-19 07:46:38,124 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:38,124 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:38,124 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:38,135 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L812-->L819: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0)))) (let ((.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse1)) (.cse0 (and .cse5 .cse2)) (.cse3 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd3~0_27) v_~y$r_buff0_thd3~0_26) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_88 256) 0))) (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse2)) 0 v_~y$r_buff1_thd3~0_20) v_~y$r_buff1_thd3~0_19) (= v_~y~0_60 (ite .cse3 v_~y$w_buff0~0_40 (ite .cse4 v_~y$w_buff1~0_37 v_~y~0_61))) (= (ite (or .cse4 .cse0) 0 v_~y$w_buff1_used~0_89) v_~y$w_buff1_used~0_88) (= v_~y$w_buff0_used~0_99 (ite .cse3 0 v_~y$w_buff0_used~0_100))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_60, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][146], [72#L2true, 189#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 161#(= ~__unbuffered_p1_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 159#true, 80#L835true, 117#P0EXITtrue, Black: 169#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork3InUse, 81#L819true, Black: 167#true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 101#P1EXITtrue, Black: 177#(= ~__unbuffered_cnt~0 0), Black: 180#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 178#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 175#true, Black: 153#true])
[2023-11-19 07:46:38,135 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event
[2023-11-19 07:46:38,135 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:38,135 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:38,135 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:38,139 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L812-->L819: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0)))) (let ((.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse1)) (.cse0 (and .cse5 .cse2)) (.cse3 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd3~0_27) v_~y$r_buff0_thd3~0_26) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_88 256) 0))) (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse2)) 0 v_~y$r_buff1_thd3~0_20) v_~y$r_buff1_thd3~0_19) (= v_~y~0_60 (ite .cse3 v_~y$w_buff0~0_40 (ite .cse4 v_~y$w_buff1~0_37 v_~y~0_61))) (= (ite (or .cse4 .cse0) 0 v_~y$w_buff1_used~0_89) v_~y$w_buff1_used~0_88) (= v_~y$w_buff0_used~0_99 (ite .cse3 0 v_~y$w_buff0_used~0_100))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_60, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][146], [72#L2true, 189#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 161#(= ~__unbuffered_p1_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 159#true, 80#L835true, 117#P0EXITtrue, Black: 169#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork3InUse, 81#L819true, Black: 167#true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 101#P1EXITtrue, Black: 177#(= ~__unbuffered_cnt~0 0), Black: 180#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 153#true, 178#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)])
[2023-11-19 07:46:38,139 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event
[2023-11-19 07:46:38,140 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:38,140 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:38,140 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:38,255 INFO L124 PetriNetUnfolderBase]: 6518/9843 cut-off events.
[2023-11-19 07:46:38,255 INFO L125 PetriNetUnfolderBase]: For 18467/19044 co-relation queries the response was YES.
[2023-11-19 07:46:38,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34634 conditions, 9843 events. 6518/9843 cut-off events. For 18467/19044 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 61587 event pairs, 639 based on Foata normal form. 713/10209 useless extension candidates. Maximal degree in co-relation 34611. Up to 2930 conditions per place.
[2023-11-19 07:46:38,347 INFO L140 encePairwiseOnDemand]: 240/247 looper letters, 131 selfloop transitions, 19 changer transitions 3/167 dead transitions.
[2023-11-19 07:46:38,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 167 transitions, 1331 flow
[2023-11-19 07:46:38,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-11-19 07:46:38,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-19 07:46:38,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 902 transitions.
[2023-11-19 07:46:38,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5216888374783112
[2023-11-19 07:46:38,354 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 902 transitions.
[2023-11-19 07:46:38,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 902 transitions.
[2023-11-19 07:46:38,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:46:38,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 902 transitions.
[2023-11-19 07:46:38,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.85714285714286) internal successors, (902), 7 states have internal predecessors, (902), 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:46:38,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 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:46:38,364 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 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:46:38,365 INFO L175 Difference]: Start difference. First operand has 55 places, 56 transitions, 365 flow. Second operand 7 states and 902 transitions.
[2023-11-19 07:46:38,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 167 transitions, 1331 flow
[2023-11-19 07:46:38,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 167 transitions, 1326 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-19 07:46:38,424 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 494 flow
[2023-11-19 07:46:38,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=494, PETRI_PLACES=63, PETRI_TRANSITIONS=65}
[2023-11-19 07:46:38,427 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places.
[2023-11-19 07:46:38,428 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 494 flow
[2023-11-19 07:46:38,428 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:46:38,428 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:46:38,429 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:46:38,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-19 07:46:38,429 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:46:38,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:46:38,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1506026373, now seen corresponding path program 1 times
[2023-11-19 07:46:38,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:46:38,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658260663]
[2023-11-19 07:46:38,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:46:38,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:46:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:46:38,759 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:46:38,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:46:38,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658260663]
[2023-11-19 07:46:38,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658260663] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:46:38,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:46:38,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-19 07:46:38,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368820184]
[2023-11-19 07:46:38,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:46:38,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-19 07:46:38,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:46:38,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-19 07:46:38,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2023-11-19 07:46:38,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 247
[2023-11-19 07:46:38,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 494 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:46:38,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:46:38,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 247
[2023-11-19 07:46:38,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:46:40,444 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([403] L835-->L842: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_103 256) 0)) .cse0)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 .cse5))) (and (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_102 256) 0)) .cse0) (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse1)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21) (= (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_103) v_~y$w_buff1_used~0_102) (= v_~y~0_72 (ite .cse4 v_~y$w_buff0~0_54 (ite .cse2 v_~y$w_buff1~0_47 v_~y~0_73))) (= v_~y$w_buff0_used~0_117 (ite .cse4 0 v_~y$w_buff0_used~0_118)) (= v_~y$r_buff0_thd4~0_25 (ite .cse3 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][146], [72#L2true, 113#L812true, 189#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 193#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 161#(= ~__unbuffered_p1_EAX~0 0), Black: 188#(<= ~__unbuffered_cnt~0 1), Black: 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 117#P0EXITtrue, Black: 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 159#true, P0Thread1of1ForFork3InUse, Black: 169#(= ~__unbuffered_p3_EAX~0 0), 209#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 167#true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, 40#L842true, 101#P1EXITtrue, P2Thread1of1ForFork2InUse, Black: 177#(= ~__unbuffered_cnt~0 0), Black: 180#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 178#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 155#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))])
[2023-11-19 07:46:40,445 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event
[2023-11-19 07:46:40,445 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:40,445 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:40,445 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:40,475 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([403] L835-->L842: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_103 256) 0)) .cse0)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 .cse5))) (and (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_102 256) 0)) .cse0) (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse1)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21) (= (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_103) v_~y$w_buff1_used~0_102) (= v_~y~0_72 (ite .cse4 v_~y$w_buff0~0_54 (ite .cse2 v_~y$w_buff1~0_47 v_~y~0_73))) (= v_~y$w_buff0_used~0_117 (ite .cse4 0 v_~y$w_buff0_used~0_118)) (= v_~y$r_buff0_thd4~0_25 (ite .cse3 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][146], [113#L812true, 72#L2true, 189#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 193#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 161#(= ~__unbuffered_p1_EAX~0 0), Black: 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 188#(<= ~__unbuffered_cnt~0 1), 117#P0EXITtrue, Black: 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 159#true, P0Thread1of1ForFork3InUse, Black: 169#(= ~__unbuffered_p3_EAX~0 0), 167#true, 209#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, 40#L842true, 101#P1EXITtrue, P2Thread1of1ForFork2InUse, Black: 177#(= ~__unbuffered_cnt~0 0), Black: 180#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 178#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)])
[2023-11-19 07:46:40,475 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event
[2023-11-19 07:46:40,476 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:40,476 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:40,476 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:40,488 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L812-->L819: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0)))) (let ((.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse1)) (.cse0 (and .cse5 .cse2)) (.cse3 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd3~0_27) v_~y$r_buff0_thd3~0_26) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_88 256) 0))) (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse2)) 0 v_~y$r_buff1_thd3~0_20) v_~y$r_buff1_thd3~0_19) (= v_~y~0_60 (ite .cse3 v_~y$w_buff0~0_40 (ite .cse4 v_~y$w_buff1~0_37 v_~y~0_61))) (= (ite (or .cse4 .cse0) 0 v_~y$w_buff1_used~0_89) v_~y$w_buff1_used~0_88) (= v_~y$w_buff0_used~0_99 (ite .cse3 0 v_~y$w_buff0_used~0_100))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_60, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][145], [72#L2true, 189#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 161#(= ~__unbuffered_p1_EAX~0 0), Black: 193#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 188#(<= ~__unbuffered_cnt~0 1), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 159#true, 80#L835true, 117#P0EXITtrue, P0Thread1of1ForFork3InUse, Black: 169#(= ~__unbuffered_p3_EAX~0 0), 81#L819true, 209#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 167#true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 101#P1EXITtrue, Black: 177#(= ~__unbuffered_cnt~0 0), Black: 180#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 178#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 153#true])
[2023-11-19 07:46:40,489 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event
[2023-11-19 07:46:40,489 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:40,489 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:40,489 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:40,496 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L812-->L819: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0)))) (let ((.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse1)) (.cse0 (and .cse5 .cse2)) (.cse3 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd3~0_27) v_~y$r_buff0_thd3~0_26) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_88 256) 0))) (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse2)) 0 v_~y$r_buff1_thd3~0_20) v_~y$r_buff1_thd3~0_19) (= v_~y~0_60 (ite .cse3 v_~y$w_buff0~0_40 (ite .cse4 v_~y$w_buff1~0_37 v_~y~0_61))) (= (ite (or .cse4 .cse0) 0 v_~y$w_buff1_used~0_89) v_~y$w_buff1_used~0_88) (= v_~y$w_buff0_used~0_99 (ite .cse3 0 v_~y$w_buff0_used~0_100))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_60, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][145], [72#L2true, 189#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 193#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 161#(= ~__unbuffered_p1_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 188#(<= ~__unbuffered_cnt~0 1), Black: 159#true, 80#L835true, 117#P0EXITtrue, P0Thread1of1ForFork3InUse, Black: 169#(= ~__unbuffered_p3_EAX~0 0), Black: 167#true, 81#L819true, 209#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 101#P1EXITtrue, Black: 177#(= ~__unbuffered_cnt~0 0), Black: 180#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 153#true, 178#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)])
[2023-11-19 07:46:40,496 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event
[2023-11-19 07:46:40,496 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:40,496 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:40,496 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event
[2023-11-19 07:46:40,616 INFO L124 PetriNetUnfolderBase]: 6069/9173 cut-off events.
[2023-11-19 07:46:40,616 INFO L125 PetriNetUnfolderBase]: For 24331/24876 co-relation queries the response was YES.
[2023-11-19 07:46:40,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36772 conditions, 9173 events. 6069/9173 cut-off events. For 24331/24876 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 57169 event pairs, 539 based on Foata normal form. 336/9196 useless extension candidates. Maximal degree in co-relation 36745. Up to 2789 conditions per place.
[2023-11-19 07:46:40,695 INFO L140 encePairwiseOnDemand]: 240/247 looper letters, 142 selfloop transitions, 28 changer transitions 18/202 dead transitions.
[2023-11-19 07:46:40,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 202 transitions, 1714 flow
[2023-11-19 07:46:40,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2023-11-19 07:46:40,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2023-11-19 07:46:40,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1159 transitions.
[2023-11-19 07:46:40,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5213675213675214
[2023-11-19 07:46:40,701 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1159 transitions.
[2023-11-19 07:46:40,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1159 transitions.
[2023-11-19 07:46:40,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:46:40,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1159 transitions.
[2023-11-19 07:46:40,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 128.77777777777777) internal successors, (1159), 9 states have internal predecessors, (1159), 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:46:40,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 247.0) internal successors, (2470), 10 states have internal predecessors, (2470), 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:46:40,714 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 247.0) internal successors, (2470), 10 states have internal predecessors, (2470), 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:46:40,714 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 494 flow. Second operand 9 states and 1159 transitions.
[2023-11-19 07:46:40,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 202 transitions, 1714 flow
[2023-11-19 07:46:41,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 202 transitions, 1664 flow, removed 17 selfloop flow, removed 3 redundant places.
[2023-11-19 07:46:41,249 INFO L231 Difference]: Finished difference. Result has 71 places, 74 transitions, 622 flow
[2023-11-19 07:46:41,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=622, PETRI_PLACES=71, PETRI_TRANSITIONS=74}
[2023-11-19 07:46:41,250 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 29 predicate places.
[2023-11-19 07:46:41,250 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 74 transitions, 622 flow
[2023-11-19 07:46:41,251 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:46:41,251 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:46:41,251 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:46:41,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-19 07:46:41,252 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:46:41,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:46:41,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1008419126, now seen corresponding path program 1 times
[2023-11-19 07:46:41,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:46:41,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298664040]
[2023-11-19 07:46:41,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:46:41,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:46:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:46:41,586 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:46:41,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:46:41,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298664040]
[2023-11-19 07:46:41,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298664040] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:46:41,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:46:41,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:46:41,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562131689]
[2023-11-19 07:46:41,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:46:41,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:46:41,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:46:41,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:46:41,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:46:41,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 247
[2023-11-19 07:46:41,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 74 transitions, 622 flow. Second operand has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 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:46:41,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:46:41,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 247
[2023-11-19 07:46:41,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:46:43,591 INFO L124 PetriNetUnfolderBase]: 8927/13028 cut-off events.
[2023-11-19 07:46:43,591 INFO L125 PetriNetUnfolderBase]: For 50149/50149 co-relation queries the response was YES.
[2023-11-19 07:46:43,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57316 conditions, 13028 events. 8927/13028 cut-off events. For 50149/50149 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 75273 event pairs, 731 based on Foata normal form. 11/13039 useless extension candidates. Maximal degree in co-relation 57286. Up to 5901 conditions per place.
[2023-11-19 07:46:43,689 INFO L140 encePairwiseOnDemand]: 236/247 looper letters, 107 selfloop transitions, 41 changer transitions 60/208 dead transitions.
[2023-11-19 07:46:43,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 208 transitions, 2155 flow
[2023-11-19 07:46:43,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-19 07:46:43,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-11-19 07:46:43,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 626 transitions.
[2023-11-19 07:46:43,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5068825910931174
[2023-11-19 07:46:43,693 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 626 transitions.
[2023-11-19 07:46:43,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 626 transitions.
[2023-11-19 07:46:43,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:46:43,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 626 transitions.
[2023-11-19 07:46:43,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 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:46:43,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 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:46:43,702 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 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:46:43,702 INFO L175 Difference]: Start difference. First operand has 71 places, 74 transitions, 622 flow. Second operand 5 states and 626 transitions.
[2023-11-19 07:46:43,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 208 transitions, 2155 flow
[2023-11-19 07:46:44,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 208 transitions, 1814 flow, removed 120 selfloop flow, removed 4 redundant places.
[2023-11-19 07:46:44,815 INFO L231 Difference]: Finished difference. Result has 74 places, 84 transitions, 804 flow
[2023-11-19 07:46:44,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=804, PETRI_PLACES=74, PETRI_TRANSITIONS=84}
[2023-11-19 07:46:44,816 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 32 predicate places.
[2023-11-19 07:46:44,816 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 84 transitions, 804 flow
[2023-11-19 07:46:44,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 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:46:44,817 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:46:44,817 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:46:44,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-19 07:46:44,817 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:46:44,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:46:44,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1741382406, now seen corresponding path program 2 times
[2023-11-19 07:46:44,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:46:44,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809169175]
[2023-11-19 07:46:44,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:46:44,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:46:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:46:45,098 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:46:45,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:46:45,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809169175]
[2023-11-19 07:46:45,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809169175] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:46:45,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:46:45,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 07:46:45,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43813047]
[2023-11-19 07:46:45,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:46:45,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-19 07:46:45,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:46:45,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-19 07:46:45,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-11-19 07:46:45,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 247
[2023-11-19 07:46:45,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 84 transitions, 804 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:46:45,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:46:45,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 247
[2023-11-19 07:46:45,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:46:46,176 INFO L124 PetriNetUnfolderBase]: 4322/6511 cut-off events.
[2023-11-19 07:46:46,176 INFO L125 PetriNetUnfolderBase]: For 24948/24948 co-relation queries the response was YES.
[2023-11-19 07:46:46,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29520 conditions, 6511 events. 4322/6511 cut-off events. For 24948/24948 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 34859 event pairs, 387 based on Foata normal form. 11/6522 useless extension candidates. Maximal degree in co-relation 29486. Up to 2067 conditions per place.
[2023-11-19 07:46:46,223 INFO L140 encePairwiseOnDemand]: 236/247 looper letters, 102 selfloop transitions, 38 changer transitions 46/186 dead transitions.
[2023-11-19 07:46:46,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 186 transitions, 1836 flow
[2023-11-19 07:46:46,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-11-19 07:46:46,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-19 07:46:46,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 747 transitions.
[2023-11-19 07:46:46,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5040485829959515
[2023-11-19 07:46:46,227 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 747 transitions.
[2023-11-19 07:46:46,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 747 transitions.
[2023-11-19 07:46:46,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:46:46,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 747 transitions.
[2023-11-19 07:46:46,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.5) internal successors, (747), 6 states have internal predecessors, (747), 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:46:46,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 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:46:46,235 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 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:46:46,235 INFO L175 Difference]: Start difference. First operand has 74 places, 84 transitions, 804 flow. Second operand 6 states and 747 transitions.
[2023-11-19 07:46:46,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 186 transitions, 1836 flow
[2023-11-19 07:46:46,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 186 transitions, 1762 flow, removed 37 selfloop flow, removed 5 redundant places.
[2023-11-19 07:46:46,367 INFO L231 Difference]: Finished difference. Result has 69 places, 75 transitions, 760 flow
[2023-11-19 07:46:46,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=760, PETRI_PLACES=69, PETRI_TRANSITIONS=75}
[2023-11-19 07:46:46,368 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places.
[2023-11-19 07:46:46,368 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 75 transitions, 760 flow
[2023-11-19 07:46:46,369 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:46:46,369 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:46:46,369 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:46:46,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-19 07:46:46,369 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:46:46,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:46:46,370 INFO L85 PathProgramCache]: Analyzing trace with hash -785838328, now seen corresponding path program 3 times
[2023-11-19 07:46:46,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:46:46,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806161771]
[2023-11-19 07:46:46,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:46:46,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:46:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:46:46,598 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:46:46,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:46:46,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806161771]
[2023-11-19 07:46:46,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806161771] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:46:46,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:46:46,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:46:46,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174607566]
[2023-11-19 07:46:46,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:46:46,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:46:46,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:46:46,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:46:46,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:46:46,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 247
[2023-11-19 07:46:46,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 75 transitions, 760 flow. Second operand has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 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:46:46,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:46:46,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 247
[2023-11-19 07:46:46,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:46:47,496 INFO L124 PetriNetUnfolderBase]: 4245/6666 cut-off events.
[2023-11-19 07:46:47,496 INFO L125 PetriNetUnfolderBase]: For 28038/28038 co-relation queries the response was YES.
[2023-11-19 07:46:47,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30176 conditions, 6666 events. 4245/6666 cut-off events. For 28038/28038 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 38469 event pairs, 708 based on Foata normal form. 11/6677 useless extension candidates. Maximal degree in co-relation 30144. Up to 2932 conditions per place.
[2023-11-19 07:46:47,539 INFO L140 encePairwiseOnDemand]: 237/247 looper letters, 88 selfloop transitions, 37 changer transitions 23/148 dead transitions.
[2023-11-19 07:46:47,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 148 transitions, 1599 flow
[2023-11-19 07:46:47,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-11-19 07:46:47,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-19 07:46:47,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 508 transitions.
[2023-11-19 07:46:47,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5141700404858299
[2023-11-19 07:46:47,542 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 508 transitions.
[2023-11-19 07:46:47,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 508 transitions.
[2023-11-19 07:46:47,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:46:47,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 508 transitions.
[2023-11-19 07:46:47,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 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:46:47,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 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:46:47,548 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 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:46:47,548 INFO L175 Difference]: Start difference. First operand has 69 places, 75 transitions, 760 flow. Second operand 4 states and 508 transitions.
[2023-11-19 07:46:47,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 148 transitions, 1599 flow
[2023-11-19 07:46:47,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 148 transitions, 1471 flow, removed 1 selfloop flow, removed 6 redundant places.
[2023-11-19 07:46:47,682 INFO L231 Difference]: Finished difference. Result has 69 places, 80 transitions, 876 flow
[2023-11-19 07:46:47,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=876, PETRI_PLACES=69, PETRI_TRANSITIONS=80}
[2023-11-19 07:46:47,682 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places.
[2023-11-19 07:46:47,683 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 80 transitions, 876 flow
[2023-11-19 07:46:47,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 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:46:47,683 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:46:47,683 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:46:47,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-19 07:46:47,684 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:46:47,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:46:47,684 INFO L85 PathProgramCache]: Analyzing trace with hash -265296796, now seen corresponding path program 4 times
[2023-11-19 07:46:47,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:46:47,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906489116]
[2023-11-19 07:46:47,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:46:47,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:46:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:46:47,915 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:46:47,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:46:47,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906489116]
[2023-11-19 07:46:47,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906489116] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:46:47,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:46:47,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-11-19 07:46:47,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719858367]
[2023-11-19 07:46:47,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:46:47,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-19 07:46:47,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:46:47,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-19 07:46:47,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2023-11-19 07:46:47,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 247
[2023-11-19 07:46:47,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 80 transitions, 876 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:46:47,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:46:47,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 247
[2023-11-19 07:46:47,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:46:48,799 INFO L124 PetriNetUnfolderBase]: 2643/4466 cut-off events.
[2023-11-19 07:46:48,799 INFO L125 PetriNetUnfolderBase]: For 18779/19202 co-relation queries the response was YES.
[2023-11-19 07:46:48,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18605 conditions, 4466 events. 2643/4466 cut-off events. For 18779/19202 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 28617 event pairs, 452 based on Foata normal form. 108/4470 useless extension candidates. Maximal degree in co-relation 18572. Up to 1704 conditions per place.
[2023-11-19 07:46:48,820 INFO L140 encePairwiseOnDemand]: 240/247 looper letters, 49 selfloop transitions, 18 changer transitions 93/171 dead transitions.
[2023-11-19 07:46:48,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 171 transitions, 2042 flow
[2023-11-19 07:46:48,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2023-11-19 07:46:48,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-11-19 07:46:48,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1006 transitions.
[2023-11-19 07:46:48,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5091093117408907
[2023-11-19 07:46:48,824 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1006 transitions.
[2023-11-19 07:46:48,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1006 transitions.
[2023-11-19 07:46:48,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:46:48,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1006 transitions.
[2023-11-19 07:46:48,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.75) internal successors, (1006), 8 states have internal predecessors, (1006), 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:46:48,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 247.0) internal successors, (2223), 9 states have internal predecessors, (2223), 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:46:48,833 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 247.0) internal successors, (2223), 9 states have internal predecessors, (2223), 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:46:48,834 INFO L175 Difference]: Start difference. First operand has 69 places, 80 transitions, 876 flow. Second operand 8 states and 1006 transitions.
[2023-11-19 07:46:48,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 171 transitions, 2042 flow
[2023-11-19 07:46:48,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 171 transitions, 2009 flow, removed 10 selfloop flow, removed 2 redundant places.
[2023-11-19 07:46:48,943 INFO L231 Difference]: Finished difference. Result has 77 places, 50 transitions, 455 flow
[2023-11-19 07:46:48,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=851, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=455, PETRI_PLACES=77, PETRI_TRANSITIONS=50}
[2023-11-19 07:46:48,944 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 35 predicate places.
[2023-11-19 07:46:48,945 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 50 transitions, 455 flow
[2023-11-19 07:46:48,945 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:46:48,945 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:46:48,945 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:46:48,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-11-19 07:46:48,946 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:46:48,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:46:48,946 INFO L85 PathProgramCache]: Analyzing trace with hash 991522964, now seen corresponding path program 1 times
[2023-11-19 07:46:48,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:46:48,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738496898]
[2023-11-19 07:46:48,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:46:48,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:46:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:46:49,219 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:46:49,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:46:49,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738496898]
[2023-11-19 07:46:49,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738496898] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:46:49,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:46:49,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:46:49,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831149472]
[2023-11-19 07:46:49,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:46:49,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:46:49,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:46:49,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:46:49,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:46:49,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 247
[2023-11-19 07:46:49,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 50 transitions, 455 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 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:46:49,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:46:49,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 247
[2023-11-19 07:46:49,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:46:49,559 INFO L124 PetriNetUnfolderBase]: 878/1519 cut-off events.
[2023-11-19 07:46:49,559 INFO L125 PetriNetUnfolderBase]: For 8004/8004 co-relation queries the response was YES.
[2023-11-19 07:46:49,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7244 conditions, 1519 events. 878/1519 cut-off events. For 8004/8004 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7331 event pairs, 205 based on Foata normal form. 1/1520 useless extension candidates. Maximal degree in co-relation 7208. Up to 827 conditions per place.
[2023-11-19 07:46:49,569 INFO L140 encePairwiseOnDemand]: 241/247 looper letters, 49 selfloop transitions, 5 changer transitions 41/95 dead transitions.
[2023-11-19 07:46:49,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 95 transitions, 999 flow
[2023-11-19 07:46:49,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-11-19 07:46:49,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-19 07:46:49,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions.
[2023-11-19 07:46:49,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4979757085020243
[2023-11-19 07:46:49,572 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 492 transitions.
[2023-11-19 07:46:49,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 492 transitions.
[2023-11-19 07:46:49,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:46:49,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 492 transitions.
[2023-11-19 07:46:49,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 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:46:49,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 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:46:49,577 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 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:46:49,577 INFO L175 Difference]: Start difference. First operand has 77 places, 50 transitions, 455 flow. Second operand 4 states and 492 transitions.
[2023-11-19 07:46:49,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 95 transitions, 999 flow
[2023-11-19 07:46:49,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 95 transitions, 755 flow, removed 48 selfloop flow, removed 14 redundant places.
[2023-11-19 07:46:49,598 INFO L231 Difference]: Finished difference. Result has 65 places, 39 transitions, 223 flow
[2023-11-19 07:46:49,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=223, PETRI_PLACES=65, PETRI_TRANSITIONS=39}
[2023-11-19 07:46:49,601 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places.
[2023-11-19 07:46:49,601 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 39 transitions, 223 flow
[2023-11-19 07:46:49,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 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:46:49,601 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:46:49,602 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:46:49,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-11-19 07:46:49,602 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:46:49,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:46:49,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1135358452, now seen corresponding path program 2 times
[2023-11-19 07:46:49,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:46:49,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661212091]
[2023-11-19 07:46:49,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:46:49,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:46:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:46:50,837 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:46:50,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:46:50,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661212091]
[2023-11-19 07:46:50,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661212091] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:46:50,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:46:50,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-19 07:46:50,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923531740]
[2023-11-19 07:46:50,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:46:50,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-19 07:46:50,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:46:50,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-19 07:46:50,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2023-11-19 07:46:50,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 247
[2023-11-19 07:46:50,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 39 transitions, 223 flow. Second operand has 7 states, 7 states have (on average 118.28571428571429) internal successors, (828), 7 states have internal predecessors, (828), 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:46:50,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:46:50,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 247
[2023-11-19 07:46:50,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:46:51,191 INFO L124 PetriNetUnfolderBase]: 254/475 cut-off events.
[2023-11-19 07:46:51,191 INFO L125 PetriNetUnfolderBase]: For 1601/1630 co-relation queries the response was YES.
[2023-11-19 07:46:51,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1843 conditions, 475 events. 254/475 cut-off events. For 1601/1630 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1993 event pairs, 24 based on Foata normal form. 2/473 useless extension candidates. Maximal degree in co-relation 1816. Up to 193 conditions per place.
[2023-11-19 07:46:51,194 INFO L140 encePairwiseOnDemand]: 241/247 looper letters, 62 selfloop transitions, 4 changer transitions 26/96 dead transitions.
[2023-11-19 07:46:51,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 96 transitions, 743 flow
[2023-11-19 07:46:51,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-11-19 07:46:51,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-19 07:46:51,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 745 transitions.
[2023-11-19 07:46:51,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5026990553306343
[2023-11-19 07:46:51,198 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 745 transitions.
[2023-11-19 07:46:51,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 745 transitions.
[2023-11-19 07:46:51,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:46:51,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 745 transitions.
[2023-11-19 07:46:51,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 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:46:51,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 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:46:51,205 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 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:46:51,206 INFO L175 Difference]: Start difference. First operand has 65 places, 39 transitions, 223 flow. Second operand 6 states and 745 transitions.
[2023-11-19 07:46:51,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 96 transitions, 743 flow
[2023-11-19 07:46:51,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 96 transitions, 639 flow, removed 16 selfloop flow, removed 14 redundant places.
[2023-11-19 07:46:51,212 INFO L231 Difference]: Finished difference. Result has 57 places, 41 transitions, 196 flow
[2023-11-19 07:46:51,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=196, PETRI_PLACES=57, PETRI_TRANSITIONS=41}
[2023-11-19 07:46:51,213 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places.
[2023-11-19 07:46:51,214 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 41 transitions, 196 flow
[2023-11-19 07:46:51,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 118.28571428571429) internal successors, (828), 7 states have internal predecessors, (828), 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:46:51,214 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:46:51,215 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:46:51,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-11-19 07:46:51,215 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:46:51,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:46:51,216 INFO L85 PathProgramCache]: Analyzing trace with hash 99352748, now seen corresponding path program 3 times
[2023-11-19 07:46:51,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:46:51,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970224476]
[2023-11-19 07:46:51,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:46:51,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:46:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 07:46:51,304 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-19 07:46:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 07:46:51,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-19 07:46:51,424 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2023-11-19 07:46:51,425 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining)
[2023-11-19 07:46:51,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining)
[2023-11-19 07:46:51,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining)
[2023-11-19 07:46:51,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining)
[2023-11-19 07:46:51,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining)
[2023-11-19 07:46:51,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining)
[2023-11-19 07:46:51,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining)
[2023-11-19 07:46:51,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-11-19 07:46:51,432 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:46:51,440 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-11-19 07:46:51,441 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2023-11-19 07:46:51,523 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2023-11-19 07:46:51,529 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
[2023-11-19 07:46:51,533 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated
[2023-11-19 07:46:51,540 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated
[2023-11-19 07:46:51,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:46:51 BasicIcfg
[2023-11-19 07:46:51,576 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-19 07:46:51,577 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2023-11-19 07:46:51,577 INFO L270 PluginConnector]: Initializing Witness Printer...
[2023-11-19 07:46:51,577 INFO L274 PluginConnector]: Witness Printer initialized
[2023-11-19 07:46:51,578 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:46:18" (3/4) ...
[2023-11-19 07:46:51,579 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample
[2023-11-19 07:46:51,619 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2023-11-19 07:46:51,620 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
[2023-11-19 07:46:51,625 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated
[2023-11-19 07:46:51,626 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated
[2023-11-19 07:46:51,713 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697728d-4b23-42f8-ac00-9aadfe595b32/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml
[2023-11-19 07:46:51,713 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-11-19 07:46:51,714 INFO L158 Benchmark]: Toolchain (without parser) took 35107.46ms. Allocated memory was 157.3MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 111.6MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 518.9MB. Max. memory is 16.1GB.
[2023-11-19 07:46:51,714 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 121.6MB. Free memory is still 68.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-11-19 07:46:51,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 653.36ms. Allocated memory is still 157.3MB. Free memory was 111.6MB in the beginning and 87.7MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
[2023-11-19 07:46:51,715 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.36ms. Allocated memory is still 157.3MB. Free memory was 87.7MB in the beginning and 85.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-19 07:46:51,715 INFO L158 Benchmark]: Boogie Preprocessor took 48.08ms. Allocated memory is still 157.3MB. Free memory was 85.2MB in the beginning and 83.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-19 07:46:51,716 INFO L158 Benchmark]: RCFGBuilder took 885.14ms. Allocated memory is still 157.3MB. Free memory was 83.1MB in the beginning and 121.3MB in the end (delta: -38.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB.
[2023-11-19 07:46:51,716 INFO L158 Benchmark]: TraceAbstraction took 33318.49ms. Allocated memory was 157.3MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 120.6MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 513.7MB. Max. memory is 16.1GB.
[2023-11-19 07:46:51,716 INFO L158 Benchmark]: Witness Printer took 136.25ms. Allocated memory is still 2.7GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
[2023-11-19 07:46:51,721 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.51ms. Allocated memory is still 121.6MB. Free memory is still 68.2MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 653.36ms. Allocated memory is still 157.3MB. Free memory was 111.6MB in the beginning and 87.7MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 58.36ms. Allocated memory is still 157.3MB. Free memory was 87.7MB in the beginning and 85.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 48.08ms. Allocated memory is still 157.3MB. Free memory was 85.2MB in the beginning and 83.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 885.14ms. Allocated memory is still 157.3MB. Free memory was 83.1MB in the beginning and 121.3MB in the end (delta: -38.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB.
* TraceAbstraction took 33318.49ms. Allocated memory was 157.3MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 120.6MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 513.7MB. Max. memory is 16.1GB.
* Witness Printer took 136.25ms. Allocated memory is still 2.7GB. Free memory was 2.2GB in the beginning and 2.2GB 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.4s, 142 PlacesBefore, 42 PlacesAfterwards, 131 TransitionsBefore, 30 TransitionsAfterwards, 3520 CoEnabledTransitionPairs, 6 FixpointIterations, 42 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 112 TotalNumberOfCompositions, 7803 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3287, independent: 3086, independent conditional: 0, independent unconditional: 3086, dependent: 201, dependent conditional: 0, dependent unconditional: 201, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1876, independent: 1824, independent conditional: 0, independent unconditional: 1824, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3287, independent: 1262, independent conditional: 0, independent unconditional: 1262, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 1876, unknown conditional: 0, unknown unconditional: 1876] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 129, Positive conditional cache size: 0, Positive unconditional cache size: 129, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, 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_p1_EAX = 0;
[L714] 0 int __unbuffered_p1_EBX = 0;
[L716] 0 int __unbuffered_p3_EAX = 0;
[L718] 0 int __unbuffered_p3_EBX = 0;
[L720] 0 int a = 0;
[L721] 0 _Bool main$tmp_guard0;
[L722] 0 _Bool main$tmp_guard1;
[L724] 0 int x = 0;
[L726] 0 int y = 0;
[L727] 0 _Bool y$flush_delayed;
[L728] 0 int y$mem_tmp;
[L729] 0 _Bool y$r_buff0_thd0;
[L730] 0 _Bool y$r_buff0_thd1;
[L731] 0 _Bool y$r_buff0_thd2;
[L732] 0 _Bool y$r_buff0_thd3;
[L733] 0 _Bool y$r_buff0_thd4;
[L734] 0 _Bool y$r_buff1_thd0;
[L735] 0 _Bool y$r_buff1_thd1;
[L736] 0 _Bool y$r_buff1_thd2;
[L737] 0 _Bool y$r_buff1_thd3;
[L738] 0 _Bool y$r_buff1_thd4;
[L739] 0 _Bool y$read_delayed;
[L740] 0 int *y$read_delayed_var;
[L741] 0 int y$w_buff0;
[L742] 0 _Bool y$w_buff0_used;
[L743] 0 int y$w_buff1;
[L744] 0 _Bool y$w_buff1_used;
[L746] 0 int z = 0;
[L747] 0 _Bool weak$$choice0;
[L748] 0 _Bool weak$$choice2;
[L859] 0 pthread_t t605;
[L860] FCALL, FORK 0 pthread_create(&t605, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t605={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]
[L861] 0 pthread_t t606;
[L862] FCALL, FORK 0 pthread_create(&t606, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, t605={5:0}, t606={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]
[L863] 0 pthread_t t607;
[L864] FCALL, FORK 0 pthread_create(&t607, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, t605={5:0}, t606={6:0}, t607={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]
[L865] 0 pthread_t t608;
[L866] FCALL, FORK 0 pthread_create(&t608, ((void *)0), P3, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, t605={5:0}, t606={6:0}, t607={7:0}, t608={3: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]
[L798] 3 y$w_buff1 = y$w_buff0
[L799] 3 y$w_buff0 = 1
[L800] 3 y$w_buff1_used = y$w_buff0_used
[L801] 3 y$w_buff0_used = (_Bool)1
[L802] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L18] COND FALSE 3 !(!expression)
[L802] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L803] 3 y$r_buff1_thd0 = y$r_buff0_thd0
[L804] 3 y$r_buff1_thd1 = y$r_buff0_thd1
[L805] 3 y$r_buff1_thd2 = y$r_buff0_thd2
[L806] 3 y$r_buff1_thd3 = y$r_buff0_thd3
[L807] 3 y$r_buff1_thd4 = y$r_buff0_thd4
[L808] 3 y$r_buff0_thd3 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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]
[L811] 3 z = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1]
[L828] 4 z = 2
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=2]
[L831] 4 __unbuffered_p3_EAX = z
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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=2]
[L834] 4 __unbuffered_p3_EBX = a
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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=2]
[L752] 1 a = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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=2]
[L755] 1 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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=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=2]
[L767] 2 x = 2
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2]
[L770] 2 __unbuffered_p1_EAX = x
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2]
[L773] 2 weak$$choice0 = __VERIFIER_nondet_bool()
[L774] 2 weak$$choice2 = __VERIFIER_nondet_bool()
[L775] 2 y$flush_delayed = weak$$choice2
[L776] 2 y$mem_tmp = y
[L777] 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)
[L778] 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))
[L779] 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))
[L780] 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))
[L781] 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))
[L782] 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))
[L783] 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))
[L784] 2 __unbuffered_p1_EBX = y
[L785] 2 y = y$flush_delayed ? y$mem_tmp : y
[L786] 2 y$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2]
[L814] 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)
[L815] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L816] 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
[L817] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L818] 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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2]
[L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1
[L823] 3 return 0;
[L837] 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)
[L838] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used
[L839] 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
[L840] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4
[L841] 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 [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2]
[L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L762] 1 return 0;
[L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1
[L846] 4 return 0;
[L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L793] 2 return 0;
[L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4
[L870] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L870] RET 0 assume_abort_if_not(main$tmp_guard0)
[L872] 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)
[L873] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L874] 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
[L875] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L876] 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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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, t605={5:0}, t606={6:0}, t607={7:0}, t608={3:0}, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2]
[L879] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0)
[L881] 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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2]
- UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: Not analyzed.
- UnprovableResult [Line: 860]: 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: 866]: 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: 862]: 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: 864]: 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, 173 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: 33.0s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 22.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 771 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 605 mSDsluCounter, 261 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 157 mSDsCounter, 122 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1565 IncrementalHoareTripleChecker+Invalid, 1687 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 122 mSolverCounterUnsat, 104 mSDtfsCounter, 1565 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=876occurred in iteration=10, InterpolantAutomatonStates: 68, 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.5s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 1872 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:46:51,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697728d-4b23-42f8-ac00-9aadfe595b32/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