./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB --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 4eda2bf92bccdcc8638b67653fb7fdefc015ff9c815b317ad1009deb61d04585 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 04:01:46,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:01:46,652 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 04:01:46,660 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:01:46,660 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:01:46,710 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:01:46,710 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:01:46,710 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:01:46,711 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 04:01:46,711 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 04:01:46,711 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:01:46,711 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:01:46,712 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:01:46,713 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:01:46,714 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:01:46,714 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:01:46,714 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 04:01:46,715 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 04:01:46,715 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 04:01:46,715 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 04:01:46,715 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:01:46,715 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 04:01:46,715 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:01:46,716 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 04:01:46,716 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 04:01:46,716 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 04:01:46,716 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:01:46,716 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:01:46,716 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:01:46,716 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:01:46,717 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:01:46,717 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:01:46,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:01:46,717 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:01:46,717 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:01:46,718 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:01:46,718 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:01:46,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:01:46,718 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:01:46,718 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:01:46,718 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 04:01:46,718 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 04:01:46,718 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 04:01:46,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 04:01:46,719 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:01:46,719 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:01:46,719 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:01:46,719 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:01:46,719 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 4eda2bf92bccdcc8638b67653fb7fdefc015ff9c815b317ad1009deb61d04585 [2024-11-28 04:01:47,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:01:47,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:01:47,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:01:47,079 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:01:47,080 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:01:47,081 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c [2024-11-28 04:01:50,348 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/data/053aa791a/a07b46065b8343ae88fa4506748eadd6/FLAG5aa93b462 [2024-11-28 04:01:50,615 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:01:50,616 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/sv-benchmarks/c/weaver/popl20-send-receive.wvr.c [2024-11-28 04:01:50,625 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/data/053aa791a/a07b46065b8343ae88fa4506748eadd6/FLAG5aa93b462 [2024-11-28 04:01:50,913 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/data/053aa791a/a07b46065b8343ae88fa4506748eadd6 [2024-11-28 04:01:50,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:01:50,917 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:01:50,919 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:01:50,919 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:01:50,924 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:01:50,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:01:50" (1/1) ... [2024-11-28 04:01:50,926 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8766aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:01:50, skipping insertion in model container [2024-11-28 04:01:50,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:01:50" (1/1) ... [2024-11-28 04:01:50,947 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:01:51,198 WARN L250 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_b9de0272-e83b-4934-a863-d2fa7268bd12/sv-benchmarks/c/weaver/popl20-send-receive.wvr.c[3146,3159] [2024-11-28 04:01:51,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:01:51,235 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 04:01:51,277 WARN L250 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_b9de0272-e83b-4934-a863-d2fa7268bd12/sv-benchmarks/c/weaver/popl20-send-receive.wvr.c[3146,3159] [2024-11-28 04:01:51,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:01:51,308 INFO L204 MainTranslator]: Completed translation [2024-11-28 04:01:51,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:01:51 WrapperNode [2024-11-28 04:01:51,311 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:01:51,313 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 04:01:51,313 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 04:01:51,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 04:01:51,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:01:51" (1/1) ... [2024-11-28 04:01:51,342 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:01:51" (1/1) ... [2024-11-28 04:01:51,374 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 145 [2024-11-28 04:01:51,375 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 04:01:51,375 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 04:01:51,376 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 04:01:51,376 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 04:01:51,387 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:01:51" (1/1) ... [2024-11-28 04:01:51,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:01:51" (1/1) ... [2024-11-28 04:01:51,391 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:01:51" (1/1) ... [2024-11-28 04:01:51,408 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-28 04:01:51,409 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:01:51" (1/1) ... [2024-11-28 04:01:51,409 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:01:51" (1/1) ... [2024-11-28 04:01:51,417 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:01:51" (1/1) ... [2024-11-28 04:01:51,418 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:01:51" (1/1) ... [2024-11-28 04:01:51,422 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:01:51" (1/1) ... [2024-11-28 04:01:51,423 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:01:51" (1/1) ... [2024-11-28 04:01:51,424 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:01:51" (1/1) ... [2024-11-28 04:01:51,427 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 04:01:51,428 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 04:01:51,428 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 04:01:51,428 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 04:01:51,429 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:01:51" (1/1) ... [2024-11-28 04:01:51,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:01:51,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:01:51,468 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 04:01:51,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 04:01:51,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 04:01:51,505 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-28 04:01:51,505 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-28 04:01:51,505 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-28 04:01:51,505 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-28 04:01:51,505 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-28 04:01:51,505 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-28 04:01:51,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 04:01:51,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 04:01:51,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 04:01:51,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 04:01:51,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-28 04:01:51,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-28 04:01:51,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 04:01:51,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 04:01:51,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 04:01:51,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 04:01:51,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 04:01:51,510 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 04:01:51,658 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 04:01:51,660 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 04:01:52,007 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 04:01:52,007 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 04:01:52,257 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 04:01:52,257 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-28 04:01:52,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:01:52 BoogieIcfgContainer [2024-11-28 04:01:52,258 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 04:01:52,260 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 04:01:52,261 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 04:01:52,272 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 04:01:52,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:01:50" (1/3) ... [2024-11-28 04:01:52,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ff4156d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:01:52, skipping insertion in model container [2024-11-28 04:01:52,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:01:51" (2/3) ... [2024-11-28 04:01:52,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ff4156d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:01:52, skipping insertion in model container [2024-11-28 04:01:52,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:01:52" (3/3) ... [2024-11-28 04:01:52,276 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2024-11-28 04:01:52,298 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 04:01:52,300 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-send-receive.wvr.c that has 4 procedures, 33 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2024-11-28 04:01:52,300 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 04:01:52,417 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-28 04:01:52,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 93 flow [2024-11-28 04:01:52,508 INFO L124 PetriNetUnfolderBase]: 4/33 cut-off events. [2024-11-28 04:01:52,511 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-28 04:01:52,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 33 events. 4/33 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2024-11-28 04:01:52,516 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 36 transitions, 93 flow [2024-11-28 04:01:52,520 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 32 transitions, 82 flow [2024-11-28 04:01:52,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 04:01:52,544 INFO L333 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, 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;@4a7fee6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 04:01:52,545 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-28 04:01:52,568 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 04:01:52,568 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2024-11-28 04:01:52,568 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-28 04:01:52,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:01:52,570 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:01:52,570 INFO L396 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)] === [2024-11-28 04:01:52,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:01:52,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1003524919, now seen corresponding path program 1 times [2024-11-28 04:01:52,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:01:52,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017050436] [2024-11-28 04:01:52,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:01:52,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:01:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:01:53,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:01:53,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:01:53,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017050436] [2024-11-28 04:01:53,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017050436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:01:53,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:01:53,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:01:53,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357981855] [2024-11-28 04:01:53,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:01:53,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:01:53,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:01:53,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:01:53,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:01:53,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-11-28 04:01:53,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:01:53,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:01:53,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-11-28 04:01:53,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:01:54,315 INFO L124 PetriNetUnfolderBase]: 487/825 cut-off events. [2024-11-28 04:01:54,315 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-11-28 04:01:54,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1622 conditions, 825 events. 487/825 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3982 event pairs, 54 based on Foata normal form. 84/853 useless extension candidates. Maximal degree in co-relation 1551. Up to 280 conditions per place. [2024-11-28 04:01:54,326 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 53 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2024-11-28 04:01:54,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 66 transitions, 276 flow [2024-11-28 04:01:54,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:01:54,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 04:01:54,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2024-11-28 04:01:54,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6611111111111111 [2024-11-28 04:01:54,354 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 82 flow. Second operand 5 states and 119 transitions. [2024-11-28 04:01:54,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 66 transitions, 276 flow [2024-11-28 04:01:54,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 66 transitions, 256 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-28 04:01:54,370 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 94 flow [2024-11-28 04:01:54,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2024-11-28 04:01:54,379 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2024-11-28 04:01:54,379 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 94 flow [2024-11-28 04:01:54,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:01:54,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:01:54,380 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:01:54,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 04:01:54,381 INFO L396 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)] === [2024-11-28 04:01:54,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:01:54,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1083118140, now seen corresponding path program 1 times [2024-11-28 04:01:54,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:01:54,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734429080] [2024-11-28 04:01:54,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:01:54,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:01:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:01:54,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:01:54,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:01:54,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734429080] [2024-11-28 04:01:54,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734429080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:01:54,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:01:54,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:01:54,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729115176] [2024-11-28 04:01:54,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:01:54,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:01:54,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:01:54,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:01:54,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:01:54,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 36 [2024-11-28 04:01:54,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:01:54,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:01:54,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 36 [2024-11-28 04:01:54,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:01:54,714 INFO L124 PetriNetUnfolderBase]: 190/380 cut-off events. [2024-11-28 04:01:54,714 INFO L125 PetriNetUnfolderBase]: For 347/444 co-relation queries the response was YES. [2024-11-28 04:01:54,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 380 events. 190/380 cut-off events. For 347/444 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1586 event pairs, 61 based on Foata normal form. 115/446 useless extension candidates. Maximal degree in co-relation 254. Up to 240 conditions per place. [2024-11-28 04:01:54,722 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 24 selfloop transitions, 3 changer transitions 2/42 dead transitions. [2024-11-28 04:01:54,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 169 flow [2024-11-28 04:01:54,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:01:54,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:01:54,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-11-28 04:01:54,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2024-11-28 04:01:54,724 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 94 flow. Second operand 3 states and 74 transitions. [2024-11-28 04:01:54,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 169 flow [2024-11-28 04:01:54,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 42 transitions, 165 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:01:54,727 INFO L231 Difference]: Finished difference. Result has 39 places, 36 transitions, 109 flow [2024-11-28 04:01:54,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=39, PETRI_TRANSITIONS=36} [2024-11-28 04:01:54,728 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2024-11-28 04:01:54,728 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 109 flow [2024-11-28 04:01:54,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:01:54,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:01:54,728 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:01:54,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 04:01:54,729 INFO L396 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)] === [2024-11-28 04:01:54,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:01:54,729 INFO L85 PathProgramCache]: Analyzing trace with hash 382705019, now seen corresponding path program 1 times [2024-11-28 04:01:54,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:01:54,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408655842] [2024-11-28 04:01:54,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:01:54,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:01:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:01:55,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:01:55,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:01:55,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408655842] [2024-11-28 04:01:55,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408655842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:01:55,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:01:55,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:01:55,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005348134] [2024-11-28 04:01:55,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:01:55,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:01:55,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:01:55,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:01:55,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:01:55,089 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 36 [2024-11-28 04:01:55,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:01:55,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:01:55,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 36 [2024-11-28 04:01:55,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:01:55,288 INFO L124 PetriNetUnfolderBase]: 203/405 cut-off events. [2024-11-28 04:01:55,288 INFO L125 PetriNetUnfolderBase]: For 409/547 co-relation queries the response was YES. [2024-11-28 04:01:55,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 963 conditions, 405 events. 203/405 cut-off events. For 409/547 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1741 event pairs, 122 based on Foata normal form. 128/477 useless extension candidates. Maximal degree in co-relation 702. Up to 288 conditions per place. [2024-11-28 04:01:55,292 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 22 selfloop transitions, 2 changer transitions 10/47 dead transitions. [2024-11-28 04:01:55,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 202 flow [2024-11-28 04:01:55,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:01:55,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 04:01:55,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2024-11-28 04:01:55,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2024-11-28 04:01:55,295 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 109 flow. Second operand 4 states and 92 transitions. [2024-11-28 04:01:55,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 202 flow [2024-11-28 04:01:55,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 199 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 04:01:55,298 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 120 flow [2024-11-28 04:01:55,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2024-11-28 04:01:55,302 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2024-11-28 04:01:55,302 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 120 flow [2024-11-28 04:01:55,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:01:55,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:01:55,303 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:01:55,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 04:01:55,303 INFO L396 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)] === [2024-11-28 04:01:55,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:01:55,304 INFO L85 PathProgramCache]: Analyzing trace with hash -628131849, now seen corresponding path program 1 times [2024-11-28 04:01:55,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:01:55,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509502619] [2024-11-28 04:01:55,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:01:55,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:01:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:01:55,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:01:55,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:01:55,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509502619] [2024-11-28 04:01:55,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509502619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:01:55,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:01:55,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:01:55,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260328840] [2024-11-28 04:01:55,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:01:55,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:01:55,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:01:55,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:01:55,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:01:55,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-11-28 04:01:55,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:01:55,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:01:55,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-11-28 04:01:55,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:01:55,883 INFO L124 PetriNetUnfolderBase]: 406/748 cut-off events. [2024-11-28 04:01:55,883 INFO L125 PetriNetUnfolderBase]: For 631/798 co-relation queries the response was YES. [2024-11-28 04:01:55,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1815 conditions, 748 events. 406/748 cut-off events. For 631/798 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3315 event pairs, 60 based on Foata normal form. 201/916 useless extension candidates. Maximal degree in co-relation 1799. Up to 301 conditions per place. [2024-11-28 04:01:55,889 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 41 selfloop transitions, 4 changer transitions 10/64 dead transitions. [2024-11-28 04:01:55,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 64 transitions, 328 flow [2024-11-28 04:01:55,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:01:55,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 04:01:55,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2024-11-28 04:01:55,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2024-11-28 04:01:55,892 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 120 flow. Second operand 5 states and 106 transitions. [2024-11-28 04:01:55,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 64 transitions, 328 flow [2024-11-28 04:01:55,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 64 transitions, 318 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-11-28 04:01:55,900 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 130 flow [2024-11-28 04:01:55,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=130, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2024-11-28 04:01:55,902 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2024-11-28 04:01:55,902 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 130 flow [2024-11-28 04:01:55,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:01:55,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:01:55,903 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:01:55,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 04:01:55,903 INFO L396 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)] === [2024-11-28 04:01:55,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:01:55,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1795998113, now seen corresponding path program 2 times [2024-11-28 04:01:55,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:01:55,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226364700] [2024-11-28 04:01:55,904 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:01:55,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:01:55,976 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 04:01:55,976 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:01:56,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:01:56,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:01:56,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226364700] [2024-11-28 04:01:56,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226364700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:01:56,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:01:56,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:01:56,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456625808] [2024-11-28 04:01:56,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:01:56,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:01:56,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:01:56,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:01:56,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:01:56,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-11-28 04:01:56,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 130 flow. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:01:56,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:01:56,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-11-28 04:01:56,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:01:57,157 INFO L124 PetriNetUnfolderBase]: 603/1049 cut-off events. [2024-11-28 04:01:57,157 INFO L125 PetriNetUnfolderBase]: For 715/725 co-relation queries the response was YES. [2024-11-28 04:01:57,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2548 conditions, 1049 events. 603/1049 cut-off events. For 715/725 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4903 event pairs, 103 based on Foata normal form. 58/1050 useless extension candidates. Maximal degree in co-relation 2526. Up to 277 conditions per place. [2024-11-28 04:01:57,168 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 63 selfloop transitions, 12 changer transitions 5/90 dead transitions. [2024-11-28 04:01:57,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 90 transitions, 455 flow [2024-11-28 04:01:57,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:01:57,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-28 04:01:57,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 188 transitions. [2024-11-28 04:01:57,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5802469135802469 [2024-11-28 04:01:57,171 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 130 flow. Second operand 9 states and 188 transitions. [2024-11-28 04:01:57,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 90 transitions, 455 flow [2024-11-28 04:01:57,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 90 transitions, 448 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-28 04:01:57,175 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 190 flow [2024-11-28 04:01:57,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=190, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2024-11-28 04:01:57,176 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2024-11-28 04:01:57,176 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 190 flow [2024-11-28 04:01:57,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:01:57,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:01:57,176 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:01:57,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 04:01:57,176 INFO L396 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)] === [2024-11-28 04:01:57,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:01:57,177 INFO L85 PathProgramCache]: Analyzing trace with hash 548123407, now seen corresponding path program 1 times [2024-11-28 04:01:57,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:01:57,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674531890] [2024-11-28 04:01:57,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:01:57,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:01:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:01:57,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:01:57,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:01:57,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674531890] [2024-11-28 04:01:57,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674531890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:01:57,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:01:57,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:01:57,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399915017] [2024-11-28 04:01:57,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:01:57,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:01:57,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:01:57,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:01:57,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:01:57,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2024-11-28 04:01:57,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:01:57,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:01:57,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2024-11-28 04:01:57,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:01:57,455 INFO L124 PetriNetUnfolderBase]: 371/640 cut-off events. [2024-11-28 04:01:57,455 INFO L125 PetriNetUnfolderBase]: For 1079/1102 co-relation queries the response was YES. [2024-11-28 04:01:57,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1832 conditions, 640 events. 371/640 cut-off events. For 1079/1102 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2675 event pairs, 122 based on Foata normal form. 27/633 useless extension candidates. Maximal degree in co-relation 1808. Up to 498 conditions per place. [2024-11-28 04:01:57,460 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 36 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2024-11-28 04:01:57,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 50 transitions, 285 flow [2024-11-28 04:01:57,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:01:57,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:01:57,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2024-11-28 04:01:57,462 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-28 04:01:57,463 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 190 flow. Second operand 3 states and 72 transitions. [2024-11-28 04:01:57,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 50 transitions, 285 flow [2024-11-28 04:01:57,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 262 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-11-28 04:01:57,470 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 154 flow [2024-11-28 04:01:57,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2024-11-28 04:01:57,471 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places. [2024-11-28 04:01:57,471 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 154 flow [2024-11-28 04:01:57,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:01:57,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:01:57,472 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:01:57,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 04:01:57,474 INFO L396 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)] === [2024-11-28 04:01:57,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:01:57,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1900997826, now seen corresponding path program 3 times [2024-11-28 04:01:57,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:01:57,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260080957] [2024-11-28 04:01:57,475 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 04:01:57,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:01:57,502 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-28 04:01:57,503 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:01:57,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 04:01:57,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:01:57,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260080957] [2024-11-28 04:01:57,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260080957] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:01:57,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962143334] [2024-11-28 04:01:57,701 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 04:01:57,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:01:57,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:01:57,705 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:01:57,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 04:01:57,802 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-28 04:01:57,802 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:01:57,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-28 04:01:57,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:01:57,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 04:01:57,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:01:58,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 04:01:58,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962143334] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:01:58,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:01:58,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 8 [2024-11-28 04:01:58,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752355088] [2024-11-28 04:01:58,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:01:58,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 04:01:58,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:01:58,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 04:01:58,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-28 04:01:58,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-11-28 04:01:58,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 154 flow. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:01:58,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:01:58,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-11-28 04:01:58,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:01:58,774 INFO L124 PetriNetUnfolderBase]: 1541/2343 cut-off events. [2024-11-28 04:01:58,775 INFO L125 PetriNetUnfolderBase]: For 1767/1776 co-relation queries the response was YES. [2024-11-28 04:01:58,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6270 conditions, 2343 events. 1541/2343 cut-off events. For 1767/1776 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10243 event pairs, 135 based on Foata normal form. 64/2383 useless extension candidates. Maximal degree in co-relation 6247. Up to 546 conditions per place. [2024-11-28 04:01:58,790 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 96 selfloop transitions, 23 changer transitions 0/125 dead transitions. [2024-11-28 04:01:58,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 125 transitions, 681 flow [2024-11-28 04:01:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 04:01:58,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-28 04:01:58,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 199 transitions. [2024-11-28 04:01:58,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5025252525252525 [2024-11-28 04:01:58,792 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 154 flow. Second operand 11 states and 199 transitions. [2024-11-28 04:01:58,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 125 transitions, 681 flow [2024-11-28 04:01:58,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 125 transitions, 674 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 04:01:58,799 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 327 flow [2024-11-28 04:01:58,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=327, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2024-11-28 04:01:58,801 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 28 predicate places. [2024-11-28 04:01:58,802 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 327 flow [2024-11-28 04:01:58,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:01:58,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:01:58,803 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:01:58,813 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 04:01:59,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-28 04:01:59,004 INFO L396 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)] === [2024-11-28 04:01:59,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:01:59,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1636016190, now seen corresponding path program 4 times [2024-11-28 04:01:59,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:01:59,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525023468] [2024-11-28 04:01:59,006 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 04:01:59,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:01:59,032 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 04:01:59,032 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:01:59,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:01:59,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:01:59,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525023468] [2024-11-28 04:01:59,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525023468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:01:59,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:01:59,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:01:59,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511505493] [2024-11-28 04:01:59,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:01:59,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:01:59,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:01:59,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:01:59,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:01:59,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 36 [2024-11-28 04:01:59,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 327 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:01:59,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:01:59,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 36 [2024-11-28 04:01:59,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:01:59,669 INFO L124 PetriNetUnfolderBase]: 1410/2652 cut-off events. [2024-11-28 04:01:59,670 INFO L125 PetriNetUnfolderBase]: For 5712/5789 co-relation queries the response was YES. [2024-11-28 04:01:59,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8259 conditions, 2652 events. 1410/2652 cut-off events. For 5712/5789 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 16682 event pairs, 447 based on Foata normal form. 86/2512 useless extension candidates. Maximal degree in co-relation 8228. Up to 814 conditions per place. [2024-11-28 04:01:59,704 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 43 selfloop transitions, 10 changer transitions 0/85 dead transitions. [2024-11-28 04:01:59,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 85 transitions, 526 flow [2024-11-28 04:01:59,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:01:59,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 04:01:59,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2024-11-28 04:01:59,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7361111111111112 [2024-11-28 04:01:59,706 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 327 flow. Second operand 4 states and 106 transitions. [2024-11-28 04:01:59,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 85 transitions, 526 flow [2024-11-28 04:01:59,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 85 transitions, 508 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-28 04:01:59,720 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 377 flow [2024-11-28 04:01:59,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=377, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2024-11-28 04:01:59,721 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 30 predicate places. [2024-11-28 04:01:59,721 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 377 flow [2024-11-28 04:01:59,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:01:59,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:01:59,721 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:01:59,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 04:01:59,722 INFO L396 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)] === [2024-11-28 04:01:59,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:01:59,723 INFO L85 PathProgramCache]: Analyzing trace with hash 976062485, now seen corresponding path program 5 times [2024-11-28 04:01:59,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:01:59,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463405362] [2024-11-28 04:01:59,723 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 04:01:59,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:01:59,761 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-11-28 04:01:59,761 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:01:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:01:59,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:01:59,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463405362] [2024-11-28 04:01:59,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463405362] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:01:59,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487274946] [2024-11-28 04:01:59,974 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 04:01:59,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:01:59,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:01:59,976 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:01:59,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 04:02:00,110 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-11-28 04:02:00,110 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:02:00,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-28 04:02:00,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:02:00,259 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:02:00,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:02:00,410 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:02:00,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487274946] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:02:00,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:02:00,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-28 04:02:00,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689112589] [2024-11-28 04:02:00,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:02:00,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 04:02:00,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:02:00,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 04:02:00,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-28 04:02:00,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 36 [2024-11-28 04:02:00,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 377 flow. Second operand has 12 states, 12 states have (on average 17.666666666666668) internal successors, (212), 12 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:02:00,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:02:00,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 36 [2024-11-28 04:02:00,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:02:01,101 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L86-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_5| 256) 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_5|} OutVars{thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_5|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset][82], [Black: 92#(and (<= 0 ~sum~0) (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0) (<= ~sum~0 1)), 322#(<= ~back~0 (+ ~front~0 1)), Black: 64#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 321#(<= ~back~0 ~front~0), Black: 101#(= |thread2Thread1of1ForFork0_~b~0#1| 1), 16#thread1EXITtrue, Black: 73#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~v_assert~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 71#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), 325#true, 34#L112-4true, 25#thread3EXITtrue, Black: 53#(and (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0) (= ~sum~0 0)), Black: 55#(and (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0)), Black: 309#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))), 103#true, Black: 174#(= |thread1Thread1of1ForFork2_~cond~0#1| 1), 19#thread2EXITtrue, Black: 311#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 60#(<= ~back~0 ~front~0), Black: 261#(or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))]) [2024-11-28 04:02:01,105 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-28 04:02:01,105 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-28 04:02:01,105 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-28 04:02:01,105 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-28 04:02:01,106 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([404] L86-->L72: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_3| 256) 0)) (not (= 0 (ite (and (< v_~back~0_97 v_~n~0_54) (<= 0 v_~back~0_97)) 1 0)))) InVars {~back~0=v_~back~0_97, ~n~0=v_~n~0_54, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_3|} OutVars{~back~0=v_~back~0_97, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n~0=v_~n~0_54, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][28], [Black: 92#(and (<= 0 ~sum~0) (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0) (<= ~sum~0 1)), 322#(<= ~back~0 (+ ~front~0 1)), 8#L72true, Black: 64#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 321#(<= ~back~0 ~front~0), Black: 101#(= |thread2Thread1of1ForFork0_~b~0#1| 1), 16#thread1EXITtrue, Black: 73#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~v_assert~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 71#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), 325#true, 34#L112-4true, 25#thread3EXITtrue, Black: 53#(and (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0) (= ~sum~0 0)), Black: 55#(and (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0)), Black: 309#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))), 103#true, Black: 174#(= |thread1Thread1of1ForFork2_~cond~0#1| 1), Black: 311#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 60#(<= ~back~0 ~front~0), Black: 261#(or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))]) [2024-11-28 04:02:01,106 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-28 04:02:01,106 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-28 04:02:01,106 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-28 04:02:01,106 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-28 04:02:01,145 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L86-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_5| 256) 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_5|} OutVars{thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_5|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset][82], [Black: 92#(and (<= 0 ~sum~0) (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0) (<= ~sum~0 1)), 322#(<= ~back~0 (+ ~front~0 1)), Black: 64#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 321#(<= ~back~0 ~front~0), Black: 101#(= |thread2Thread1of1ForFork0_~b~0#1| 1), 16#thread1EXITtrue, Black: 73#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~v_assert~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 71#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), 325#true, 25#thread3EXITtrue, Black: 53#(and (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0) (= ~sum~0 0)), Black: 55#(and (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0)), Black: 309#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))), 11#L113true, 103#true, Black: 174#(= |thread1Thread1of1ForFork2_~cond~0#1| 1), 19#thread2EXITtrue, Black: 311#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 60#(<= ~back~0 ~front~0), Black: 261#(or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))]) [2024-11-28 04:02:01,145 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-11-28 04:02:01,145 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-28 04:02:01,145 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-28 04:02:01,145 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-28 04:02:01,146 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([404] L86-->L72: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_3| 256) 0)) (not (= 0 (ite (and (< v_~back~0_97 v_~n~0_54) (<= 0 v_~back~0_97)) 1 0)))) InVars {~back~0=v_~back~0_97, ~n~0=v_~n~0_54, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_3|} OutVars{~back~0=v_~back~0_97, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n~0=v_~n~0_54, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][28], [Black: 92#(and (<= 0 ~sum~0) (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0) (<= ~sum~0 1)), 322#(<= ~back~0 (+ ~front~0 1)), 8#L72true, Black: 64#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 321#(<= ~back~0 ~front~0), Black: 101#(= |thread2Thread1of1ForFork0_~b~0#1| 1), 16#thread1EXITtrue, Black: 73#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~v_assert~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 71#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), 325#true, 25#thread3EXITtrue, Black: 53#(and (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0) (= ~sum~0 0)), Black: 55#(and (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0)), Black: 309#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))), 11#L113true, 103#true, Black: 174#(= |thread1Thread1of1ForFork2_~cond~0#1| 1), Black: 311#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 60#(<= ~back~0 ~front~0), Black: 261#(or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))]) [2024-11-28 04:02:01,146 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-11-28 04:02:01,146 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-28 04:02:01,146 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-28 04:02:01,146 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-28 04:02:01,155 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L86-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_5| 256) 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_5|} OutVars{thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_5|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset][82], [Black: 92#(and (<= 0 ~sum~0) (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0) (<= ~sum~0 1)), 18#L95true, Black: 322#(<= ~back~0 (+ ~front~0 1)), Black: 64#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 319#true, Black: 321#(<= ~back~0 ~front~0), Black: 101#(= |thread2Thread1of1ForFork0_~b~0#1| 1), 229#(< 0 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)), Black: 73#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~v_assert~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 71#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), 325#true, Black: 53#(and (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0) (= ~sum~0 0)), Black: 309#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))), Black: 55#(and (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0)), 21#L56true, 11#L113true, Black: 103#true, Black: 174#(= |thread1Thread1of1ForFork2_~cond~0#1| 1), 19#thread2EXITtrue, Black: 311#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 60#(<= ~back~0 ~front~0), Black: 261#(or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))]) [2024-11-28 04:02:01,156 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-11-28 04:02:01,156 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 04:02:01,156 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 04:02:01,156 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-28 04:02:01,157 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([404] L86-->L72: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_3| 256) 0)) (not (= 0 (ite (and (< v_~back~0_97 v_~n~0_54) (<= 0 v_~back~0_97)) 1 0)))) InVars {~back~0=v_~back~0_97, ~n~0=v_~n~0_54, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_3|} OutVars{~back~0=v_~back~0_97, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n~0=v_~n~0_54, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][28], [8#L72true, Black: 92#(and (<= 0 ~sum~0) (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0) (<= ~sum~0 1)), 18#L95true, Black: 322#(<= ~back~0 (+ ~front~0 1)), Black: 64#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 319#true, Black: 321#(<= ~back~0 ~front~0), Black: 101#(= |thread2Thread1of1ForFork0_~b~0#1| 1), 229#(< 0 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)), Black: 73#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~v_assert~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 71#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), 325#true, Black: 53#(and (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0) (= ~sum~0 0)), Black: 309#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))), Black: 55#(and (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0)), 21#L56true, 11#L113true, Black: 103#true, Black: 174#(= |thread1Thread1of1ForFork2_~cond~0#1| 1), Black: 311#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 60#(<= ~back~0 ~front~0), Black: 261#(or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))]) [2024-11-28 04:02:01,157 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-11-28 04:02:01,157 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-28 04:02:01,157 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 04:02:01,157 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 04:02:01,191 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L86-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_5| 256) 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_5|} OutVars{thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_5|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset][82], [Black: 92#(and (<= 0 ~sum~0) (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0) (<= ~sum~0 1)), Black: 322#(<= ~back~0 (+ ~front~0 1)), Black: 64#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 319#true, Black: 321#(<= ~back~0 ~front~0), Black: 101#(= |thread2Thread1of1ForFork0_~b~0#1| 1), 229#(< 0 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)), Black: 73#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~v_assert~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 71#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), 325#true, 25#thread3EXITtrue, Black: 53#(and (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0) (= ~sum~0 0)), Black: 309#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))), Black: 55#(and (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0)), 21#L56true, Black: 103#true, 11#L113true, 19#thread2EXITtrue, Black: 174#(= |thread1Thread1of1ForFork2_~cond~0#1| 1), Black: 311#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 60#(<= ~back~0 ~front~0), Black: 261#(or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))]) [2024-11-28 04:02:01,191 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-28 04:02:01,191 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-28 04:02:01,191 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-28 04:02:01,191 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-28 04:02:01,192 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([404] L86-->L72: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_3| 256) 0)) (not (= 0 (ite (and (< v_~back~0_97 v_~n~0_54) (<= 0 v_~back~0_97)) 1 0)))) InVars {~back~0=v_~back~0_97, ~n~0=v_~n~0_54, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_3|} OutVars{~back~0=v_~back~0_97, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n~0=v_~n~0_54, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][28], [Black: 92#(and (<= 0 ~sum~0) (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0) (<= ~sum~0 1)), 8#L72true, Black: 322#(<= ~back~0 (+ ~front~0 1)), Black: 64#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 319#true, Black: 321#(<= ~back~0 ~front~0), Black: 101#(= |thread2Thread1of1ForFork0_~b~0#1| 1), 229#(< 0 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)), Black: 73#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~v_assert~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 71#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), 325#true, 25#thread3EXITtrue, Black: 53#(and (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0) (= ~sum~0 0)), Black: 309#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))), Black: 55#(and (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0)), 21#L56true, Black: 103#true, 11#L113true, Black: 174#(= |thread1Thread1of1ForFork2_~cond~0#1| 1), Black: 311#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 60#(<= ~back~0 ~front~0), Black: 261#(or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))]) [2024-11-28 04:02:01,192 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-28 04:02:01,192 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-28 04:02:01,192 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-28 04:02:01,192 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-28 04:02:01,205 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([404] L86-->L72: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_3| 256) 0)) (not (= 0 (ite (and (< v_~back~0_97 v_~n~0_54) (<= 0 v_~back~0_97)) 1 0)))) InVars {~back~0=v_~back~0_97, ~n~0=v_~n~0_54, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_3|} OutVars{~back~0=v_~back~0_97, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n~0=v_~n~0_54, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][28], [Black: 92#(and (<= 0 ~sum~0) (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0) (<= ~sum~0 1)), 322#(<= ~back~0 (+ ~front~0 1)), 8#L72true, Black: 64#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 20#L113-1true, Black: 321#(<= ~back~0 ~front~0), Black: 101#(= |thread2Thread1of1ForFork0_~b~0#1| 1), Black: 73#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~v_assert~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 71#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), 325#true, 25#thread3EXITtrue, Black: 53#(and (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0) (= ~sum~0 0)), Black: 55#(and (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0)), Black: 309#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))), 103#true, Black: 174#(= |thread1Thread1of1ForFork2_~cond~0#1| 1), Black: 311#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 60#(<= ~back~0 ~front~0), Black: 261#(or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))]) [2024-11-28 04:02:01,206 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-28 04:02:01,206 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-28 04:02:01,206 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-28 04:02:01,206 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-28 04:02:01,212 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L86-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_5| 256) 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_5|} OutVars{thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_5|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset][82], [Black: 92#(and (<= 0 ~sum~0) (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0) (<= ~sum~0 1)), 322#(<= ~back~0 (+ ~front~0 1)), Black: 64#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 20#L113-1true, Black: 321#(<= ~back~0 ~front~0), Black: 101#(= |thread2Thread1of1ForFork0_~b~0#1| 1), Black: 73#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~v_assert~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 71#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), 325#true, 25#thread3EXITtrue, Black: 53#(and (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0) (= ~sum~0 0)), Black: 55#(and (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0)), Black: 309#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))), 103#true, Black: 174#(= |thread1Thread1of1ForFork2_~cond~0#1| 1), 19#thread2EXITtrue, Black: 311#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 60#(<= ~back~0 ~front~0), Black: 261#(or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))]) [2024-11-28 04:02:01,212 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-28 04:02:01,212 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-28 04:02:01,212 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-28 04:02:01,212 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-28 04:02:01,246 INFO L124 PetriNetUnfolderBase]: 2052/3894 cut-off events. [2024-11-28 04:02:01,246 INFO L125 PetriNetUnfolderBase]: For 11474/11593 co-relation queries the response was YES. [2024-11-28 04:02:01,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13703 conditions, 3894 events. 2052/3894 cut-off events. For 11474/11593 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 26060 event pairs, 1059 based on Foata normal form. 123/3618 useless extension candidates. Maximal degree in co-relation 10443. Up to 2094 conditions per place. [2024-11-28 04:02:01,291 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 62 selfloop transitions, 6 changer transitions 0/100 dead transitions. [2024-11-28 04:02:01,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 100 transitions, 708 flow [2024-11-28 04:02:01,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:02:01,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 04:02:01,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2024-11-28 04:02:01,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6342592592592593 [2024-11-28 04:02:01,294 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 377 flow. Second operand 6 states and 137 transitions. [2024-11-28 04:02:01,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 100 transitions, 708 flow [2024-11-28 04:02:01,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 100 transitions, 696 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-11-28 04:02:01,308 INFO L231 Difference]: Finished difference. Result has 76 places, 69 transitions, 431 flow [2024-11-28 04:02:01,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=431, PETRI_PLACES=76, PETRI_TRANSITIONS=69} [2024-11-28 04:02:01,309 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 38 predicate places. [2024-11-28 04:02:01,309 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 431 flow [2024-11-28 04:02:01,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 17.666666666666668) internal successors, (212), 12 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:02:01,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:02:01,310 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:02:01,321 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-28 04:02:01,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:02:01,512 INFO L396 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)] === [2024-11-28 04:02:01,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:02:01,513 INFO L85 PathProgramCache]: Analyzing trace with hash -141215751, now seen corresponding path program 6 times [2024-11-28 04:02:01,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:02:01,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739574189] [2024-11-28 04:02:01,515 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-28 04:02:01,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:02:01,540 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-11-28 04:02:01,542 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:02:01,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 04:02:01,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:02:01,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739574189] [2024-11-28 04:02:01,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739574189] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:02:01,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745362714] [2024-11-28 04:02:01,844 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-28 04:02:01,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:02:01,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:02:01,847 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:02:01,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 04:02:01,978 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-11-28 04:02:01,978 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:02:01,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 04:02:01,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:02:02,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:02:02,215 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:02:02,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:02:02,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745362714] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:02:02,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:02:02,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2024-11-28 04:02:02,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214071848] [2024-11-28 04:02:02,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:02:02,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 04:02:02,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:02:02,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 04:02:02,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-11-28 04:02:02,756 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 36 [2024-11-28 04:02:02,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 69 transitions, 431 flow. Second operand has 16 states, 16 states have (on average 18.125) internal successors, (290), 16 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:02:02,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:02:02,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 36 [2024-11-28 04:02:02,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:02:03,429 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L86-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_5| 256) 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_5|} OutVars{thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_5|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset][83], [322#(<= ~back~0 (+ ~front~0 1)), Black: 92#(and (<= 0 ~sum~0) (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0) (<= ~sum~0 1)), Black: 64#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 321#(<= ~back~0 ~front~0), Black: 101#(= |thread2Thread1of1ForFork0_~b~0#1| 1), 16#thread1EXITtrue, Black: 73#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~v_assert~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), 325#true, Black: 71#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 329#(<= ~n~0 1), Black: 338#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 378#(and (<= 1 ~back~0) (= ~n~0 1)), 34#L112-4true, 25#thread3EXITtrue, Black: 53#(and (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0) (= ~sum~0 0)), Black: 55#(and (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0)), Black: 309#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))), 103#true, Black: 174#(= |thread1Thread1of1ForFork2_~cond~0#1| 1), 19#thread2EXITtrue, 562#true, Black: 60#(<= ~back~0 ~front~0), Black: 311#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 261#(or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))]) [2024-11-28 04:02:03,429 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-28 04:02:03,429 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-28 04:02:03,429 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-28 04:02:03,430 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-28 04:02:03,430 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([404] L86-->L72: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_3| 256) 0)) (not (= 0 (ite (and (< v_~back~0_97 v_~n~0_54) (<= 0 v_~back~0_97)) 1 0)))) InVars {~back~0=v_~back~0_97, ~n~0=v_~n~0_54, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_3|} OutVars{~back~0=v_~back~0_97, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n~0=v_~n~0_54, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][52], [322#(<= ~back~0 (+ ~front~0 1)), Black: 92#(and (<= 0 ~sum~0) (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0) (<= ~sum~0 1)), 8#L72true, Black: 64#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 321#(<= ~back~0 ~front~0), Black: 101#(= |thread2Thread1of1ForFork0_~b~0#1| 1), 16#thread1EXITtrue, Black: 73#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~v_assert~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), 325#true, Black: 71#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 329#(<= ~n~0 1), Black: 338#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 34#L112-4true, Black: 378#(and (<= 1 ~back~0) (= ~n~0 1)), 25#thread3EXITtrue, Black: 53#(and (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0) (= ~sum~0 0)), Black: 55#(and (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0)), Black: 309#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))), 103#true, Black: 174#(= |thread1Thread1of1ForFork2_~cond~0#1| 1), 562#true, Black: 60#(<= ~back~0 ~front~0), Black: 311#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 261#(or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))]) [2024-11-28 04:02:03,430 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-28 04:02:03,430 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-28 04:02:03,430 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-28 04:02:03,431 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-28 04:02:03,463 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L86-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_5| 256) 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_5|} OutVars{thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_5|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset][83], [322#(<= ~back~0 (+ ~front~0 1)), Black: 92#(and (<= 0 ~sum~0) (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0) (<= ~sum~0 1)), Black: 64#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 321#(<= ~back~0 ~front~0), Black: 101#(= |thread2Thread1of1ForFork0_~b~0#1| 1), 16#thread1EXITtrue, Black: 73#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~v_assert~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), 325#true, Black: 71#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 329#(<= ~n~0 1), Black: 338#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 378#(and (<= 1 ~back~0) (= ~n~0 1)), 25#thread3EXITtrue, Black: 53#(and (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0) (= ~sum~0 0)), Black: 55#(and (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0)), Black: 309#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))), 11#L113true, 103#true, Black: 174#(= |thread1Thread1of1ForFork2_~cond~0#1| 1), 19#thread2EXITtrue, 562#true, Black: 60#(<= ~back~0 ~front~0), Black: 311#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 261#(or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))]) [2024-11-28 04:02:03,463 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-11-28 04:02:03,463 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-28 04:02:03,463 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-28 04:02:03,463 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-28 04:02:03,464 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([404] L86-->L72: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_3| 256) 0)) (not (= 0 (ite (and (< v_~back~0_97 v_~n~0_54) (<= 0 v_~back~0_97)) 1 0)))) InVars {~back~0=v_~back~0_97, ~n~0=v_~n~0_54, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_3|} OutVars{~back~0=v_~back~0_97, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n~0=v_~n~0_54, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][52], [322#(<= ~back~0 (+ ~front~0 1)), Black: 92#(and (<= 0 ~sum~0) (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0) (<= ~sum~0 1)), 8#L72true, Black: 64#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 321#(<= ~back~0 ~front~0), Black: 101#(= |thread2Thread1of1ForFork0_~b~0#1| 1), 16#thread1EXITtrue, Black: 73#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~v_assert~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 71#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), 325#true, Black: 329#(<= ~n~0 1), Black: 338#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 378#(and (<= 1 ~back~0) (= ~n~0 1)), 25#thread3EXITtrue, Black: 53#(and (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0) (= ~sum~0 0)), Black: 55#(and (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0)), Black: 309#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))), 11#L113true, 103#true, Black: 174#(= |thread1Thread1of1ForFork2_~cond~0#1| 1), 562#true, Black: 60#(<= ~back~0 ~front~0), Black: 311#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 261#(or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))]) [2024-11-28 04:02:03,464 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-11-28 04:02:03,464 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-28 04:02:03,464 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-28 04:02:03,464 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-28 04:02:03,558 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([404] L86-->L72: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_3| 256) 0)) (not (= 0 (ite (and (< v_~back~0_97 v_~n~0_54) (<= 0 v_~back~0_97)) 1 0)))) InVars {~back~0=v_~back~0_97, ~n~0=v_~n~0_54, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_3|} OutVars{~back~0=v_~back~0_97, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n~0=v_~n~0_54, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][52], [322#(<= ~back~0 (+ ~front~0 1)), Black: 92#(and (<= 0 ~sum~0) (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0) (<= ~sum~0 1)), 8#L72true, Black: 64#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 321#(<= ~back~0 ~front~0), 20#L113-1true, Black: 101#(= |thread2Thread1of1ForFork0_~b~0#1| 1), Black: 73#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~v_assert~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 71#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), 325#true, Black: 329#(<= ~n~0 1), Black: 338#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 378#(and (<= 1 ~back~0) (= ~n~0 1)), 25#thread3EXITtrue, Black: 53#(and (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0) (= ~sum~0 0)), Black: 55#(and (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0)), Black: 309#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))), 103#true, 562#true, Black: 174#(= |thread1Thread1of1ForFork2_~cond~0#1| 1), Black: 60#(<= ~back~0 ~front~0), Black: 311#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 261#(or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))]) [2024-11-28 04:02:03,558 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-28 04:02:03,558 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-28 04:02:03,558 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-28 04:02:03,558 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-28 04:02:03,561 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L86-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_5| 256) 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_5|} OutVars{thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_5|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset][83], [322#(<= ~back~0 (+ ~front~0 1)), Black: 92#(and (<= 0 ~sum~0) (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0) (<= ~sum~0 1)), Black: 64#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 321#(<= ~back~0 ~front~0), 20#L113-1true, Black: 101#(= |thread2Thread1of1ForFork0_~b~0#1| 1), Black: 73#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (= ~v_assert~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 71#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), 325#true, Black: 329#(<= ~n~0 1), Black: 338#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 378#(and (<= 1 ~back~0) (= ~n~0 1)), 25#thread3EXITtrue, Black: 53#(and (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0) (= ~sum~0 0)), Black: 55#(and (<= 1 ~v_assert~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div ~v_assert~0 256) 0)), Black: 309#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))), 103#true, 19#thread2EXITtrue, 562#true, Black: 174#(= |thread1Thread1of1ForFork2_~cond~0#1| 1), Black: 60#(<= ~back~0 ~front~0), Black: 311#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 261#(or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))]) [2024-11-28 04:02:03,562 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-28 04:02:03,562 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-28 04:02:03,562 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-28 04:02:03,562 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-28 04:02:03,629 INFO L124 PetriNetUnfolderBase]: 1699/3249 cut-off events. [2024-11-28 04:02:03,629 INFO L125 PetriNetUnfolderBase]: For 9492/9613 co-relation queries the response was YES. [2024-11-28 04:02:03,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11426 conditions, 3249 events. 1699/3249 cut-off events. For 9492/9613 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 20223 event pairs, 537 based on Foata normal form. 58/3037 useless extension candidates. Maximal degree in co-relation 10523. Up to 1999 conditions per place. [2024-11-28 04:02:03,673 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 33 selfloop transitions, 5 changer transitions 28/98 dead transitions. [2024-11-28 04:02:03,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 98 transitions, 668 flow [2024-11-28 04:02:03,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:02:03,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-28 04:02:03,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions. [2024-11-28 04:02:03,675 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2024-11-28 04:02:03,675 INFO L175 Difference]: Start difference. First operand has 76 places, 69 transitions, 431 flow. Second operand 9 states and 186 transitions. [2024-11-28 04:02:03,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 98 transitions, 668 flow [2024-11-28 04:02:03,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 98 transitions, 658 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-28 04:02:03,692 INFO L231 Difference]: Finished difference. Result has 86 places, 66 transitions, 409 flow [2024-11-28 04:02:03,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=409, PETRI_PLACES=86, PETRI_TRANSITIONS=66} [2024-11-28 04:02:03,693 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 48 predicate places. [2024-11-28 04:02:03,693 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 66 transitions, 409 flow [2024-11-28 04:02:03,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 18.125) internal successors, (290), 16 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:02:03,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:02:03,694 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:02:03,706 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 04:02:03,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-28 04:02:03,895 INFO L396 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)] === [2024-11-28 04:02:03,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:02:03,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1778545969, now seen corresponding path program 7 times [2024-11-28 04:02:03,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:02:03,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614737819] [2024-11-28 04:02:03,897 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-28 04:02:03,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:02:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:02:04,144 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 04:02:04,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:02:04,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614737819] [2024-11-28 04:02:04,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614737819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:02:04,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:02:04,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:02:04,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560872586] [2024-11-28 04:02:04,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:02:04,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:02:04,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:02:04,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:02:04,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:02:04,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-11-28 04:02:04,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 66 transitions, 409 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:02:04,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:02:04,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-11-28 04:02:04,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:02:05,214 INFO L124 PetriNetUnfolderBase]: 3051/5353 cut-off events. [2024-11-28 04:02:05,215 INFO L125 PetriNetUnfolderBase]: For 18811/19168 co-relation queries the response was YES. [2024-11-28 04:02:05,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20177 conditions, 5353 events. 3051/5353 cut-off events. For 18811/19168 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 33642 event pairs, 811 based on Foata normal form. 442/5532 useless extension candidates. Maximal degree in co-relation 20128. Up to 2407 conditions per place. [2024-11-28 04:02:05,277 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 57 selfloop transitions, 9 changer transitions 0/86 dead transitions. [2024-11-28 04:02:05,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 86 transitions, 668 flow [2024-11-28 04:02:05,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:02:05,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 04:02:05,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2024-11-28 04:02:05,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-11-28 04:02:05,280 INFO L175 Difference]: Start difference. First operand has 86 places, 66 transitions, 409 flow. Second operand 4 states and 88 transitions. [2024-11-28 04:02:05,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 86 transitions, 668 flow [2024-11-28 04:02:05,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 86 transitions, 629 flow, removed 16 selfloop flow, removed 9 redundant places. [2024-11-28 04:02:05,314 INFO L231 Difference]: Finished difference. Result has 76 places, 67 transitions, 438 flow [2024-11-28 04:02:05,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=438, PETRI_PLACES=76, PETRI_TRANSITIONS=67} [2024-11-28 04:02:05,316 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 38 predicate places. [2024-11-28 04:02:05,316 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 67 transitions, 438 flow [2024-11-28 04:02:05,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:02:05,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:02:05,316 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:02:05,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 04:02:05,316 INFO L396 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)] === [2024-11-28 04:02:05,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:02:05,320 INFO L85 PathProgramCache]: Analyzing trace with hash -87456007, now seen corresponding path program 1 times [2024-11-28 04:02:05,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:02:05,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83652685] [2024-11-28 04:02:05,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:02:05,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:02:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:02:07,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:02:07,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:02:07,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83652685] [2024-11-28 04:02:07,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83652685] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:02:07,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155323331] [2024-11-28 04:02:07,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:02:07,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:02:07,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:02:07,577 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:02:07,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 04:02:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:02:07,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-28 04:02:07,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:02:08,702 INFO L349 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2024-11-28 04:02:08,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 17 [2024-11-28 04:02:08,830 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:02:08,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:02:09,522 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2024-11-28 04:02:09,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 60 [2024-11-28 04:02:11,374 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:02:11,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155323331] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:02:11,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:02:11,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 40 [2024-11-28 04:02:11,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687496417] [2024-11-28 04:02:11,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:02:11,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-28 04:02:11,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:02:11,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-28 04:02:11,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1430, Unknown=0, NotChecked=0, Total=1640 [2024-11-28 04:02:11,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-11-28 04:02:11,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 67 transitions, 438 flow. Second operand has 41 states, 41 states have (on average 10.121951219512194) internal successors, (415), 41 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:02:11,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:02:11,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-11-28 04:02:11,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:02:34,214 INFO L124 PetriNetUnfolderBase]: 46845/72615 cut-off events. [2024-11-28 04:02:34,214 INFO L125 PetriNetUnfolderBase]: For 228573/228913 co-relation queries the response was YES. [2024-11-28 04:02:34,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266237 conditions, 72615 events. 46845/72615 cut-off events. For 228573/228913 co-relation queries the response was YES. Maximal size of possible extension queue 1462. Compared 529187 event pairs, 2390 based on Foata normal form. 1930/74325 useless extension candidates. Maximal degree in co-relation 237662. Up to 10600 conditions per place. [2024-11-28 04:02:34,580 INFO L140 encePairwiseOnDemand]: 21/36 looper letters, 1000 selfloop transitions, 504 changer transitions 348/1858 dead transitions. [2024-11-28 04:02:34,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 1858 transitions, 14998 flow [2024-11-28 04:02:34,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2024-11-28 04:02:34,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2024-11-28 04:02:34,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 2503 transitions. [2024-11-28 04:02:34,597 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49662698412698414 [2024-11-28 04:02:34,598 INFO L175 Difference]: Start difference. First operand has 76 places, 67 transitions, 438 flow. Second operand 140 states and 2503 transitions. [2024-11-28 04:02:34,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 1858 transitions, 14998 flow [2024-11-28 04:02:35,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 1858 transitions, 14484 flow, removed 255 selfloop flow, removed 1 redundant places. [2024-11-28 04:02:35,047 INFO L231 Difference]: Finished difference. Result has 290 places, 610 transitions, 5927 flow [2024-11-28 04:02:35,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=140, PETRI_FLOW=5927, PETRI_PLACES=290, PETRI_TRANSITIONS=610} [2024-11-28 04:02:35,048 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 252 predicate places. [2024-11-28 04:02:35,048 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 610 transitions, 5927 flow [2024-11-28 04:02:35,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 10.121951219512194) internal successors, (415), 41 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:02:35,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:02:35,049 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:02:35,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-28 04:02:35,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-28 04:02:35,253 INFO L396 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)] === [2024-11-28 04:02:35,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:02:35,254 INFO L85 PathProgramCache]: Analyzing trace with hash -896635447, now seen corresponding path program 2 times [2024-11-28 04:02:35,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:02:35,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032046969] [2024-11-28 04:02:35,254 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:02:35,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:02:35,295 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:02:35,296 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:02:37,053 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:02:37,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:02:37,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032046969] [2024-11-28 04:02:37,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032046969] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:02:37,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192520753] [2024-11-28 04:02:37,054 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:02:37,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:02:37,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:02:37,056 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:02:37,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9de0272-e83b-4934-a863-d2fa7268bd12/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 04:02:37,173 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:02:37,173 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:02:37,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-28 04:02:37,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:02:37,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-28 04:02:38,207 INFO L349 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2024-11-28 04:02:38,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 17 [2024-11-28 04:02:38,283 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:02:38,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:02:40,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 104 [2024-11-28 04:02:40,611 INFO L349 Elim1Store]: treesize reduction 16, result has 64.4 percent of original size [2024-11-28 04:02:40,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 232 treesize of output 196 [2024-11-28 04:02:41,610 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:02:41,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192520753] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:02:41,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:02:41,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 16] total 42 [2024-11-28 04:02:41,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367173930] [2024-11-28 04:02:41,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:02:41,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-28 04:02:41,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:02:41,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-28 04:02:41,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=1504, Unknown=0, NotChecked=0, Total=1806 [2024-11-28 04:02:41,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2024-11-28 04:02:41,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 610 transitions, 5927 flow. Second operand has 43 states, 43 states have (on average 8.279069767441861) internal successors, (356), 43 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:02:41,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:02:41,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2024-11-28 04:02:41,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand