./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix037_tso.oepc.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_3a26e14d-3b1e-467d-a268-1343bb51d6b3/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a26e14d-3b1e-467d-a268-1343bb51d6b3/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_3a26e14d-3b1e-467d-a268-1343bb51d6b3/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a26e14d-3b1e-467d-a268-1343bb51d6b3/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix037_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a26e14d-3b1e-467d-a268-1343bb51d6b3/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_3a26e14d-3b1e-467d-a268-1343bb51d6b3/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 526eb61a43a151355b0c30c3cdf9498dba5b0f807210313241440694b1deb106 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:47:51,474 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:47:51,612 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a26e14d-3b1e-467d-a268-1343bb51d6b3/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:47:51,620 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:47:51,621 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:47:51,679 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:47:51,680 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:47:51,681 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:47:51,681 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:47:51,682 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:47:51,683 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:47:51,684 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:47:51,684 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:47:51,685 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:47:51,686 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:47:51,686 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:47:51,687 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:47:51,688 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:47:51,688 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:47:51,689 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:47:51,690 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:47:51,690 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:47:51,691 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:47:51,692 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:47:51,692 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:47:51,693 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:47:51,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:47:51,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:47:51,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:47:51,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:47:51,696 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:47:51,697 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:47:51,698 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:47:51,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:47:51,699 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:47:51,700 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:47:51,700 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:47:51,701 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:47:51,702 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:47:51,702 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_3a26e14d-3b1e-467d-a268-1343bb51d6b3/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_3a26e14d-3b1e-467d-a268-1343bb51d6b3/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 -> 526eb61a43a151355b0c30c3cdf9498dba5b0f807210313241440694b1deb106 [2023-11-19 07:47:51,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:47:52,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:47:52,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:47:52,020 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:47:52,020 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:47:52,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a26e14d-3b1e-467d-a268-1343bb51d6b3/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix037_tso.oepc.i [2023-11-19 07:47:55,107 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:47:55,532 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:47:55,536 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a26e14d-3b1e-467d-a268-1343bb51d6b3/sv-benchmarks/c/pthread-wmm/mix037_tso.oepc.i [2023-11-19 07:47:55,567 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a26e14d-3b1e-467d-a268-1343bb51d6b3/bin/uautomizer-verify-uCwYo4JHxu/data/06553a85c/47a6a637ab0d420a87c8102a7354aedc/FLAGb38b0e23f [2023-11-19 07:47:55,588 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a26e14d-3b1e-467d-a268-1343bb51d6b3/bin/uautomizer-verify-uCwYo4JHxu/data/06553a85c/47a6a637ab0d420a87c8102a7354aedc [2023-11-19 07:47:55,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:47:55,596 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:47:55,600 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:47:55,601 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:47:55,607 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:47:55,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:47:55" (1/1) ... [2023-11-19 07:47:55,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@249d0ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:55, skipping insertion in model container [2023-11-19 07:47:55,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:47:55" (1/1) ... [2023-11-19 07:47:55,679 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:47:55,852 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_3a26e14d-3b1e-467d-a268-1343bb51d6b3/sv-benchmarks/c/pthread-wmm/mix037_tso.oepc.i[949,962] [2023-11-19 07:47:56,181 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:47:56,194 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:47:56,223 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_3a26e14d-3b1e-467d-a268-1343bb51d6b3/sv-benchmarks/c/pthread-wmm/mix037_tso.oepc.i[949,962] [2023-11-19 07:47:56,297 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:47:56,335 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:47:56,336 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:47:56,344 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:47:56,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:56 WrapperNode [2023-11-19 07:47:56,345 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:47:56,347 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:47:56,347 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:47:56,347 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:47:56,356 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:47:56" (1/1) ... [2023-11-19 07:47:56,399 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:47:56" (1/1) ... [2023-11-19 07:47:56,458 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 162 [2023-11-19 07:47:56,464 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:47:56,466 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:47:56,466 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:47:56,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:47:56,477 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:56" (1/1) ... [2023-11-19 07:47:56,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:56" (1/1) ... [2023-11-19 07:47:56,492 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:56" (1/1) ... [2023-11-19 07:47:56,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:56" (1/1) ... [2023-11-19 07:47:56,507 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:56" (1/1) ... [2023-11-19 07:47:56,523 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:56" (1/1) ... [2023-11-19 07:47:56,526 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:56" (1/1) ... [2023-11-19 07:47:56,528 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:56" (1/1) ... [2023-11-19 07:47:56,533 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:47:56,534 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:47:56,534 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:47:56,534 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:47:56,537 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:56" (1/1) ... [2023-11-19 07:47:56,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:47:56,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a26e14d-3b1e-467d-a268-1343bb51d6b3/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:47:56,579 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a26e14d-3b1e-467d-a268-1343bb51d6b3/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:47:56,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a26e14d-3b1e-467d-a268-1343bb51d6b3/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:47:56,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:47:56,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:47:56,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:47:56,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:47:56,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:47:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:47:56,626 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:47:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:47:56,626 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:47:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 07:47:56,628 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 07:47:56,628 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-19 07:47:56,629 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-19 07:47:56,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:47:56,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:47:56,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:47:56,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:47:56,631 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:47:56,852 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:47:56,855 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:47:57,358 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:47:57,520 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:47:57,520 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:47:57,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:47:57 BoogieIcfgContainer [2023-11-19 07:47:57,525 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:47:57,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:47:57,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:47:57,532 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:47:57,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:47:55" (1/3) ... [2023-11-19 07:47:57,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a5b028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:47:57, skipping insertion in model container [2023-11-19 07:47:57,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:56" (2/3) ... [2023-11-19 07:47:57,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a5b028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:47:57, skipping insertion in model container [2023-11-19 07:47:57,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:47:57" (3/3) ... [2023-11-19 07:47:57,536 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037_tso.oepc.i [2023-11-19 07:47:57,547 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 07:47:57,559 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:47:57,559 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 07:47:57,559 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:47:57,647 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:47:57,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 137 transitions, 290 flow [2023-11-19 07:47:57,770 INFO L124 PetriNetUnfolderBase]: 3/133 cut-off events. [2023-11-19 07:47:57,773 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:47:57,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 3/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-11-19 07:47:57,781 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 137 transitions, 290 flow [2023-11-19 07:47:57,787 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 133 transitions, 278 flow [2023-11-19 07:47:57,791 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:47:57,809 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 133 transitions, 278 flow [2023-11-19 07:47:57,812 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 133 transitions, 278 flow [2023-11-19 07:47:57,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 133 transitions, 278 flow [2023-11-19 07:47:57,898 INFO L124 PetriNetUnfolderBase]: 3/133 cut-off events. [2023-11-19 07:47:57,898 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:47:57,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 3/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-11-19 07:47:57,904 INFO L119 LiptonReduction]: Number of co-enabled transitions 3648 [2023-11-19 07:48:03,769 INFO L134 LiptonReduction]: Checked pairs total: 9753 [2023-11-19 07:48:03,769 INFO L136 LiptonReduction]: Total number of compositions: 113 [2023-11-19 07:48:03,797 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:48:03,805 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;@564f19ea, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:48:03,805 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-19 07:48:03,812 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:48:03,813 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-11-19 07:48:03,813 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:48:03,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:48:03,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 07:48:03,815 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:48:03,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:03,821 INFO L85 PathProgramCache]: Analyzing trace with hash 547119845, now seen corresponding path program 1 times [2023-11-19 07:48:03,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:03,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545569250] [2023-11-19 07:48:03,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:03,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:04,304 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:48:04,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:04,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545569250] [2023-11-19 07:48:04,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545569250] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:04,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:04,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:48:04,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585681207] [2023-11-19 07:48:04,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:04,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:48:04,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:04,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:48:04,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:48:04,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 250 [2023-11-19 07:48:04,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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:48:04,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:48:04,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 250 [2023-11-19 07:48:04,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:48:05,950 INFO L124 PetriNetUnfolderBase]: 5879/8521 cut-off events. [2023-11-19 07:48:05,951 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2023-11-19 07:48:05,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16665 conditions, 8521 events. 5879/8521 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 50448 event pairs, 1085 based on Foata normal form. 0/8176 useless extension candidates. Maximal degree in co-relation 16653. Up to 6355 conditions per place. [2023-11-19 07:48:06,037 INFO L140 encePairwiseOnDemand]: 246/250 looper letters, 41 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2023-11-19 07:48:06,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 206 flow [2023-11-19 07:48:06,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:48:06,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:48:06,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2023-11-19 07:48:06,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.544 [2023-11-19 07:48:06,056 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 408 transitions. [2023-11-19 07:48:06,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions. [2023-11-19 07:48:06,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:48:06,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions. [2023-11-19 07:48:06,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 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:48:06,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 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:48:06,075 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 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:48:06,077 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 408 transitions. [2023-11-19 07:48:06,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 206 flow [2023-11-19 07:48:06,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 200 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-19 07:48:06,084 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 70 flow [2023-11-19 07:48:06,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2023-11-19 07:48:06,094 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-11-19 07:48:06,094 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 70 flow [2023-11-19 07:48:06,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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:48:06,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:48:06,095 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:48:06,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:48:06,096 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:48:06,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:06,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1985366479, now seen corresponding path program 1 times [2023-11-19 07:48:06,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:06,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872036284] [2023-11-19 07:48:06,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:06,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:06,629 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:48:06,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:06,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872036284] [2023-11-19 07:48:06,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872036284] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:06,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:06,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:48:06,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757139415] [2023-11-19 07:48:06,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:06,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:48:06,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:06,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:48:06,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:48:06,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 250 [2023-11-19 07:48:06,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 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:48:06,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:48:06,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 250 [2023-11-19 07:48:06,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:48:08,034 INFO L124 PetriNetUnfolderBase]: 4855/6972 cut-off events. [2023-11-19 07:48:08,034 INFO L125 PetriNetUnfolderBase]: For 453/453 co-relation queries the response was YES. [2023-11-19 07:48:08,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14290 conditions, 6972 events. 4855/6972 cut-off events. For 453/453 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 37899 event pairs, 1527 based on Foata normal form. 320/7267 useless extension candidates. Maximal degree in co-relation 14280. Up to 3761 conditions per place. [2023-11-19 07:48:08,090 INFO L140 encePairwiseOnDemand]: 246/250 looper letters, 34 selfloop transitions, 2 changer transitions 23/63 dead transitions. [2023-11-19 07:48:08,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 63 transitions, 262 flow [2023-11-19 07:48:08,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:48:08,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:48:08,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 631 transitions. [2023-11-19 07:48:08,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5048 [2023-11-19 07:48:08,094 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 631 transitions. [2023-11-19 07:48:08,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 631 transitions. [2023-11-19 07:48:08,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:48:08,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 631 transitions. [2023-11-19 07:48:08,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 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:48:08,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 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:48:08,104 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 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:48:08,104 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 5 states and 631 transitions. [2023-11-19 07:48:08,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 63 transitions, 262 flow [2023-11-19 07:48:08,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 63 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:48:08,108 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 78 flow [2023-11-19 07:48:08,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2023-11-19 07:48:08,109 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2023-11-19 07:48:08,109 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 78 flow [2023-11-19 07:48:08,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 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:48:08,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:48:08,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:48:08,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:48:08,111 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:48:08,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:08,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1451747378, now seen corresponding path program 1 times [2023-11-19 07:48:08,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:08,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785877406] [2023-11-19 07:48:08,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:08,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:08,763 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:48:08,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:08,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785877406] [2023-11-19 07:48:08,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785877406] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:08,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:08,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:48:08,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638359415] [2023-11-19 07:48:08,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:08,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:48:08,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:08,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:48:08,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:48:08,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 250 [2023-11-19 07:48:08,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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:48:08,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:48:08,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 250 [2023-11-19 07:48:08,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:48:10,330 INFO L124 PetriNetUnfolderBase]: 5515/7758 cut-off events. [2023-11-19 07:48:10,330 INFO L125 PetriNetUnfolderBase]: For 1494/1494 co-relation queries the response was YES. [2023-11-19 07:48:10,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16727 conditions, 7758 events. 5515/7758 cut-off events. For 1494/1494 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 39685 event pairs, 2637 based on Foata normal form. 240/7980 useless extension candidates. Maximal degree in co-relation 16714. Up to 6487 conditions per place. [2023-11-19 07:48:10,403 INFO L140 encePairwiseOnDemand]: 245/250 looper letters, 41 selfloop transitions, 3 changer transitions 21/68 dead transitions. [2023-11-19 07:48:10,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 68 transitions, 297 flow [2023-11-19 07:48:10,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:48:10,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:48:10,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 642 transitions. [2023-11-19 07:48:10,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5136 [2023-11-19 07:48:10,408 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 642 transitions. [2023-11-19 07:48:10,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 642 transitions. [2023-11-19 07:48:10,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:48:10,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 642 transitions. [2023-11-19 07:48:10,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 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:48:10,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 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:48:10,418 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 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:48:10,418 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 78 flow. Second operand 5 states and 642 transitions. [2023-11-19 07:48:10,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 68 transitions, 297 flow [2023-11-19 07:48:10,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 68 transitions, 287 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-19 07:48:10,481 INFO L231 Difference]: Finished difference. Result has 46 places, 31 transitions, 97 flow [2023-11-19 07:48:10,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=97, PETRI_PLACES=46, PETRI_TRANSITIONS=31} [2023-11-19 07:48:10,483 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2023-11-19 07:48:10,483 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 97 flow [2023-11-19 07:48:10,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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:48:10,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:48:10,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:48:10,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:48:10,485 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:48:10,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:10,486 INFO L85 PathProgramCache]: Analyzing trace with hash 2008006148, now seen corresponding path program 1 times [2023-11-19 07:48:10,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:10,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428682599] [2023-11-19 07:48:10,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:10,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:11,322 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:48:11,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:11,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428682599] [2023-11-19 07:48:11,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428682599] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:11,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:11,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:48:11,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240894915] [2023-11-19 07:48:11,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:11,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:48:11,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:11,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:48:11,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:48:11,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 250 [2023-11-19 07:48:11,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 31 transitions, 97 flow. Second operand has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 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:48:11,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:48:11,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 250 [2023-11-19 07:48:11,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:48:12,862 INFO L124 PetriNetUnfolderBase]: 5670/8163 cut-off events. [2023-11-19 07:48:12,862 INFO L125 PetriNetUnfolderBase]: For 2837/2837 co-relation queries the response was YES. [2023-11-19 07:48:12,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19064 conditions, 8163 events. 5670/8163 cut-off events. For 2837/2837 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 45960 event pairs, 1163 based on Foata normal form. 200/8351 useless extension candidates. Maximal degree in co-relation 19050. Up to 6363 conditions per place. [2023-11-19 07:48:12,943 INFO L140 encePairwiseOnDemand]: 242/250 looper letters, 53 selfloop transitions, 7 changer transitions 20/83 dead transitions. [2023-11-19 07:48:12,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 83 transitions, 389 flow [2023-11-19 07:48:12,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:48:12,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:48:12,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 754 transitions. [2023-11-19 07:48:12,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5026666666666667 [2023-11-19 07:48:12,948 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 754 transitions. [2023-11-19 07:48:12,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 754 transitions. [2023-11-19 07:48:12,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:48:12,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 754 transitions. [2023-11-19 07:48:12,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 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:48:12,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 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:48:12,958 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 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:48:12,959 INFO L175 Difference]: Start difference. First operand has 46 places, 31 transitions, 97 flow. Second operand 6 states and 754 transitions. [2023-11-19 07:48:12,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 83 transitions, 389 flow [2023-11-19 07:48:12,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 83 transitions, 384 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-19 07:48:12,977 INFO L231 Difference]: Finished difference. Result has 50 places, 35 transitions, 145 flow [2023-11-19 07:48:12,978 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=145, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2023-11-19 07:48:12,980 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2023-11-19 07:48:12,980 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 35 transitions, 145 flow [2023-11-19 07:48:12,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 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:48:12,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:48:12,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:48:12,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:48:12,982 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:48:12,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:12,982 INFO L85 PathProgramCache]: Analyzing trace with hash -561055513, now seen corresponding path program 1 times [2023-11-19 07:48:12,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:12,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923210386] [2023-11-19 07:48:12,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:12,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:13,376 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:48:13,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:13,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923210386] [2023-11-19 07:48:13,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923210386] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:13,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:13,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:48:13,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13656675] [2023-11-19 07:48:13,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:13,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:48:13,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:13,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:48:13,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:48:13,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 250 [2023-11-19 07:48:13,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 35 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 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:48:13,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:48:13,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 250 [2023-11-19 07:48:13,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:48:14,919 INFO L124 PetriNetUnfolderBase]: 5692/8286 cut-off events. [2023-11-19 07:48:14,919 INFO L125 PetriNetUnfolderBase]: For 8877/8929 co-relation queries the response was YES. [2023-11-19 07:48:14,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23434 conditions, 8286 events. 5692/8286 cut-off events. For 8877/8929 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 47043 event pairs, 836 based on Foata normal form. 184/8443 useless extension candidates. Maximal degree in co-relation 23417. Up to 5974 conditions per place. [2023-11-19 07:48:14,997 INFO L140 encePairwiseOnDemand]: 241/250 looper letters, 58 selfloop transitions, 9 changer transitions 18/88 dead transitions. [2023-11-19 07:48:14,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 88 transitions, 495 flow [2023-11-19 07:48:14,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:48:14,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:48:15,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 766 transitions. [2023-11-19 07:48:15,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106666666666667 [2023-11-19 07:48:15,002 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 766 transitions. [2023-11-19 07:48:15,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 766 transitions. [2023-11-19 07:48:15,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:48:15,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 766 transitions. [2023-11-19 07:48:15,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.66666666666667) internal successors, (766), 6 states have internal predecessors, (766), 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:48:15,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 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:48:15,010 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 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:48:15,010 INFO L175 Difference]: Start difference. First operand has 50 places, 35 transitions, 145 flow. Second operand 6 states and 766 transitions. [2023-11-19 07:48:15,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 88 transitions, 495 flow [2023-11-19 07:48:15,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 88 transitions, 478 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-11-19 07:48:15,050 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 190 flow [2023-11-19 07:48:15,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2023-11-19 07:48:15,051 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2023-11-19 07:48:15,052 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 190 flow [2023-11-19 07:48:15,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 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:48:15,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:48:15,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:48:15,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:48:15,053 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:48:15,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:15,054 INFO L85 PathProgramCache]: Analyzing trace with hash -629324953, now seen corresponding path program 2 times [2023-11-19 07:48:15,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:15,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67220670] [2023-11-19 07:48:15,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:15,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:15,877 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:48:15,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:15,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67220670] [2023-11-19 07:48:15,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67220670] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:15,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:15,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:48:15,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737182018] [2023-11-19 07:48:15,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:15,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:48:15,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:15,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:48:15,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:48:15,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 250 [2023-11-19 07:48:15,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 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:48:15,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:48:15,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 250 [2023-11-19 07:48:15,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:48:17,376 INFO L124 PetriNetUnfolderBase]: 5494/7947 cut-off events. [2023-11-19 07:48:17,376 INFO L125 PetriNetUnfolderBase]: For 12447/12546 co-relation queries the response was YES. [2023-11-19 07:48:17,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24805 conditions, 7947 events. 5494/7947 cut-off events. For 12447/12546 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 44483 event pairs, 443 based on Foata normal form. 208/8143 useless extension candidates. Maximal degree in co-relation 24786. Up to 5902 conditions per place. [2023-11-19 07:48:17,460 INFO L140 encePairwiseOnDemand]: 245/250 looper letters, 63 selfloop transitions, 5 changer transitions 18/89 dead transitions. [2023-11-19 07:48:17,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 89 transitions, 548 flow [2023-11-19 07:48:17,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:48:17,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:48:17,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 763 transitions. [2023-11-19 07:48:17,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5086666666666667 [2023-11-19 07:48:17,465 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 763 transitions. [2023-11-19 07:48:17,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 763 transitions. [2023-11-19 07:48:17,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:48:17,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 763 transitions. [2023-11-19 07:48:17,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 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:48:17,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 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:48:17,475 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 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:48:17,476 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 190 flow. Second operand 6 states and 763 transitions. [2023-11-19 07:48:17,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 89 transitions, 548 flow [2023-11-19 07:48:17,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 89 transitions, 523 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-11-19 07:48:17,518 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 187 flow [2023-11-19 07:48:17,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2023-11-19 07:48:17,521 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 12 predicate places. [2023-11-19 07:48:17,521 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 187 flow [2023-11-19 07:48:17,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 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:48:17,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:48:17,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:48:17,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:48:17,523 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:48:17,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:17,524 INFO L85 PathProgramCache]: Analyzing trace with hash -212867369, now seen corresponding path program 1 times [2023-11-19 07:48:17,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:17,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175445844] [2023-11-19 07:48:17,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:17,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:18,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:48:18,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:18,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175445844] [2023-11-19 07:48:18,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175445844] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:18,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:18,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:48:18,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064922913] [2023-11-19 07:48:18,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:18,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:48:18,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:18,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:48:18,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:48:18,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 250 [2023-11-19 07:48:18,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 187 flow. Second operand has 7 states, 7 states have (on average 103.42857142857143) internal successors, (724), 7 states have internal predecessors, (724), 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:48:18,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:48:18,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 250 [2023-11-19 07:48:18,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:48:20,832 INFO L124 PetriNetUnfolderBase]: 12653/17094 cut-off events. [2023-11-19 07:48:20,832 INFO L125 PetriNetUnfolderBase]: For 23435/23435 co-relation queries the response was YES. [2023-11-19 07:48:20,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51903 conditions, 17094 events. 12653/17094 cut-off events. For 23435/23435 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 82445 event pairs, 4749 based on Foata normal form. 258/17352 useless extension candidates. Maximal degree in co-relation 51882. Up to 13769 conditions per place. [2023-11-19 07:48:20,972 INFO L140 encePairwiseOnDemand]: 236/250 looper letters, 69 selfloop transitions, 31 changer transitions 22/122 dead transitions. [2023-11-19 07:48:20,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 122 transitions, 740 flow [2023-11-19 07:48:20,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:48:20,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-19 07:48:20,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 919 transitions. [2023-11-19 07:48:20,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4595 [2023-11-19 07:48:20,978 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 919 transitions. [2023-11-19 07:48:20,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 919 transitions. [2023-11-19 07:48:20,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:48:20,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 919 transitions. [2023-11-19 07:48:20,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 114.875) internal successors, (919), 8 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:48:20,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 250.0) internal successors, (2250), 9 states have internal predecessors, (2250), 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:48:20,988 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 250.0) internal successors, (2250), 9 states have internal predecessors, (2250), 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:48:20,988 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 187 flow. Second operand 8 states and 919 transitions. [2023-11-19 07:48:20,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 122 transitions, 740 flow [2023-11-19 07:48:21,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 122 transitions, 713 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-11-19 07:48:21,248 INFO L231 Difference]: Finished difference. Result has 61 places, 63 transitions, 425 flow [2023-11-19 07:48:21,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=425, PETRI_PLACES=61, PETRI_TRANSITIONS=63} [2023-11-19 07:48:21,249 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 17 predicate places. [2023-11-19 07:48:21,250 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 425 flow [2023-11-19 07:48:21,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 103.42857142857143) internal successors, (724), 7 states have internal predecessors, (724), 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:48:21,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:48:21,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:48:21,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:48:21,251 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:48:21,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:21,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1935302807, now seen corresponding path program 2 times [2023-11-19 07:48:21,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:21,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106765021] [2023-11-19 07:48:21,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:21,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:22,005 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:48:22,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:22,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106765021] [2023-11-19 07:48:22,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106765021] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:22,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:22,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:48:22,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823893854] [2023-11-19 07:48:22,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:22,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:48:22,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:22,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:48:22,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:48:22,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 250 [2023-11-19 07:48:22,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 63 transitions, 425 flow. Second operand has 7 states, 7 states have (on average 113.42857142857143) internal successors, (794), 7 states have internal predecessors, (794), 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:48:22,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:48:22,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 250 [2023-11-19 07:48:22,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:48:24,369 INFO L124 PetriNetUnfolderBase]: 10548/14945 cut-off events. [2023-11-19 07:48:24,370 INFO L125 PetriNetUnfolderBase]: For 48195/50016 co-relation queries the response was YES. [2023-11-19 07:48:24,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58968 conditions, 14945 events. 10548/14945 cut-off events. For 48195/50016 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 83911 event pairs, 2879 based on Foata normal form. 453/15051 useless extension candidates. Maximal degree in co-relation 58945. Up to 10841 conditions per place. [2023-11-19 07:48:24,545 INFO L140 encePairwiseOnDemand]: 240/250 looper letters, 90 selfloop transitions, 29 changer transitions 7/134 dead transitions. [2023-11-19 07:48:24,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 134 transitions, 1041 flow [2023-11-19 07:48:24,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:48:24,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:48:24,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 871 transitions. [2023-11-19 07:48:24,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4977142857142857 [2023-11-19 07:48:24,551 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 871 transitions. [2023-11-19 07:48:24,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 871 transitions. [2023-11-19 07:48:24,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:48:24,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 871 transitions. [2023-11-19 07:48:24,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.42857142857143) internal successors, (871), 7 states have internal predecessors, (871), 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:48:24,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 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:48:24,562 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 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:48:24,562 INFO L175 Difference]: Start difference. First operand has 61 places, 63 transitions, 425 flow. Second operand 7 states and 871 transitions. [2023-11-19 07:48:24,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 134 transitions, 1041 flow [2023-11-19 07:48:24,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 134 transitions, 1006 flow, removed 17 selfloop flow, removed 2 redundant places. [2023-11-19 07:48:24,719 INFO L231 Difference]: Finished difference. Result has 66 places, 77 transitions, 639 flow [2023-11-19 07:48:24,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=639, PETRI_PLACES=66, PETRI_TRANSITIONS=77} [2023-11-19 07:48:24,723 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 22 predicate places. [2023-11-19 07:48:24,724 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 77 transitions, 639 flow [2023-11-19 07:48:24,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.42857142857143) internal successors, (794), 7 states have internal predecessors, (794), 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:48:24,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:48:24,725 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:48:24,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:48:24,725 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:48:24,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:24,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1965747287, now seen corresponding path program 3 times [2023-11-19 07:48:24,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:24,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989965887] [2023-11-19 07:48:24,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:24,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:25,262 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:48:25,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:25,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989965887] [2023-11-19 07:48:25,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989965887] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:25,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:25,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:48:25,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112917014] [2023-11-19 07:48:25,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:25,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:48:25,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:25,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:48:25,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:48:25,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 250 [2023-11-19 07:48:25,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 77 transitions, 639 flow. Second operand has 7 states, 7 states have (on average 114.42857142857143) internal successors, (801), 7 states have internal predecessors, (801), 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:48:25,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:48:25,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 250 [2023-11-19 07:48:25,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:48:27,837 INFO L124 PetriNetUnfolderBase]: 11207/16141 cut-off events. [2023-11-19 07:48:27,837 INFO L125 PetriNetUnfolderBase]: For 79642/81579 co-relation queries the response was YES. [2023-11-19 07:48:27,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71353 conditions, 16141 events. 11207/16141 cut-off events. For 79642/81579 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 94334 event pairs, 3201 based on Foata normal form. 476/16265 useless extension candidates. Maximal degree in co-relation 71327. Up to 11586 conditions per place. [2023-11-19 07:48:28,002 INFO L140 encePairwiseOnDemand]: 240/250 looper letters, 99 selfloop transitions, 29 changer transitions 6/142 dead transitions. [2023-11-19 07:48:28,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 142 transitions, 1292 flow [2023-11-19 07:48:28,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:48:28,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:48:28,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 758 transitions. [2023-11-19 07:48:28,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5053333333333333 [2023-11-19 07:48:28,013 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 758 transitions. [2023-11-19 07:48:28,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 758 transitions. [2023-11-19 07:48:28,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:48:28,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 758 transitions. [2023-11-19 07:48:28,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 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:48:28,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 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:48:28,029 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 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:48:28,029 INFO L175 Difference]: Start difference. First operand has 66 places, 77 transitions, 639 flow. Second operand 6 states and 758 transitions. [2023-11-19 07:48:28,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 142 transitions, 1292 flow [2023-11-19 07:48:28,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 142 transitions, 1208 flow, removed 31 selfloop flow, removed 2 redundant places. [2023-11-19 07:48:28,191 INFO L231 Difference]: Finished difference. Result has 72 places, 86 transitions, 776 flow [2023-11-19 07:48:28,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=776, PETRI_PLACES=72, PETRI_TRANSITIONS=86} [2023-11-19 07:48:28,192 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 28 predicate places. [2023-11-19 07:48:28,192 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 86 transitions, 776 flow [2023-11-19 07:48:28,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.42857142857143) internal successors, (801), 7 states have internal predecessors, (801), 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:48:28,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:48:28,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:48:28,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:48:28,194 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:48:28,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:28,195 INFO L85 PathProgramCache]: Analyzing trace with hash 218458261, now seen corresponding path program 4 times [2023-11-19 07:48:28,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:28,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091647385] [2023-11-19 07:48:28,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:28,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:28,861 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:48:28,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:28,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091647385] [2023-11-19 07:48:28,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091647385] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:28,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:28,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:48:28,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925686449] [2023-11-19 07:48:28,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:28,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:48:28,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:28,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:48:28,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:48:28,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 250 [2023-11-19 07:48:28,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 86 transitions, 776 flow. Second operand has 8 states, 8 states have (on average 105.125) internal successors, (841), 8 states have internal predecessors, (841), 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:48:28,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:48:28,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 250 [2023-11-19 07:48:28,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:48:32,768 INFO L124 PetriNetUnfolderBase]: 15915/21596 cut-off events. [2023-11-19 07:48:32,769 INFO L125 PetriNetUnfolderBase]: For 118344/118344 co-relation queries the response was YES. [2023-11-19 07:48:32,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102026 conditions, 21596 events. 15915/21596 cut-off events. For 118344/118344 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 110642 event pairs, 3286 based on Foata normal form. 388/21984 useless extension candidates. Maximal degree in co-relation 101996. Up to 12811 conditions per place. [2023-11-19 07:48:32,939 INFO L140 encePairwiseOnDemand]: 238/250 looper letters, 116 selfloop transitions, 48 changer transitions 30/194 dead transitions. [2023-11-19 07:48:32,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 194 transitions, 1834 flow [2023-11-19 07:48:32,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:48:32,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-19 07:48:32,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1168 transitions. [2023-11-19 07:48:32,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4672 [2023-11-19 07:48:32,946 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1168 transitions. [2023-11-19 07:48:32,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1168 transitions. [2023-11-19 07:48:32,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:48:32,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1168 transitions. [2023-11-19 07:48:32,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 116.8) internal successors, (1168), 10 states have internal predecessors, (1168), 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:48:32,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 250.0) internal successors, (2750), 11 states have internal predecessors, (2750), 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:48:32,957 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 250.0) internal successors, (2750), 11 states have internal predecessors, (2750), 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:48:32,958 INFO L175 Difference]: Start difference. First operand has 72 places, 86 transitions, 776 flow. Second operand 10 states and 1168 transitions. [2023-11-19 07:48:32,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 194 transitions, 1834 flow [2023-11-19 07:48:33,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 194 transitions, 1748 flow, removed 33 selfloop flow, removed 2 redundant places. [2023-11-19 07:48:33,168 INFO L231 Difference]: Finished difference. Result has 84 places, 95 transitions, 969 flow [2023-11-19 07:48:33,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=969, PETRI_PLACES=84, PETRI_TRANSITIONS=95} [2023-11-19 07:48:33,169 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 40 predicate places. [2023-11-19 07:48:33,169 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 95 transitions, 969 flow [2023-11-19 07:48:33,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 105.125) internal successors, (841), 8 states have internal predecessors, (841), 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:48:33,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:48:33,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:48:33,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:48:33,171 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:48:33,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:33,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1803962349, now seen corresponding path program 1 times [2023-11-19 07:48:33,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:33,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104828504] [2023-11-19 07:48:33,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:33,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:33,406 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:48:33,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:33,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104828504] [2023-11-19 07:48:33,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104828504] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:33,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:33,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:48:33,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136747311] [2023-11-19 07:48:33,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:33,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:48:33,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:33,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:48:33,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:48:33,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 250 [2023-11-19 07:48:33,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 95 transitions, 969 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 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:48:33,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:48:33,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 250 [2023-11-19 07:48:33,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:48:34,684 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([423] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][147], [Black: 253#(and (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff0_thd0~0 256)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1)), Black: 251#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 30#L841true, Black: 254#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 262#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 192#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 290#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 105#L808true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 214#(= 0 ~x$r_buff0_thd0~0), P2Thread1of1ForFork0InUse, Black: 203#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 278#(and (= ~x$w_buff1_used~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), 67#L758true, Black: 268#(and (= ~x$w_buff1_used~0 0) (= ~x$w_buff0_used~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= 0 ~x$r_buff0_thd0~0)), Black: 276#(and (= ~x$w_buff1_used~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 272#(and (= ~x$w_buff1_used~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= 0 ~x$r_buff0_thd0~0)), Black: 263#(and (= ~x$w_buff1_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 23#L788true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), 235#true, 59#L869true, Black: 220#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))), Black: 224#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))), Black: 222#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))), Black: 166#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 243#(and (= 0 ~x$w_buff1~0) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (<= 1 ~x$w_buff0_used~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 239#(and (= 0 ~x$w_buff1~0) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (<= 1 ~x$w_buff0_used~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= 0 (div ~x$r_buff0_thd0~0 256)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), Black: 184#(and (= ~x~0 0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= 0 (div ~x$r_buff0_thd0~0 256)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)))]) [2023-11-19 07:48:34,684 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-19 07:48:34,684 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-19 07:48:34,684 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-19 07:48:34,684 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-19 07:48:36,010 INFO L124 PetriNetUnfolderBase]: 8506/12229 cut-off events. [2023-11-19 07:48:36,011 INFO L125 PetriNetUnfolderBase]: For 158033/161407 co-relation queries the response was YES. [2023-11-19 07:48:36,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70061 conditions, 12229 events. 8506/12229 cut-off events. For 158033/161407 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 70835 event pairs, 1495 based on Foata normal form. 1989/13813 useless extension candidates. Maximal degree in co-relation 70026. Up to 7268 conditions per place. [2023-11-19 07:48:36,170 INFO L140 encePairwiseOnDemand]: 243/250 looper letters, 185 selfloop transitions, 10 changer transitions 0/209 dead transitions. [2023-11-19 07:48:36,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 209 transitions, 2582 flow [2023-11-19 07:48:36,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:48:36,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:48:36,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 643 transitions. [2023-11-19 07:48:36,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5144 [2023-11-19 07:48:36,174 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 643 transitions. [2023-11-19 07:48:36,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 643 transitions. [2023-11-19 07:48:36,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:48:36,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 643 transitions. [2023-11-19 07:48:36,178 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:48:36,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 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:48:36,182 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 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:48:36,182 INFO L175 Difference]: Start difference. First operand has 84 places, 95 transitions, 969 flow. Second operand 5 states and 643 transitions. [2023-11-19 07:48:36,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 209 transitions, 2582 flow [2023-11-19 07:48:36,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 209 transitions, 2395 flow, removed 70 selfloop flow, removed 8 redundant places. [2023-11-19 07:48:36,346 INFO L231 Difference]: Finished difference. Result has 78 places, 94 transitions, 876 flow [2023-11-19 07:48:36,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=876, PETRI_PLACES=78, PETRI_TRANSITIONS=94} [2023-11-19 07:48:36,348 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 34 predicate places. [2023-11-19 07:48:36,348 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 94 transitions, 876 flow [2023-11-19 07:48:36,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 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:48:36,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:48:36,349 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:48:36,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:48:36,349 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:48:36,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:36,350 INFO L85 PathProgramCache]: Analyzing trace with hash -845528819, now seen corresponding path program 1 times [2023-11-19 07:48:36,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:36,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445701688] [2023-11-19 07:48:36,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:36,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:36,569 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:48:36,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:36,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445701688] [2023-11-19 07:48:36,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445701688] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:36,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:36,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:48:36,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254557625] [2023-11-19 07:48:36,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:36,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:48:36,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:36,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:48:36,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:48:36,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 250 [2023-11-19 07:48:36,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 94 transitions, 876 flow. Second operand has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 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:48:36,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:48:36,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 250 [2023-11-19 07:48:36,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:48:37,953 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([423] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][151], [Black: 253#(and (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff0_thd0~0 256)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1)), Black: 251#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 30#L841true, 262#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 192#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 290#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 105#L808true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 214#(= 0 ~x$r_buff0_thd0~0), P2Thread1of1ForFork0InUse, Black: 203#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, 67#L758true, Black: 276#(and (= ~x$w_buff1_used~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 263#(and (= ~x$w_buff1_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 23#L788true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), 235#true, Black: 288#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 59#L869true, Black: 287#(= ~__unbuffered_cnt~0 0), Black: 220#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))), Black: 224#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))), Black: 222#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))), Black: 166#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 243#(and (= 0 ~x$w_buff1~0) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (<= 1 ~x$w_buff0_used~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 239#(and (= 0 ~x$w_buff1~0) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (<= 1 ~x$w_buff0_used~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 301#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= 0 (div ~x$r_buff0_thd0~0 256)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), Black: 184#(and (= ~x~0 0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= 0 (div ~x$r_buff0_thd0~0 256)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)))]) [2023-11-19 07:48:37,953 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-19 07:48:37,953 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-19 07:48:37,953 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-19 07:48:37,954 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-19 07:48:38,756 INFO L124 PetriNetUnfolderBase]: 6338/9320 cut-off events. [2023-11-19 07:48:38,756 INFO L125 PetriNetUnfolderBase]: For 90750/93086 co-relation queries the response was YES. [2023-11-19 07:48:38,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51742 conditions, 9320 events. 6338/9320 cut-off events. For 90750/93086 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 54921 event pairs, 621 based on Foata normal form. 1598/10642 useless extension candidates. Maximal degree in co-relation 51709. Up to 3140 conditions per place. [2023-11-19 07:48:38,847 INFO L140 encePairwiseOnDemand]: 243/250 looper letters, 224 selfloop transitions, 19 changer transitions 7/264 dead transitions. [2023-11-19 07:48:38,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 264 transitions, 3162 flow [2023-11-19 07:48:38,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:48:38,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:48:38,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 902 transitions. [2023-11-19 07:48:38,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5154285714285715 [2023-11-19 07:48:38,855 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 902 transitions. [2023-11-19 07:48:38,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 902 transitions. [2023-11-19 07:48:38,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:48:38,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 902 transitions. [2023-11-19 07:48:38,859 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:48:38,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 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:48:38,865 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 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:48:38,866 INFO L175 Difference]: Start difference. First operand has 78 places, 94 transitions, 876 flow. Second operand 7 states and 902 transitions. [2023-11-19 07:48:38,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 264 transitions, 3162 flow [2023-11-19 07:48:38,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 264 transitions, 3157 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:48:38,986 INFO L231 Difference]: Finished difference. Result has 86 places, 97 transitions, 961 flow [2023-11-19 07:48:38,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=961, PETRI_PLACES=86, PETRI_TRANSITIONS=97} [2023-11-19 07:48:38,987 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 42 predicate places. [2023-11-19 07:48:38,987 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 97 transitions, 961 flow [2023-11-19 07:48:38,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 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:48:38,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:48:38,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:48:38,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:48:38,988 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:48:38,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:38,989 INFO L85 PathProgramCache]: Analyzing trace with hash 27031972, now seen corresponding path program 1 times [2023-11-19 07:48:38,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:38,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041357547] [2023-11-19 07:48:38,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:38,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:39,255 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:48:39,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:39,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041357547] [2023-11-19 07:48:39,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041357547] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:39,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:39,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:48:39,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809508293] [2023-11-19 07:48:39,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:39,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:48:39,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:39,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:48:39,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:48:39,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 250 [2023-11-19 07:48:39,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 97 transitions, 961 flow. Second operand has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 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:48:39,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:48:39,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 250 [2023-11-19 07:48:39,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand