./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 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_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl --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 2aa715856437bb3403b6a2717a4123b124cdc9b291b63ee677b7c1993b3be7b6 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:33:51,286 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:33:51,362 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:33:51,368 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:33:51,369 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:33:51,395 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:33:51,396 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:33:51,396 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:33:51,397 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:33:51,398 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:33:51,399 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:33:51,399 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:33:51,400 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:33:51,401 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:33:51,401 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:33:51,402 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:33:51,403 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:33:51,403 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:33:51,404 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:33:51,404 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:33:51,405 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:33:51,408 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:33:51,416 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:33:51,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:33:51,421 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:33:51,422 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:33:51,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:33:51,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:33:51,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:33:51,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:33:51,424 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:33:51,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:33:51,426 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:33:51,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:33:51,426 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:33:51,427 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:33:51,427 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:33:51,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:33:51,427 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:33:51,427 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_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/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_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl 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 -> 2aa715856437bb3403b6a2717a4123b124cdc9b291b63ee677b7c1993b3be7b6 [2023-11-12 02:33:51,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:33:51,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:33:51,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:33:51,759 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:33:51,760 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:33:51,761 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c [2023-11-12 02:33:54,908 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:33:55,109 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:33:55,110 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c [2023-11-12 02:33:55,120 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/data/938b37f1b/e8da17133bf6424a8102344359a6d13a/FLAGd517f9a34 [2023-11-12 02:33:55,136 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/data/938b37f1b/e8da17133bf6424a8102344359a6d13a [2023-11-12 02:33:55,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:33:55,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:33:55,143 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:33:55,143 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:33:55,154 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:33:55,155 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:33:55" (1/1) ... [2023-11-12 02:33:55,156 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@739a33ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:55, skipping insertion in model container [2023-11-12 02:33:55,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:33:55" (1/1) ... [2023-11-12 02:33:55,180 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:33:55,395 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_ad07a158-399b-44f5-8f46-9fb11cda8795/sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c[2630,2643] [2023-11-12 02:33:55,401 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:33:55,411 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:33:55,441 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_ad07a158-399b-44f5-8f46-9fb11cda8795/sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c[2630,2643] [2023-11-12 02:33:55,443 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:33:55,451 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:33:55,452 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:33:55,460 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:33:55,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:55 WrapperNode [2023-11-12 02:33:55,460 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:33:55,462 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:33:55,462 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:33:55,462 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:33:55,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:55" (1/1) ... [2023-11-12 02:33:55,479 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:55" (1/1) ... [2023-11-12 02:33:55,501 INFO L138 Inliner]: procedures = 22, calls = 39, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2023-11-12 02:33:55,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:33:55,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:33:55,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:33:55,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:33:55,513 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:55" (1/1) ... [2023-11-12 02:33:55,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:55" (1/1) ... [2023-11-12 02:33:55,516 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:55" (1/1) ... [2023-11-12 02:33:55,516 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:55" (1/1) ... [2023-11-12 02:33:55,523 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:55" (1/1) ... [2023-11-12 02:33:55,538 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:55" (1/1) ... [2023-11-12 02:33:55,540 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:55" (1/1) ... [2023-11-12 02:33:55,541 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:55" (1/1) ... [2023-11-12 02:33:55,544 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:33:55,545 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:33:55,545 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:33:55,546 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:33:55,557 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:55" (1/1) ... [2023-11-12 02:33:55,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:33:55,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:33:55,593 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:33:55,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:33:55,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:33:55,638 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-12 02:33:55,638 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-12 02:33:55,638 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-12 02:33:55,638 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-12 02:33:55,639 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-12 02:33:55,639 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-12 02:33:55,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:33:55,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:33:55,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:33:55,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 02:33:55,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 02:33:55,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:33:55,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:33:55,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:33:55,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:33:55,644 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 02:33:55,805 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:33:55,810 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:33:56,079 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:33:56,171 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:33:56,171 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-12 02:33:56,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:33:56 BoogieIcfgContainer [2023-11-12 02:33:56,174 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:33:56,177 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:33:56,177 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:33:56,180 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:33:56,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:33:55" (1/3) ... [2023-11-12 02:33:56,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62363522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:33:56, skipping insertion in model container [2023-11-12 02:33:56,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:55" (2/3) ... [2023-11-12 02:33:56,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62363522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:33:56, skipping insertion in model container [2023-11-12 02:33:56,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:33:56" (3/3) ... [2023-11-12 02:33:56,183 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-equiv.wvr.c [2023-11-12 02:33:56,192 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-12 02:33:56,202 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:33:56,202 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:33:56,202 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 02:33:56,277 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-12 02:33:56,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 98 transitions, 217 flow [2023-11-12 02:33:56,375 INFO L124 PetriNetUnfolderBase]: 7/95 cut-off events. [2023-11-12 02:33:56,375 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-12 02:33:56,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 95 events. 7/95 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2023-11-12 02:33:56,381 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 98 transitions, 217 flow [2023-11-12 02:33:56,387 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 84 transitions, 186 flow [2023-11-12 02:33:56,398 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:33:56,411 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 84 transitions, 186 flow [2023-11-12 02:33:56,414 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 84 transitions, 186 flow [2023-11-12 02:33:56,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 84 transitions, 186 flow [2023-11-12 02:33:56,449 INFO L124 PetriNetUnfolderBase]: 7/84 cut-off events. [2023-11-12 02:33:56,449 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-12 02:33:56,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 84 events. 7/84 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2023-11-12 02:33:56,452 INFO L119 LiptonReduction]: Number of co-enabled transitions 1026 [2023-11-12 02:33:59,604 INFO L134 LiptonReduction]: Checked pairs total: 1376 [2023-11-12 02:33:59,604 INFO L136 LiptonReduction]: Total number of compositions: 65 [2023-11-12 02:33:59,621 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:33:59,629 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;@5ecfa00, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:33:59,629 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-12 02:33:59,639 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-12 02:33:59,639 INFO L124 PetriNetUnfolderBase]: 3/23 cut-off events. [2023-11-12 02:33:59,639 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-12 02:33:59,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:33:59,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:33:59,641 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-12 02:33:59,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:33:59,647 INFO L85 PathProgramCache]: Analyzing trace with hash 2009630662, now seen corresponding path program 1 times [2023-11-12 02:33:59,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:33:59,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004432681] [2023-11-12 02:33:59,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:33:59,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:33:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:00,447 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-12 02:34:00,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:34:00,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004432681] [2023-11-12 02:34:00,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004432681] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:34:00,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:34:00,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:34:00,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436650350] [2023-11-12 02:34:00,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:34:00,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:34:00,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:34:00,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:34:00,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:34:00,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 163 [2023-11-12 02:34:00,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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-12 02:34:00,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:34:00,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 163 [2023-11-12 02:34:00,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:34:00,781 INFO L124 PetriNetUnfolderBase]: 509/755 cut-off events. [2023-11-12 02:34:00,781 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2023-11-12 02:34:00,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1535 conditions, 755 events. 509/755 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2786 event pairs, 95 based on Foata normal form. 1/522 useless extension candidates. Maximal degree in co-relation 1230. Up to 531 conditions per place. [2023-11-12 02:34:00,794 INFO L140 encePairwiseOnDemand]: 158/163 looper letters, 34 selfloop transitions, 4 changer transitions 1/42 dead transitions. [2023-11-12 02:34:00,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 42 transitions, 195 flow [2023-11-12 02:34:00,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:34:00,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:34:00,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2023-11-12 02:34:00,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5971370143149284 [2023-11-12 02:34:00,817 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 292 transitions. [2023-11-12 02:34:00,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 292 transitions. [2023-11-12 02:34:00,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:34:00,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 292 transitions. [2023-11-12 02:34:00,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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-12 02:34:00,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 0 states have call successors, (0), 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-12 02:34:00,838 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 0 states have call successors, (0), 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-12 02:34:00,841 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 66 flow. Second operand 3 states and 292 transitions. [2023-11-12 02:34:00,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 42 transitions, 195 flow [2023-11-12 02:34:00,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 42 transitions, 173 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-12 02:34:00,851 INFO L231 Difference]: Finished difference. Result has 28 places, 27 transitions, 80 flow [2023-11-12 02:34:00,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=28, PETRI_TRANSITIONS=27} [2023-11-12 02:34:00,858 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2023-11-12 02:34:00,858 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 80 flow [2023-11-12 02:34:00,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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-12 02:34:00,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:34:00,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:34:00,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:34:00,860 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-12 02:34:00,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:34:00,861 INFO L85 PathProgramCache]: Analyzing trace with hash 743227768, now seen corresponding path program 1 times [2023-11-12 02:34:00,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:34:00,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203705961] [2023-11-12 02:34:00,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:34:00,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:34:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:01,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:34:01,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:34:01,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203705961] [2023-11-12 02:34:01,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203705961] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:34:01,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:34:01,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:34:01,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240514821] [2023-11-12 02:34:01,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:34:01,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:34:01,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:34:01,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:34:01,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:34:01,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 163 [2023-11-12 02:34:01,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 80 flow. Second operand has 6 states, 6 states have (on average 78.16666666666667) internal successors, (469), 6 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:34:01,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:34:01,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 163 [2023-11-12 02:34:01,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:34:01,959 INFO L124 PetriNetUnfolderBase]: 626/940 cut-off events. [2023-11-12 02:34:01,960 INFO L125 PetriNetUnfolderBase]: For 206/211 co-relation queries the response was YES. [2023-11-12 02:34:01,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2204 conditions, 940 events. 626/940 cut-off events. For 206/211 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3780 event pairs, 69 based on Foata normal form. 45/979 useless extension candidates. Maximal degree in co-relation 445. Up to 359 conditions per place. [2023-11-12 02:34:01,969 INFO L140 encePairwiseOnDemand]: 156/163 looper letters, 72 selfloop transitions, 20 changer transitions 0/94 dead transitions. [2023-11-12 02:34:01,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 94 transitions, 451 flow [2023-11-12 02:34:01,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:34:01,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-12 02:34:01,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 684 transitions. [2023-11-12 02:34:01,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5245398773006135 [2023-11-12 02:34:01,976 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 684 transitions. [2023-11-12 02:34:01,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 684 transitions. [2023-11-12 02:34:01,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:34:01,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 684 transitions. [2023-11-12 02:34:01,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 85.5) internal successors, (684), 8 states have internal predecessors, (684), 0 states have call successors, (0), 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-12 02:34:01,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 163.0) internal successors, (1467), 9 states have internal predecessors, (1467), 0 states have call successors, (0), 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-12 02:34:01,985 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 163.0) internal successors, (1467), 9 states have internal predecessors, (1467), 0 states have call successors, (0), 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-12 02:34:01,985 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 80 flow. Second operand 8 states and 684 transitions. [2023-11-12 02:34:01,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 94 transitions, 451 flow [2023-11-12 02:34:01,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 94 transitions, 441 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-12 02:34:01,989 INFO L231 Difference]: Finished difference. Result has 39 places, 47 transitions, 233 flow [2023-11-12 02:34:01,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=233, PETRI_PLACES=39, PETRI_TRANSITIONS=47} [2023-11-12 02:34:01,991 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2023-11-12 02:34:01,991 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 47 transitions, 233 flow [2023-11-12 02:34:01,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.16666666666667) internal successors, (469), 6 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:34:01,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:34:01,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:34:01,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:34:01,992 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-12 02:34:01,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:34:01,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1091657930, now seen corresponding path program 2 times [2023-11-12 02:34:01,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:34:01,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244945059] [2023-11-12 02:34:01,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:34:01,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:34:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:02,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:34:02,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:34:02,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244945059] [2023-11-12 02:34:02,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244945059] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:34:02,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:34:02,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:34:02,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358747756] [2023-11-12 02:34:02,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:34:02,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:34:02,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:34:02,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:34:02,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:34:02,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 163 [2023-11-12 02:34:02,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 47 transitions, 233 flow. Second operand has 5 states, 5 states have (on average 79.8) internal successors, (399), 5 states have internal predecessors, (399), 0 states have call successors, (0), 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-12 02:34:02,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:34:02,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 163 [2023-11-12 02:34:02,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:34:02,653 INFO L124 PetriNetUnfolderBase]: 725/1105 cut-off events. [2023-11-12 02:34:02,653 INFO L125 PetriNetUnfolderBase]: For 1030/1064 co-relation queries the response was YES. [2023-11-12 02:34:02,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3364 conditions, 1105 events. 725/1105 cut-off events. For 1030/1064 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4550 event pairs, 137 based on Foata normal form. 32/1120 useless extension candidates. Maximal degree in co-relation 3013. Up to 649 conditions per place. [2023-11-12 02:34:02,668 INFO L140 encePairwiseOnDemand]: 156/163 looper letters, 68 selfloop transitions, 23 changer transitions 3/96 dead transitions. [2023-11-12 02:34:02,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 96 transitions, 613 flow [2023-11-12 02:34:02,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:34:02,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-12 02:34:02,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 528 transitions. [2023-11-12 02:34:02,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5398773006134969 [2023-11-12 02:34:02,673 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 528 transitions. [2023-11-12 02:34:02,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 528 transitions. [2023-11-12 02:34:02,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:34:02,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 528 transitions. [2023-11-12 02:34:02,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 88.0) internal successors, (528), 6 states have internal predecessors, (528), 0 states have call successors, (0), 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-12 02:34:02,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 163.0) internal successors, (1141), 7 states have internal predecessors, (1141), 0 states have call successors, (0), 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-12 02:34:02,680 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 163.0) internal successors, (1141), 7 states have internal predecessors, (1141), 0 states have call successors, (0), 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-12 02:34:02,681 INFO L175 Difference]: Start difference. First operand has 39 places, 47 transitions, 233 flow. Second operand 6 states and 528 transitions. [2023-11-12 02:34:02,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 96 transitions, 613 flow [2023-11-12 02:34:02,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 96 transitions, 613 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-12 02:34:02,690 INFO L231 Difference]: Finished difference. Result has 47 places, 55 transitions, 362 flow [2023-11-12 02:34:02,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=362, PETRI_PLACES=47, PETRI_TRANSITIONS=55} [2023-11-12 02:34:02,691 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 16 predicate places. [2023-11-12 02:34:02,691 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 55 transitions, 362 flow [2023-11-12 02:34:02,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.8) internal successors, (399), 5 states have internal predecessors, (399), 0 states have call successors, (0), 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-12 02:34:02,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:34:02,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:34:02,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:34:02,693 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-12 02:34:02,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:34:02,693 INFO L85 PathProgramCache]: Analyzing trace with hash -312071790, now seen corresponding path program 3 times [2023-11-12 02:34:02,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:34:02,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926977289] [2023-11-12 02:34:02,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:34:02,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:34:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:02,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:34:02,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:34:02,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926977289] [2023-11-12 02:34:02,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926977289] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:34:02,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:34:02,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:34:02,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212571024] [2023-11-12 02:34:02,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:34:02,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:34:02,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:34:02,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:34:02,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:34:03,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 163 [2023-11-12 02:34:03,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 55 transitions, 362 flow. Second operand has 6 states, 6 states have (on average 77.16666666666667) internal successors, (463), 6 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:34:03,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:34:03,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 163 [2023-11-12 02:34:03,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:34:03,495 INFO L124 PetriNetUnfolderBase]: 1018/1504 cut-off events. [2023-11-12 02:34:03,495 INFO L125 PetriNetUnfolderBase]: For 1889/1922 co-relation queries the response was YES. [2023-11-12 02:34:03,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4979 conditions, 1504 events. 1018/1504 cut-off events. For 1889/1922 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 6627 event pairs, 50 based on Foata normal form. 31/1513 useless extension candidates. Maximal degree in co-relation 4117. Up to 670 conditions per place. [2023-11-12 02:34:03,514 INFO L140 encePairwiseOnDemand]: 155/163 looper letters, 95 selfloop transitions, 22 changer transitions 3/122 dead transitions. [2023-11-12 02:34:03,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 122 transitions, 845 flow [2023-11-12 02:34:03,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:34:03,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:34:03,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 610 transitions. [2023-11-12 02:34:03,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5346187554776511 [2023-11-12 02:34:03,518 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 610 transitions. [2023-11-12 02:34:03,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 610 transitions. [2023-11-12 02:34:03,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:34:03,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 610 transitions. [2023-11-12 02:34:03,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 87.14285714285714) internal successors, (610), 7 states have internal predecessors, (610), 0 states have call successors, (0), 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-12 02:34:03,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 163.0) internal successors, (1304), 8 states have internal predecessors, (1304), 0 states have call successors, (0), 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-12 02:34:03,524 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 163.0) internal successors, (1304), 8 states have internal predecessors, (1304), 0 states have call successors, (0), 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-12 02:34:03,525 INFO L175 Difference]: Start difference. First operand has 47 places, 55 transitions, 362 flow. Second operand 7 states and 610 transitions. [2023-11-12 02:34:03,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 122 transitions, 845 flow [2023-11-12 02:34:03,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 122 transitions, 817 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-12 02:34:03,540 INFO L231 Difference]: Finished difference. Result has 54 places, 63 transitions, 465 flow [2023-11-12 02:34:03,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=465, PETRI_PLACES=54, PETRI_TRANSITIONS=63} [2023-11-12 02:34:03,541 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 23 predicate places. [2023-11-12 02:34:03,542 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 63 transitions, 465 flow [2023-11-12 02:34:03,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.16666666666667) internal successors, (463), 6 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:34:03,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:34:03,542 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-12 02:34:03,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:34:03,543 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-12 02:34:03,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:34:03,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1007627009, now seen corresponding path program 1 times [2023-11-12 02:34:03,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:34:03,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615926609] [2023-11-12 02:34:03,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:34:03,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:34:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:03,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:34:03,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:34:03,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615926609] [2023-11-12 02:34:03,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615926609] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:34:03,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:34:03,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:34:03,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318802099] [2023-11-12 02:34:03,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:34:03,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:34:03,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:34:03,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:34:03,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:34:03,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 163 [2023-11-12 02:34:03,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 63 transitions, 465 flow. Second operand has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 states have internal predecessors, (400), 0 states have call successors, (0), 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-12 02:34:03,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:34:03,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 163 [2023-11-12 02:34:03,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:34:04,420 INFO L124 PetriNetUnfolderBase]: 1525/2293 cut-off events. [2023-11-12 02:34:04,420 INFO L125 PetriNetUnfolderBase]: For 6110/6110 co-relation queries the response was YES. [2023-11-12 02:34:04,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8650 conditions, 2293 events. 1525/2293 cut-off events. For 6110/6110 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 11105 event pairs, 261 based on Foata normal form. 28/2281 useless extension candidates. Maximal degree in co-relation 7663. Up to 1093 conditions per place. [2023-11-12 02:34:04,487 INFO L140 encePairwiseOnDemand]: 156/163 looper letters, 93 selfloop transitions, 50 changer transitions 3/147 dead transitions. [2023-11-12 02:34:04,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 147 transitions, 1355 flow [2023-11-12 02:34:04,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:34:04,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:34:04,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2023-11-12 02:34:04,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5423312883435583 [2023-11-12 02:34:04,490 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 442 transitions. [2023-11-12 02:34:04,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 442 transitions. [2023-11-12 02:34:04,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:34:04,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 442 transitions. [2023-11-12 02:34:04,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:34:04,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 163.0) internal successors, (978), 6 states have internal predecessors, (978), 0 states have call successors, (0), 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-12 02:34:04,494 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 163.0) internal successors, (978), 6 states have internal predecessors, (978), 0 states have call successors, (0), 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-12 02:34:04,494 INFO L175 Difference]: Start difference. First operand has 54 places, 63 transitions, 465 flow. Second operand 5 states and 442 transitions. [2023-11-12 02:34:04,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 147 transitions, 1355 flow [2023-11-12 02:34:04,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 147 transitions, 1295 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-11-12 02:34:04,522 INFO L231 Difference]: Finished difference. Result has 58 places, 99 transitions, 948 flow [2023-11-12 02:34:04,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=948, PETRI_PLACES=58, PETRI_TRANSITIONS=99} [2023-11-12 02:34:04,523 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 27 predicate places. [2023-11-12 02:34:04,523 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 99 transitions, 948 flow [2023-11-12 02:34:04,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 states have internal predecessors, (400), 0 states have call successors, (0), 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-12 02:34:04,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:34:04,524 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-12 02:34:04,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:34:04,524 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-12 02:34:04,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:34:04,525 INFO L85 PathProgramCache]: Analyzing trace with hash -698442831, now seen corresponding path program 2 times [2023-11-12 02:34:04,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:34:04,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904818413] [2023-11-12 02:34:04,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:34:04,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:34:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:04,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:34:04,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:34:04,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904818413] [2023-11-12 02:34:04,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904818413] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:34:04,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:34:04,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:34:04,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836905045] [2023-11-12 02:34:04,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:34:04,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:34:04,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:34:04,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:34:04,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:34:04,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 163 [2023-11-12 02:34:04,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 99 transitions, 948 flow. Second operand has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 states have internal predecessors, (400), 0 states have call successors, (0), 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-12 02:34:04,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:34:04,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 163 [2023-11-12 02:34:04,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:34:05,338 INFO L124 PetriNetUnfolderBase]: 1760/2669 cut-off events. [2023-11-12 02:34:05,339 INFO L125 PetriNetUnfolderBase]: For 9569/9604 co-relation queries the response was YES. [2023-11-12 02:34:05,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11356 conditions, 2669 events. 1760/2669 cut-off events. For 9569/9604 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 13637 event pairs, 412 based on Foata normal form. 56/2687 useless extension candidates. Maximal degree in co-relation 10140. Up to 1314 conditions per place. [2023-11-12 02:34:05,370 INFO L140 encePairwiseOnDemand]: 156/163 looper letters, 80 selfloop transitions, 67 changer transitions 0/148 dead transitions. [2023-11-12 02:34:05,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 148 transitions, 1477 flow [2023-11-12 02:34:05,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:34:05,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:34:05,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2023-11-12 02:34:05,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5472392638036809 [2023-11-12 02:34:05,373 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 446 transitions. [2023-11-12 02:34:05,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 446 transitions. [2023-11-12 02:34:05,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:34:05,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 446 transitions. [2023-11-12 02:34:05,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 0 states have call successors, (0), 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-12 02:34:05,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 163.0) internal successors, (978), 6 states have internal predecessors, (978), 0 states have call successors, (0), 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-12 02:34:05,378 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 163.0) internal successors, (978), 6 states have internal predecessors, (978), 0 states have call successors, (0), 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-12 02:34:05,378 INFO L175 Difference]: Start difference. First operand has 58 places, 99 transitions, 948 flow. Second operand 5 states and 446 transitions. [2023-11-12 02:34:05,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 148 transitions, 1477 flow [2023-11-12 02:34:05,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 148 transitions, 1475 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-12 02:34:05,449 INFO L231 Difference]: Finished difference. Result has 65 places, 107 transitions, 1245 flow [2023-11-12 02:34:05,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=937, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1245, PETRI_PLACES=65, PETRI_TRANSITIONS=107} [2023-11-12 02:34:05,452 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 34 predicate places. [2023-11-12 02:34:05,452 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 107 transitions, 1245 flow [2023-11-12 02:34:05,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 states have internal predecessors, (400), 0 states have call successors, (0), 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-12 02:34:05,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:34:05,453 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-12 02:34:05,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:34:05,453 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-12 02:34:05,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:34:05,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1158573223, now seen corresponding path program 3 times [2023-11-12 02:34:05,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:34:05,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207452783] [2023-11-12 02:34:05,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:34:05,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:34:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:05,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:34:05,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:34:05,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207452783] [2023-11-12 02:34:05,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207452783] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:34:05,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:34:05,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:34:05,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12178069] [2023-11-12 02:34:05,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:34:05,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:34:05,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:34:05,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:34:05,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:34:05,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 163 [2023-11-12 02:34:05,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 107 transitions, 1245 flow. Second operand has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 states have internal predecessors, (400), 0 states have call successors, (0), 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-12 02:34:05,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:34:05,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 163 [2023-11-12 02:34:05,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:34:06,498 INFO L124 PetriNetUnfolderBase]: 1807/2745 cut-off events. [2023-11-12 02:34:06,499 INFO L125 PetriNetUnfolderBase]: For 14501/14549 co-relation queries the response was YES. [2023-11-12 02:34:06,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13108 conditions, 2745 events. 1807/2745 cut-off events. For 14501/14549 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 13961 event pairs, 478 based on Foata normal form. 48/2767 useless extension candidates. Maximal degree in co-relation 11676. Up to 1501 conditions per place. [2023-11-12 02:34:06,531 INFO L140 encePairwiseOnDemand]: 156/163 looper letters, 81 selfloop transitions, 68 changer transitions 7/157 dead transitions. [2023-11-12 02:34:06,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 157 transitions, 1801 flow [2023-11-12 02:34:06,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:34:06,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:34:06,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 450 transitions. [2023-11-12 02:34:06,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5521472392638037 [2023-11-12 02:34:06,534 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 450 transitions. [2023-11-12 02:34:06,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 450 transitions. [2023-11-12 02:34:06,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:34:06,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 450 transitions. [2023-11-12 02:34:06,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 0 states have call successors, (0), 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-12 02:34:06,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 163.0) internal successors, (978), 6 states have internal predecessors, (978), 0 states have call successors, (0), 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-12 02:34:06,539 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 163.0) internal successors, (978), 6 states have internal predecessors, (978), 0 states have call successors, (0), 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-12 02:34:06,539 INFO L175 Difference]: Start difference. First operand has 65 places, 107 transitions, 1245 flow. Second operand 5 states and 450 transitions. [2023-11-12 02:34:06,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 157 transitions, 1801 flow [2023-11-12 02:34:06,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 157 transitions, 1712 flow, removed 14 selfloop flow, removed 1 redundant places. [2023-11-12 02:34:06,596 INFO L231 Difference]: Finished difference. Result has 71 places, 109 transitions, 1397 flow [2023-11-12 02:34:06,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=1151, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1397, PETRI_PLACES=71, PETRI_TRANSITIONS=109} [2023-11-12 02:34:06,598 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 40 predicate places. [2023-11-12 02:34:06,598 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 109 transitions, 1397 flow [2023-11-12 02:34:06,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 states have internal predecessors, (400), 0 states have call successors, (0), 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-12 02:34:06,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:34:06,599 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-12 02:34:06,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:34:06,599 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-12 02:34:06,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:34:06,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1021653368, now seen corresponding path program 1 times [2023-11-12 02:34:06,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:34:06,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447629043] [2023-11-12 02:34:06,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:34:06,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:34:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:06,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:34:06,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:34:06,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447629043] [2023-11-12 02:34:06,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447629043] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:34:06,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:34:06,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:34:06,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195409468] [2023-11-12 02:34:06,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:34:06,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:34:06,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:34:06,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:34:06,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:34:06,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 163 [2023-11-12 02:34:06,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 109 transitions, 1397 flow. Second operand has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 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-12 02:34:06,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:34:06,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 163 [2023-11-12 02:34:06,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:34:07,465 INFO L124 PetriNetUnfolderBase]: 1958/3061 cut-off events. [2023-11-12 02:34:07,465 INFO L125 PetriNetUnfolderBase]: For 17280/17466 co-relation queries the response was YES. [2023-11-12 02:34:07,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15125 conditions, 3061 events. 1958/3061 cut-off events. For 17280/17466 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 16002 event pairs, 272 based on Foata normal form. 263/3318 useless extension candidates. Maximal degree in co-relation 14615. Up to 2178 conditions per place. [2023-11-12 02:34:07,545 INFO L140 encePairwiseOnDemand]: 157/163 looper letters, 138 selfloop transitions, 20 changer transitions 0/163 dead transitions. [2023-11-12 02:34:07,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 163 transitions, 2173 flow [2023-11-12 02:34:07,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:34:07,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:34:07,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 436 transitions. [2023-11-12 02:34:07,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5349693251533743 [2023-11-12 02:34:07,549 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 436 transitions. [2023-11-12 02:34:07,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 436 transitions. [2023-11-12 02:34:07,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:34:07,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 436 transitions. [2023-11-12 02:34:07,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 0 states have call successors, (0), 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-12 02:34:07,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 163.0) internal successors, (978), 6 states have internal predecessors, (978), 0 states have call successors, (0), 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-12 02:34:07,553 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 163.0) internal successors, (978), 6 states have internal predecessors, (978), 0 states have call successors, (0), 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-12 02:34:07,554 INFO L175 Difference]: Start difference. First operand has 71 places, 109 transitions, 1397 flow. Second operand 5 states and 436 transitions. [2023-11-12 02:34:07,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 163 transitions, 2173 flow [2023-11-12 02:34:07,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 163 transitions, 2071 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-11-12 02:34:07,609 INFO L231 Difference]: Finished difference. Result has 72 places, 110 transitions, 1373 flow [2023-11-12 02:34:07,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=1314, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1373, PETRI_PLACES=72, PETRI_TRANSITIONS=110} [2023-11-12 02:34:07,610 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 41 predicate places. [2023-11-12 02:34:07,610 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 110 transitions, 1373 flow [2023-11-12 02:34:07,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 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-12 02:34:07,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:34:07,611 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-12 02:34:07,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:34:07,611 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-12 02:34:07,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:34:07,612 INFO L85 PathProgramCache]: Analyzing trace with hash 99101762, now seen corresponding path program 2 times [2023-11-12 02:34:07,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:34:07,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959392926] [2023-11-12 02:34:07,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:34:07,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:34:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:07,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:34:07,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:34:07,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959392926] [2023-11-12 02:34:07,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959392926] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:34:07,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:34:07,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:34:07,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133396689] [2023-11-12 02:34:07,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:34:07,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:34:07,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:34:07,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:34:07,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:34:07,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 163 [2023-11-12 02:34:07,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 110 transitions, 1373 flow. Second operand has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 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-12 02:34:07,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:34:07,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 163 [2023-11-12 02:34:07,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:34:08,598 INFO L124 PetriNetUnfolderBase]: 1975/3109 cut-off events. [2023-11-12 02:34:08,598 INFO L125 PetriNetUnfolderBase]: For 17705/17887 co-relation queries the response was YES. [2023-11-12 02:34:08,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15725 conditions, 3109 events. 1975/3109 cut-off events. For 17705/17887 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 16665 event pairs, 434 based on Foata normal form. 163/3264 useless extension candidates. Maximal degree in co-relation 13436. Up to 2864 conditions per place. [2023-11-12 02:34:08,633 INFO L140 encePairwiseOnDemand]: 157/163 looper letters, 113 selfloop transitions, 20 changer transitions 0/138 dead transitions. [2023-11-12 02:34:08,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 138 transitions, 1784 flow [2023-11-12 02:34:08,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:34:08,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:34:08,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 431 transitions. [2023-11-12 02:34:08,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5288343558282208 [2023-11-12 02:34:08,638 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 431 transitions. [2023-11-12 02:34:08,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 431 transitions. [2023-11-12 02:34:08,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:34:08,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 431 transitions. [2023-11-12 02:34:08,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 0 states have call successors, (0), 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-12 02:34:08,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 163.0) internal successors, (978), 6 states have internal predecessors, (978), 0 states have call successors, (0), 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-12 02:34:08,643 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 163.0) internal successors, (978), 6 states have internal predecessors, (978), 0 states have call successors, (0), 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-12 02:34:08,643 INFO L175 Difference]: Start difference. First operand has 72 places, 110 transitions, 1373 flow. Second operand 5 states and 431 transitions. [2023-11-12 02:34:08,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 138 transitions, 1784 flow [2023-11-12 02:34:08,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 138 transitions, 1745 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-11-12 02:34:08,710 INFO L231 Difference]: Finished difference. Result has 75 places, 113 transitions, 1445 flow [2023-11-12 02:34:08,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=1338, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1445, PETRI_PLACES=75, PETRI_TRANSITIONS=113} [2023-11-12 02:34:08,711 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 44 predicate places. [2023-11-12 02:34:08,712 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 113 transitions, 1445 flow [2023-11-12 02:34:08,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 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-12 02:34:08,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:34:08,712 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-12 02:34:08,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:34:08,713 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-12 02:34:08,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:34:08,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1876509953, now seen corresponding path program 4 times [2023-11-12 02:34:08,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:34:08,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166835441] [2023-11-12 02:34:08,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:34:08,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:34:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:09,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:34:09,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:34:09,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166835441] [2023-11-12 02:34:09,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166835441] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:34:09,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790921772] [2023-11-12 02:34:09,035 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-12 02:34:09,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:34:09,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:34:09,040 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:34:09,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 02:34:09,182 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-12 02:34:09,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:34:09,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-12 02:34:09,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:34:09,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:34:09,460 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:34:09,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:34:09,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790921772] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:34:09,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:34:09,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 11 [2023-11-12 02:34:09,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472022809] [2023-11-12 02:34:09,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:34:09,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-12 02:34:09,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:34:09,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 02:34:09,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-11-12 02:34:09,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 163 [2023-11-12 02:34:09,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 113 transitions, 1445 flow. Second operand has 11 states, 11 states have (on average 74.45454545454545) internal successors, (819), 11 states have internal predecessors, (819), 0 states have call successors, (0), 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-12 02:34:09,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:34:09,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 163 [2023-11-12 02:34:09,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:34:12,925 INFO L124 PetriNetUnfolderBase]: 4179/6627 cut-off events. [2023-11-12 02:34:12,925 INFO L125 PetriNetUnfolderBase]: For 34258/34308 co-relation queries the response was YES. [2023-11-12 02:34:12,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32513 conditions, 6627 events. 4179/6627 cut-off events. For 34258/34308 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 40313 event pairs, 253 based on Foata normal form. 194/6815 useless extension candidates. Maximal degree in co-relation 24180. Up to 2047 conditions per place. [2023-11-12 02:34:12,998 INFO L140 encePairwiseOnDemand]: 152/163 looper letters, 223 selfloop transitions, 185 changer transitions 36/445 dead transitions. [2023-11-12 02:34:12,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 445 transitions, 4712 flow [2023-11-12 02:34:12,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-12 02:34:12,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-11-12 02:34:13,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2038 transitions. [2023-11-12 02:34:13,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5001226993865031 [2023-11-12 02:34:13,007 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 2038 transitions. [2023-11-12 02:34:13,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 2038 transitions. [2023-11-12 02:34:13,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:34:13,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 2038 transitions. [2023-11-12 02:34:13,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 81.52) internal successors, (2038), 25 states have internal predecessors, (2038), 0 states have call successors, (0), 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-12 02:34:13,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 163.0) internal successors, (4238), 26 states have internal predecessors, (4238), 0 states have call successors, (0), 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-12 02:34:13,027 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 163.0) internal successors, (4238), 26 states have internal predecessors, (4238), 0 states have call successors, (0), 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-12 02:34:13,027 INFO L175 Difference]: Start difference. First operand has 75 places, 113 transitions, 1445 flow. Second operand 25 states and 2038 transitions. [2023-11-12 02:34:13,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 445 transitions, 4712 flow [2023-11-12 02:34:13,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 445 transitions, 4684 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-12 02:34:13,264 INFO L231 Difference]: Finished difference. Result has 112 places, 239 transitions, 3553 flow [2023-11-12 02:34:13,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=1420, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=3553, PETRI_PLACES=112, PETRI_TRANSITIONS=239} [2023-11-12 02:34:13,266 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 81 predicate places. [2023-11-12 02:34:13,266 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 239 transitions, 3553 flow [2023-11-12 02:34:13,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 74.45454545454545) internal successors, (819), 11 states have internal predecessors, (819), 0 states have call successors, (0), 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-12 02:34:13,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:34:13,267 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-12 02:34:13,280 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-12 02:34:13,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:34:13,473 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-12 02:34:13,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:34:13,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1116343772, now seen corresponding path program 3 times [2023-11-12 02:34:13,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:34:13,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016528146] [2023-11-12 02:34:13,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:34:13,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:34:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:13,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:34:13,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:34:13,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016528146] [2023-11-12 02:34:13,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016528146] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:34:13,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:34:13,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:34:13,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179375723] [2023-11-12 02:34:13,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:34:13,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:34:13,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:34:13,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:34:13,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:34:13,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 163 [2023-11-12 02:34:13,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 239 transitions, 3553 flow. Second operand has 6 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 states have internal predecessors, (458), 0 states have call successors, (0), 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-12 02:34:13,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:34:13,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 163 [2023-11-12 02:34:13,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:34:15,328 INFO L124 PetriNetUnfolderBase]: 3778/5797 cut-off events. [2023-11-12 02:34:15,328 INFO L125 PetriNetUnfolderBase]: For 47832/47857 co-relation queries the response was YES. [2023-11-12 02:34:15,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33725 conditions, 5797 events. 3778/5797 cut-off events. For 47832/47857 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 32723 event pairs, 817 based on Foata normal form. 37/5830 useless extension candidates. Maximal degree in co-relation 33023. Up to 5681 conditions per place. [2023-11-12 02:34:15,414 INFO L140 encePairwiseOnDemand]: 156/163 looper letters, 217 selfloop transitions, 14 changer transitions 15/247 dead transitions. [2023-11-12 02:34:15,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 247 transitions, 3876 flow [2023-11-12 02:34:15,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:34:15,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-12 02:34:15,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 640 transitions. [2023-11-12 02:34:15,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49079754601226994 [2023-11-12 02:34:15,418 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 640 transitions. [2023-11-12 02:34:15,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 640 transitions. [2023-11-12 02:34:15,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:34:15,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 640 transitions. [2023-11-12 02:34:15,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 80.0) internal successors, (640), 8 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:34:15,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 163.0) internal successors, (1467), 9 states have internal predecessors, (1467), 0 states have call successors, (0), 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-12 02:34:15,426 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 163.0) internal successors, (1467), 9 states have internal predecessors, (1467), 0 states have call successors, (0), 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-12 02:34:15,426 INFO L175 Difference]: Start difference. First operand has 112 places, 239 transitions, 3553 flow. Second operand 8 states and 640 transitions. [2023-11-12 02:34:15,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 247 transitions, 3876 flow [2023-11-12 02:34:15,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 247 transitions, 3558 flow, removed 148 selfloop flow, removed 3 redundant places. [2023-11-12 02:34:15,753 INFO L231 Difference]: Finished difference. Result has 118 places, 223 transitions, 2972 flow [2023-11-12 02:34:15,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=2958, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2972, PETRI_PLACES=118, PETRI_TRANSITIONS=223} [2023-11-12 02:34:15,754 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 87 predicate places. [2023-11-12 02:34:15,754 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 223 transitions, 2972 flow [2023-11-12 02:34:15,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 states have internal predecessors, (458), 0 states have call successors, (0), 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-12 02:34:15,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:34:15,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:34:15,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:34:15,756 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-12 02:34:15,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:34:15,756 INFO L85 PathProgramCache]: Analyzing trace with hash -442003952, now seen corresponding path program 1 times [2023-11-12 02:34:15,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:34:15,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994348085] [2023-11-12 02:34:15,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:34:15,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:34:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:16,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:34:16,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:34:16,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994348085] [2023-11-12 02:34:16,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994348085] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:34:16,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989359815] [2023-11-12 02:34:16,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:34:16,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:34:16,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:34:16,177 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:34:16,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 02:34:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:16,291 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-12 02:34:16,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:34:16,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:34:16,541 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:34:17,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:34:17,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989359815] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:34:17,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:34:17,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2023-11-12 02:34:17,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934871237] [2023-11-12 02:34:17,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:34:17,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 02:34:17,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:34:17,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 02:34:17,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:34:17,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 163 [2023-11-12 02:34:17,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 223 transitions, 2972 flow. Second operand has 9 states, 9 states have (on average 79.0) internal successors, (711), 9 states have internal predecessors, (711), 0 states have call successors, (0), 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-12 02:34:17,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:34:17,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 163 [2023-11-12 02:34:17,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:34:18,280 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([288] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork2_#t~post2][112], [Black: 190#(not (= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 369#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (= ~p~0 0) (= ~q~0 0)), Black: 366#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 373#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (= ~p~0 0) (= ~q~0 0) (or (= thread2Thread1of1ForFork1_~cond~1 0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 131#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 383#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (= thread2Thread1of1ForFork1_~cond~1 0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 348#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 363#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0)), Black: 196#(and (= ~N~0 ~L~0) (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0)))), 109#true, Black: 306#(or (< 0 (mod ~L~0 4294967296)) (and (= ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296))) (<= (mod ~N~0 4294967296) 1))), 153#(and (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork1_~cond~1 1)))), Black: 337#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (= ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296))) (<= (mod ~N~0 4294967296) 1)))), Black: 346#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0)), Black: 354#(and (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (or (< 0 (mod ~L~0 4294967296)) (and (= ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296))) (<= (mod ~N~0 4294967296) 1))) (or (= thread2Thread1of1ForFork1_~cond~1 0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 207#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 377#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 371#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 340#(and (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (or (< 0 (mod ~L~0 4294967296)) (and (= ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296))) (<= (mod ~N~0 4294967296) 1)))), Black: 379#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 143#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), 15#L53true, Black: 142#(or (< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1)) (and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0))), 138#true, 67#L99-4true, 423#true, Black: 152#(or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 8#L83true, 205#(or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 406#(= ~N~0 ~L~0), Black: 413#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 169#(and (= thread2Thread1of1ForFork1_~cond~1 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0)), Black: 167#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0)), Black: 106#(and (= ~p~0 0) (= ~q~0 0)), 4#thread2EXITtrue, 404#true, Black: 177#(and (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork1_~cond~1 1)))), Black: 180#(and (= thread2Thread1of1ForFork1_~cond~1 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0)), Black: 120#(and (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 111#(or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)), 176#(or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 112#(and (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), 163#(or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 118#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)))]) [2023-11-12 02:34:18,280 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-11-12 02:34:18,281 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-11-12 02:34:18,281 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-11-12 02:34:18,281 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-11-12 02:34:18,434 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L83-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_9| 0) (<= (mod v_~L~0_34 4294967296) 0) (= |v_thread3Thread1of1ForFork2_#res.base_9| 0)) InVars {~L~0=v_~L~0_34} OutVars{~L~0=v_~L~0_34, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_9|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_9|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base][197], [Black: 190#(not (= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 114#(< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1)), Black: 369#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (= ~p~0 0) (= ~q~0 0)), Black: 366#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 373#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (= ~p~0 0) (= ~q~0 0) (or (= thread2Thread1of1ForFork1_~cond~1 0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 131#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 383#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (= thread2Thread1of1ForFork1_~cond~1 0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 348#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 363#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0)), Black: 196#(and (= ~N~0 ~L~0) (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 306#(or (< 0 (mod ~L~0 4294967296)) (and (= ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296))) (<= (mod ~N~0 4294967296) 1))), Black: 337#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (= ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296))) (<= (mod ~N~0 4294967296) 1)))), 153#(and (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork1_~cond~1 1)))), Black: 346#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0)), Black: 354#(and (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (or (< 0 (mod ~L~0 4294967296)) (and (= ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296))) (<= (mod ~N~0 4294967296) 1))) (or (= thread2Thread1of1ForFork1_~cond~1 0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 207#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 377#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 371#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 340#(and (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (or (< 0 (mod ~L~0 4294967296)) (and (= ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296))) (<= (mod ~N~0 4294967296) 1)))), Black: 379#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 143#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), 15#L53true, Black: 138#true, 67#L99-4true, 142#(or (< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1)) (and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0))), Black: 152#(or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 75#thread3EXITtrue, 205#(or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 406#(= ~N~0 ~L~0), Black: 413#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 169#(and (= thread2Thread1of1ForFork1_~cond~1 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0)), Black: 106#(and (= ~p~0 0) (= ~q~0 0)), Black: 167#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0)), 559#(and (or (= ~p~0 (+ ~M~0 ~q~0)) (< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1))) (or (< (mod ~L~0 4294967296) 1) (and (<= 1 (mod ~N~0 4294967296)) (= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0)))), 4#thread2EXITtrue, 404#true, Black: 177#(and (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork1_~cond~1 1)))), Black: 180#(and (= thread2Thread1of1ForFork1_~cond~1 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0)), Black: 120#(and (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 111#(or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)), 176#(or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 112#(and (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 118#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), 163#(or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0)))]) [2023-11-12 02:34:18,441 INFO L294 olderBase$Statistics]: this new event has 14 ancestors and is not cut-off event [2023-11-12 02:34:18,441 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is not cut-off event [2023-11-12 02:34:18,441 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is not cut-off event [2023-11-12 02:34:18,442 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-11-12 02:34:18,619 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([288] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork2_#t~post2][112], [Black: 190#(not (= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 369#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (= ~p~0 0) (= ~q~0 0)), Black: 366#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 373#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (= ~p~0 0) (= ~q~0 0) (or (= thread2Thread1of1ForFork1_~cond~1 0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 383#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (= thread2Thread1of1ForFork1_~cond~1 0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 131#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 348#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 196#(and (= ~N~0 ~L~0) (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 363#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0)), 109#true, Black: 306#(or (< 0 (mod ~L~0 4294967296)) (and (= ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296))) (<= (mod ~N~0 4294967296) 1))), 153#(and (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork1_~cond~1 1)))), Black: 337#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (= ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296))) (<= (mod ~N~0 4294967296) 1)))), Black: 346#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0)), Black: 354#(and (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (or (< 0 (mod ~L~0 4294967296)) (and (= ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296))) (<= (mod ~N~0 4294967296) 1))) (or (= thread2Thread1of1ForFork1_~cond~1 0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 207#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 377#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 371#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 340#(and (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (or (< 0 (mod ~L~0 4294967296)) (and (= ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296))) (<= (mod ~N~0 4294967296) 1)))), Black: 379#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 143#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), 15#L53true, Black: 142#(or (< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1)) (and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0))), 138#true, 423#true, Black: 152#(or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 8#L83true, 205#(or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 406#(= ~N~0 ~L~0), Black: 413#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 6#L100-1true, Black: 169#(and (= thread2Thread1of1ForFork1_~cond~1 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0)), Black: 106#(and (= ~p~0 0) (= ~q~0 0)), Black: 167#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0)), 4#thread2EXITtrue, 404#true, Black: 177#(and (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork1_~cond~1 1)))), Black: 180#(and (= thread2Thread1of1ForFork1_~cond~1 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0)), Black: 120#(and (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 111#(or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)), 176#(or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 112#(and (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), 163#(or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 118#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)))]) [2023-11-12 02:34:18,620 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-11-12 02:34:18,620 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-11-12 02:34:18,620 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-11-12 02:34:18,620 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-12 02:34:18,698 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L83-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_9| 0) (<= (mod v_~L~0_34 4294967296) 0) (= |v_thread3Thread1of1ForFork2_#res.base_9| 0)) InVars {~L~0=v_~L~0_34} OutVars{~L~0=v_~L~0_34, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_9|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_9|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base][197], [Black: 190#(not (= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 114#(< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1)), Black: 369#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (= ~p~0 0) (= ~q~0 0)), Black: 366#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 373#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (= ~p~0 0) (= ~q~0 0) (or (= thread2Thread1of1ForFork1_~cond~1 0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 131#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 383#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (= thread2Thread1of1ForFork1_~cond~1 0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 348#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 363#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0)), Black: 196#(and (= ~N~0 ~L~0) (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 306#(or (< 0 (mod ~L~0 4294967296)) (and (= ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296))) (<= (mod ~N~0 4294967296) 1))), Black: 337#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (= ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296))) (<= (mod ~N~0 4294967296) 1)))), 153#(and (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork1_~cond~1 1)))), Black: 346#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0)), Black: 354#(and (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (or (< 0 (mod ~L~0 4294967296)) (and (= ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296))) (<= (mod ~N~0 4294967296) 1))) (or (= thread2Thread1of1ForFork1_~cond~1 0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 207#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 377#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 371#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 340#(and (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (or (< 0 (mod ~L~0 4294967296)) (and (= ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296))) (<= (mod ~N~0 4294967296) 1)))), Black: 379#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 143#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 138#true, 15#L53true, 142#(or (< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1)) (and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0))), Black: 152#(or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork1_~cond~1 1))), 75#thread3EXITtrue, 205#(or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 406#(= ~N~0 ~L~0), Black: 413#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 6#L100-1true, Black: 169#(and (= thread2Thread1of1ForFork1_~cond~1 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0)), 559#(and (or (= ~p~0 (+ ~M~0 ~q~0)) (< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1))) (or (< (mod ~L~0 4294967296) 1) (and (<= 1 (mod ~N~0 4294967296)) (= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0)))), Black: 106#(and (= ~p~0 0) (= ~q~0 0)), Black: 167#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0)), 4#thread2EXITtrue, 404#true, Black: 177#(and (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork1_~cond~1 1)))), Black: 180#(and (= thread2Thread1of1ForFork1_~cond~1 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0)), Black: 120#(and (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 111#(or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)), 176#(or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 112#(and (or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 118#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), 163#(or (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 0)))]) [2023-11-12 02:34:18,699 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is not cut-off event [2023-11-12 02:34:18,699 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-11-12 02:34:18,699 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is not cut-off event [2023-11-12 02:34:18,699 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2023-11-12 02:34:19,550 INFO L124 PetriNetUnfolderBase]: 4299/7186 cut-off events. [2023-11-12 02:34:19,551 INFO L125 PetriNetUnfolderBase]: For 55654/56110 co-relation queries the response was YES. [2023-11-12 02:34:19,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39843 conditions, 7186 events. 4299/7186 cut-off events. For 55654/56110 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 48158 event pairs, 392 based on Foata normal form. 337/7483 useless extension candidates. Maximal degree in co-relation 38937. Up to 3682 conditions per place. [2023-11-12 02:34:19,638 INFO L140 encePairwiseOnDemand]: 157/163 looper letters, 214 selfloop transitions, 154 changer transitions 6/407 dead transitions. [2023-11-12 02:34:19,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 407 transitions, 5794 flow [2023-11-12 02:34:19,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 02:34:19,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-12 02:34:19,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 775 transitions. [2023-11-12 02:34:19,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5282890252215405 [2023-11-12 02:34:19,642 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 775 transitions. [2023-11-12 02:34:19,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 775 transitions. [2023-11-12 02:34:19,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:34:19,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 775 transitions. [2023-11-12 02:34:19,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 86.11111111111111) internal successors, (775), 9 states have internal predecessors, (775), 0 states have call successors, (0), 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-12 02:34:19,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 163.0) internal successors, (1630), 10 states have internal predecessors, (1630), 0 states have call successors, (0), 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-12 02:34:19,650 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 163.0) internal successors, (1630), 10 states have internal predecessors, (1630), 0 states have call successors, (0), 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-12 02:34:19,650 INFO L175 Difference]: Start difference. First operand has 118 places, 223 transitions, 2972 flow. Second operand 9 states and 775 transitions. [2023-11-12 02:34:19,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 407 transitions, 5794 flow [2023-11-12 02:34:19,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 407 transitions, 5738 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-11-12 02:34:19,971 INFO L231 Difference]: Finished difference. Result has 121 places, 310 transitions, 4678 flow [2023-11-12 02:34:19,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=2928, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4678, PETRI_PLACES=121, PETRI_TRANSITIONS=310} [2023-11-12 02:34:19,975 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 90 predicate places. [2023-11-12 02:34:19,975 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 310 transitions, 4678 flow [2023-11-12 02:34:19,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 79.0) internal successors, (711), 9 states have internal predecessors, (711), 0 states have call successors, (0), 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-12 02:34:19,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:34:19,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:34:19,984 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-12 02:34:20,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:34:20,183 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-12 02:34:20,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:34:20,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1931411840, now seen corresponding path program 2 times [2023-11-12 02:34:20,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:34:20,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352818551] [2023-11-12 02:34:20,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:34:20,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:34:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:20,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:34:20,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:34:20,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352818551] [2023-11-12 02:34:20,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352818551] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:34:20,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395685781] [2023-11-12 02:34:20,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-12 02:34:20,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:34:20,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:34:20,623 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:34:20,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 02:34:20,736 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-12 02:34:20,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:34:20,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-12 02:34:20,742 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:34:20,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:34:20,894 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:34:21,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:34:21,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395685781] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:34:21,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:34:21,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2023-11-12 02:34:21,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747394443] [2023-11-12 02:34:21,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:34:21,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 02:34:21,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:34:21,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 02:34:21,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:34:21,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 163 [2023-11-12 02:34:21,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 310 transitions, 4678 flow. Second operand has 9 states, 9 states have (on average 79.44444444444444) internal successors, (715), 9 states have internal predecessors, (715), 0 states have call successors, (0), 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-12 02:34:21,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:34:21,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 163 [2023-11-12 02:34:21,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:34:23,915 INFO L124 PetriNetUnfolderBase]: 4893/8143 cut-off events. [2023-11-12 02:34:23,916 INFO L125 PetriNetUnfolderBase]: For 77352/77843 co-relation queries the response was YES. [2023-11-12 02:34:23,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48500 conditions, 8143 events. 4893/8143 cut-off events. For 77352/77843 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 55767 event pairs, 618 based on Foata normal form. 338/8447 useless extension candidates. Maximal degree in co-relation 47509. Up to 5212 conditions per place. [2023-11-12 02:34:24,019 INFO L140 encePairwiseOnDemand]: 157/163 looper letters, 243 selfloop transitions, 154 changer transitions 7/437 dead transitions. [2023-11-12 02:34:24,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 437 transitions, 7100 flow [2023-11-12 02:34:24,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:34:24,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-12 02:34:24,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 677 transitions. [2023-11-12 02:34:24,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5191717791411042 [2023-11-12 02:34:24,024 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 677 transitions. [2023-11-12 02:34:24,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 677 transitions. [2023-11-12 02:34:24,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:34:24,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 677 transitions. [2023-11-12 02:34:24,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 84.625) internal successors, (677), 8 states have internal predecessors, (677), 0 states have call successors, (0), 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-12 02:34:24,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 163.0) internal successors, (1467), 9 states have internal predecessors, (1467), 0 states have call successors, (0), 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-12 02:34:24,032 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 163.0) internal successors, (1467), 9 states have internal predecessors, (1467), 0 states have call successors, (0), 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-12 02:34:24,032 INFO L175 Difference]: Start difference. First operand has 121 places, 310 transitions, 4678 flow. Second operand 8 states and 677 transitions. [2023-11-12 02:34:24,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 437 transitions, 7100 flow [2023-11-12 02:34:24,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 437 transitions, 6778 flow, removed 150 selfloop flow, removed 2 redundant places. [2023-11-12 02:34:24,616 INFO L231 Difference]: Finished difference. Result has 129 places, 373 transitions, 5867 flow [2023-11-12 02:34:24,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=4406, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5867, PETRI_PLACES=129, PETRI_TRANSITIONS=373} [2023-11-12 02:34:24,618 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 98 predicate places. [2023-11-12 02:34:24,618 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 373 transitions, 5867 flow [2023-11-12 02:34:24,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 79.44444444444444) internal successors, (715), 9 states have internal predecessors, (715), 0 states have call successors, (0), 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-12 02:34:24,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:34:24,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:34:24,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 02:34:24,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:34:24,825 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-12 02:34:24,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:34:24,826 INFO L85 PathProgramCache]: Analyzing trace with hash -627200865, now seen corresponding path program 1 times [2023-11-12 02:34:24,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:34:24,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164685867] [2023-11-12 02:34:24,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:34:24,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:34:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:25,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:34:25,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:34:25,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164685867] [2023-11-12 02:34:25,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164685867] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:34:25,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157793317] [2023-11-12 02:34:25,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:34:25,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:34:25,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:34:25,317 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:34:25,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 02:34:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:25,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-12 02:34:25,426 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:34:25,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:34:25,781 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:34:26,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:34:26,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157793317] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:34:26,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:34:26,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 20 [2023-11-12 02:34:26,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261466828] [2023-11-12 02:34:26,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:34:26,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-12 02:34:26,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:34:26,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-12 02:34:26,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2023-11-12 02:34:26,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 163 [2023-11-12 02:34:26,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 373 transitions, 5867 flow. Second operand has 21 states, 21 states have (on average 72.28571428571429) internal successors, (1518), 21 states have internal predecessors, (1518), 0 states have call successors, (0), 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-12 02:34:26,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:34:26,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 163 [2023-11-12 02:34:26,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:34:34,397 INFO L124 PetriNetUnfolderBase]: 8336/13170 cut-off events. [2023-11-12 02:34:34,397 INFO L125 PetriNetUnfolderBase]: For 145799/145811 co-relation queries the response was YES. [2023-11-12 02:34:34,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80762 conditions, 13170 events. 8336/13170 cut-off events. For 145799/145811 co-relation queries the response was YES. Maximal size of possible extension queue 779. Compared 88279 event pairs, 376 based on Foata normal form. 989/14158 useless extension candidates. Maximal degree in co-relation 80120. Up to 3414 conditions per place. [2023-11-12 02:34:34,543 INFO L140 encePairwiseOnDemand]: 152/163 looper letters, 559 selfloop transitions, 652 changer transitions 1/1213 dead transitions. [2023-11-12 02:34:34,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 1213 transitions, 17808 flow [2023-11-12 02:34:34,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-11-12 02:34:34,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2023-11-12 02:34:34,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 4312 transitions. [2023-11-12 02:34:34,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48988866166780276 [2023-11-12 02:34:34,556 INFO L72 ComplementDD]: Start complementDD. Operand 54 states and 4312 transitions. [2023-11-12 02:34:34,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 4312 transitions. [2023-11-12 02:34:34,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:34:34,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 54 states and 4312 transitions. [2023-11-12 02:34:34,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 55 states, 54 states have (on average 79.85185185185185) internal successors, (4312), 54 states have internal predecessors, (4312), 0 states have call successors, (0), 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-12 02:34:34,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 55 states, 55 states have (on average 163.0) internal successors, (8965), 55 states have internal predecessors, (8965), 0 states have call successors, (0), 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-12 02:34:34,591 INFO L81 ComplementDD]: Finished complementDD. Result has 55 states, 55 states have (on average 163.0) internal successors, (8965), 55 states have internal predecessors, (8965), 0 states have call successors, (0), 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-12 02:34:34,592 INFO L175 Difference]: Start difference. First operand has 129 places, 373 transitions, 5867 flow. Second operand 54 states and 4312 transitions. [2023-11-12 02:34:34,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 1213 transitions, 17808 flow [2023-11-12 02:34:35,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 1213 transitions, 17303 flow, removed 205 selfloop flow, removed 10 redundant places. [2023-11-12 02:34:35,356 INFO L231 Difference]: Finished difference. Result has 191 places, 889 transitions, 15253 flow [2023-11-12 02:34:35,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=4720, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=15253, PETRI_PLACES=191, PETRI_TRANSITIONS=889} [2023-11-12 02:34:35,357 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 160 predicate places. [2023-11-12 02:34:35,357 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 889 transitions, 15253 flow [2023-11-12 02:34:35,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 72.28571428571429) internal successors, (1518), 21 states have internal predecessors, (1518), 0 states have call successors, (0), 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-12 02:34:35,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:34:35,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:34:35,365 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-12 02:34:35,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:34:35,564 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-12 02:34:35,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:34:35,564 INFO L85 PathProgramCache]: Analyzing trace with hash 354729645, now seen corresponding path program 2 times [2023-11-12 02:34:35,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:34:35,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4234709] [2023-11-12 02:34:35,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:34:35,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:34:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:34:35,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:34:35,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:34:35,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4234709] [2023-11-12 02:34:35,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4234709] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:34:35,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826122204] [2023-11-12 02:34:35,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-12 02:34:35,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:34:35,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:34:35,918 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:34:35,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad07a158-399b-44f5-8f46-9fb11cda8795/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-12 02:34:36,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-12 02:34:36,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:34:36,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-12 02:34:36,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:34:36,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:34:36,160 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:34:36,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:34:36,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826122204] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:34:36,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:34:36,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 8] total 14 [2023-11-12 02:34:36,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293303737] [2023-11-12 02:34:36,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:34:36,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-12 02:34:36,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:34:36,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-12 02:34:36,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2023-11-12 02:34:36,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 163 [2023-11-12 02:34:36,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 889 transitions, 15253 flow. Second operand has 15 states, 15 states have (on average 72.6) internal successors, (1089), 15 states have internal predecessors, (1089), 0 states have call successors, (0), 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-12 02:34:36,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:34:36,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 163 [2023-11-12 02:34:36,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand