./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX --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 cd36b7f18dbd530fce94e0943ff58c16da276fcc41b96fdafde87c3c69036175 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:28:36,755 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:28:36,862 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 17:28:36,869 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:28:36,873 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:28:36,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:28:36,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:28:36,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:28:36,903 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:28:36,904 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:28:36,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:28:36,905 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:28:36,905 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:28:36,906 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:28:36,906 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:28:36,907 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:28:36,907 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:28:36,908 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:28:36,908 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:28:36,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:28:36,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:28:36,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:28:36,910 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:28:36,911 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:28:36,911 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:28:36,912 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:28:36,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:28:36,912 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:28:36,913 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:28:36,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:28:36,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:28:36,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:28:36,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:28:36,915 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:28:36,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:28:36,916 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:28:36,916 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:28:36,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:28:36,917 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:28:36,918 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:28:36,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:28:36,919 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:28:36,919 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX 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 -> cd36b7f18dbd530fce94e0943ff58c16da276fcc41b96fdafde87c3c69036175 [2024-11-08 17:28:37,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:28:37,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:28:37,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:28:37,216 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:28:37,217 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:28:37,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c Unable to find full path for "g++" [2024-11-08 17:28:39,318 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:28:39,566 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:28:39,566 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c [2024-11-08 17:28:39,581 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/data/f7647bee8/1c7326aa343e493399ab09452b02a776/FLAG41a71a49f [2024-11-08 17:28:39,594 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/data/f7647bee8/1c7326aa343e493399ab09452b02a776 [2024-11-08 17:28:39,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:28:39,599 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:28:39,600 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:28:39,601 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:28:39,607 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:28:39,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:28:39" (1/1) ... [2024-11-08 17:28:39,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a9b5ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:28:39, skipping insertion in model container [2024-11-08 17:28:39,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:28:39" (1/1) ... [2024-11-08 17:28:39,633 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:28:39,840 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_f196c1a7-7e6c-4044-99ff-95d56cf71f90/sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c[2368,2381] [2024-11-08 17:28:39,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:28:39,867 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:28:39,892 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_f196c1a7-7e6c-4044-99ff-95d56cf71f90/sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c[2368,2381] [2024-11-08 17:28:39,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:28:39,918 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:28:39,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:28:39 WrapperNode [2024-11-08 17:28:39,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:28:39,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:28:39,920 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:28:39,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:28:39,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:28:39" (1/1) ... [2024-11-08 17:28:39,936 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:28:39" (1/1) ... [2024-11-08 17:28:39,966 INFO L138 Inliner]: procedures = 22, calls = 24, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 180 [2024-11-08 17:28:39,966 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:28:39,967 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:28:39,967 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:28:39,968 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:28:39,979 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:28:39" (1/1) ... [2024-11-08 17:28:39,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:28:39" (1/1) ... [2024-11-08 17:28:39,982 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:28:39" (1/1) ... [2024-11-08 17:28:39,998 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-08 17:28:39,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:28:39" (1/1) ... [2024-11-08 17:28:39,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:28:39" (1/1) ... [2024-11-08 17:28:40,006 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:28:39" (1/1) ... [2024-11-08 17:28:40,010 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:28:39" (1/1) ... [2024-11-08 17:28:40,012 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:28:39" (1/1) ... [2024-11-08 17:28:40,014 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:28:39" (1/1) ... [2024-11-08 17:28:40,017 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:28:40,018 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:28:40,018 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:28:40,018 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:28:40,019 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:28:39" (1/1) ... [2024-11-08 17:28:40,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:28:40,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:28:40,062 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:28:40,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:28:40,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:28:40,109 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-08 17:28:40,109 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-08 17:28:40,109 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-08 17:28:40,109 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-08 17:28:40,109 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-08 17:28:40,109 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-08 17:28:40,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:28:40,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 17:28:40,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 17:28:40,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 17:28:40,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 17:28:40,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:28:40,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:28:40,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 17:28:40,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 17:28:40,114 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 17:28:40,289 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:28:40,292 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:28:40,669 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 17:28:40,670 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:28:41,125 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:28:41,126 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 17:28:41,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:28:41 BoogieIcfgContainer [2024-11-08 17:28:41,127 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:28:41,130 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:28:41,131 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:28:41,137 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:28:41,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:28:39" (1/3) ... [2024-11-08 17:28:41,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afae614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:28:41, skipping insertion in model container [2024-11-08 17:28:41,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:28:39" (2/3) ... [2024-11-08 17:28:41,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afae614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:28:41, skipping insertion in model container [2024-11-08 17:28:41,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:28:41" (3/3) ... [2024-11-08 17:28:41,143 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt.wvr.c [2024-11-08 17:28:41,161 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:28:41,161 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:28:41,161 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 17:28:41,226 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-08 17:28:41,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 43 transitions, 107 flow [2024-11-08 17:28:41,308 INFO L124 PetriNetUnfolderBase]: 8/40 cut-off events. [2024-11-08 17:28:41,309 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-08 17:28:41,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 40 events. 8/40 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2024-11-08 17:28:41,313 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 43 transitions, 107 flow [2024-11-08 17:28:41,317 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 39 transitions, 96 flow [2024-11-08 17:28:41,327 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:28:41,335 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;@331904dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:28:41,335 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-08 17:28:41,354 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 17:28:41,354 INFO L124 PetriNetUnfolderBase]: 8/38 cut-off events. [2024-11-08 17:28:41,354 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-08 17:28:41,354 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:28:41,355 INFO L204 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] [2024-11-08 17:28:41,356 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-08 17:28:41,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:28:41,362 INFO L85 PathProgramCache]: Analyzing trace with hash -772916766, now seen corresponding path program 1 times [2024-11-08 17:28:41,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:28:41,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37734740] [2024-11-08 17:28:41,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:28:41,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:28:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:28:41,769 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-08 17:28:41,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:28:41,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37734740] [2024-11-08 17:28:41,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37734740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:28:41,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:28:41,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:28:41,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053503012] [2024-11-08 17:28:41,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:28:41,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:28:41,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:28:41,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:28:41,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:28:41,836 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2024-11-08 17:28:41,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-08 17:28:41,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:28:41,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2024-11-08 17:28:41,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:28:42,270 INFO L124 PetriNetUnfolderBase]: 889/1395 cut-off events. [2024-11-08 17:28:42,271 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2024-11-08 17:28:42,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2694 conditions, 1395 events. 889/1395 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 6775 event pairs, 226 based on Foata normal form. 1/1292 useless extension candidates. Maximal degree in co-relation 2335. Up to 803 conditions per place. [2024-11-08 17:28:42,294 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 40 selfloop transitions, 4 changer transitions 1/58 dead transitions. [2024-11-08 17:28:42,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 58 transitions, 239 flow [2024-11-08 17:28:42,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:28:42,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 17:28:42,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-11-08 17:28:42,309 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7286821705426356 [2024-11-08 17:28:42,311 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 96 flow. Second operand 3 states and 94 transitions. [2024-11-08 17:28:42,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 58 transitions, 239 flow [2024-11-08 17:28:42,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 58 transitions, 217 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-08 17:28:42,327 INFO L231 Difference]: Finished difference. Result has 38 places, 42 transitions, 110 flow [2024-11-08 17:28:42,329 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=38, PETRI_TRANSITIONS=42} [2024-11-08 17:28:42,334 INFO L277 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2024-11-08 17:28:42,334 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 42 transitions, 110 flow [2024-11-08 17:28:42,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-08 17:28:42,335 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:28:42,335 INFO L204 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] [2024-11-08 17:28:42,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:28:42,335 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-08 17:28:42,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:28:42,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1932193139, now seen corresponding path program 1 times [2024-11-08 17:28:42,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:28:42,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200866838] [2024-11-08 17:28:42,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:28:42,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:28:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:28:42,588 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-08 17:28:42,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:28:42,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200866838] [2024-11-08 17:28:42,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200866838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:28:42,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:28:42,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:28:42,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780976646] [2024-11-08 17:28:42,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:28:42,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:28:42,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:28:42,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:28:42,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:28:42,640 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2024-11-08 17:28:42,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 42 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 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-08 17:28:42,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:28:42,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2024-11-08 17:28:42,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:28:43,148 INFO L124 PetriNetUnfolderBase]: 1669/2652 cut-off events. [2024-11-08 17:28:43,148 INFO L125 PetriNetUnfolderBase]: For 109/112 co-relation queries the response was YES. [2024-11-08 17:28:43,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5271 conditions, 2652 events. 1669/2652 cut-off events. For 109/112 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 14750 event pairs, 857 based on Foata normal form. 82/2561 useless extension candidates. Maximal degree in co-relation 1980. Up to 1412 conditions per place. [2024-11-08 17:28:43,175 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 58 selfloop transitions, 7 changer transitions 0/79 dead transitions. [2024-11-08 17:28:43,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 79 transitions, 324 flow [2024-11-08 17:28:43,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:28:43,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 17:28:43,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2024-11-08 17:28:43,177 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6007751937984496 [2024-11-08 17:28:43,178 INFO L175 Difference]: Start difference. First operand has 38 places, 42 transitions, 110 flow. Second operand 6 states and 155 transitions. [2024-11-08 17:28:43,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 79 transitions, 324 flow [2024-11-08 17:28:43,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 79 transitions, 320 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 17:28:43,184 INFO L231 Difference]: Finished difference. Result has 46 places, 48 transitions, 158 flow [2024-11-08 17:28:43,185 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=158, PETRI_PLACES=46, PETRI_TRANSITIONS=48} [2024-11-08 17:28:43,186 INFO L277 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2024-11-08 17:28:43,187 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 48 transitions, 158 flow [2024-11-08 17:28:43,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 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-08 17:28:43,188 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:28:43,189 INFO L204 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] [2024-11-08 17:28:43,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:28:43,189 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-08 17:28:43,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:28:43,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1397878957, now seen corresponding path program 1 times [2024-11-08 17:28:43,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:28:43,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795382458] [2024-11-08 17:28:43,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:28:43,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:28:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:28:43,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:28:43,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:28:43,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795382458] [2024-11-08 17:28:43,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795382458] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:28:43,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287394107] [2024-11-08 17:28:43,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:28:43,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:28:43,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:28:43,566 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:28:43,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:28:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:28:43,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 17:28:43,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:28:43,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:28:43,857 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:28:43,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:28:43,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287394107] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:28:43,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:28:43,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2024-11-08 17:28:43,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410217529] [2024-11-08 17:28:43,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:28:43,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 17:28:43,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:28:43,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 17:28:43,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-11-08 17:28:44,161 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-11-08 17:28:44,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 48 transitions, 158 flow. Second operand has 15 states, 15 states have (on average 11.733333333333333) internal successors, (176), 15 states have internal predecessors, (176), 0 states have call successors, (0), 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-08 17:28:44,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:28:44,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-11-08 17:28:44,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:28:45,490 INFO L124 PetriNetUnfolderBase]: 3663/5477 cut-off events. [2024-11-08 17:28:45,490 INFO L125 PetriNetUnfolderBase]: For 2066/2326 co-relation queries the response was YES. [2024-11-08 17:28:45,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12574 conditions, 5477 events. 3663/5477 cut-off events. For 2066/2326 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 30499 event pairs, 1121 based on Foata normal form. 1/4772 useless extension candidates. Maximal degree in co-relation 7771. Up to 1299 conditions per place. [2024-11-08 17:28:45,529 INFO L140 encePairwiseOnDemand]: 28/43 looper letters, 154 selfloop transitions, 30 changer transitions 0/192 dead transitions. [2024-11-08 17:28:45,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 192 transitions, 919 flow [2024-11-08 17:28:45,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 17:28:45,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-08 17:28:45,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 328 transitions. [2024-11-08 17:28:45,532 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47674418604651164 [2024-11-08 17:28:45,532 INFO L175 Difference]: Start difference. First operand has 46 places, 48 transitions, 158 flow. Second operand 16 states and 328 transitions. [2024-11-08 17:28:45,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 192 transitions, 919 flow [2024-11-08 17:28:45,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 192 transitions, 917 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 17:28:45,538 INFO L231 Difference]: Finished difference. Result has 70 places, 72 transitions, 343 flow [2024-11-08 17:28:45,538 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=343, PETRI_PLACES=70, PETRI_TRANSITIONS=72} [2024-11-08 17:28:45,539 INFO L277 CegarLoopForPetriNet]: 41 programPoint places, 29 predicate places. [2024-11-08 17:28:45,539 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 72 transitions, 343 flow [2024-11-08 17:28:45,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.733333333333333) internal successors, (176), 15 states have internal predecessors, (176), 0 states have call successors, (0), 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-08 17:28:45,540 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:28:45,540 INFO L204 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] [2024-11-08 17:28:45,563 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 17:28:45,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:28:45,745 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-08 17:28:45,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:28:45,747 INFO L85 PathProgramCache]: Analyzing trace with hash -30649527, now seen corresponding path program 2 times [2024-11-08 17:28:45,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:28:45,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549015866] [2024-11-08 17:28:45,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:28:45,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:28:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:28:45,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 17:28:45,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:28:45,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549015866] [2024-11-08 17:28:45,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549015866] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:28:45,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734377854] [2024-11-08 17:28:45,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 17:28:45,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:28:45,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:28:45,935 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:28:45,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 17:28:46,033 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 17:28:46,033 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 17:28:46,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 17:28:46,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:28:46,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 17:28:46,146 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:28:46,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 17:28:46,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734377854] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 17:28:46,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:28:46,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 14 [2024-11-08 17:28:46,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142379219] [2024-11-08 17:28:46,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:28:46,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:28:46,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:28:46,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:28:46,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-11-08 17:28:46,328 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-11-08 17:28:46,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 72 transitions, 343 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 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-08 17:28:46,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:28:46,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-11-08 17:28:46,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:28:47,575 INFO L124 PetriNetUnfolderBase]: 4031/6104 cut-off events. [2024-11-08 17:28:47,575 INFO L125 PetriNetUnfolderBase]: For 7503/7855 co-relation queries the response was YES. [2024-11-08 17:28:47,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17976 conditions, 6104 events. 4031/6104 cut-off events. For 7503/7855 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 34767 event pairs, 913 based on Foata normal form. 296/6381 useless extension candidates. Maximal degree in co-relation 15202. Up to 1069 conditions per place. [2024-11-08 17:28:47,632 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 138 selfloop transitions, 42 changer transitions 0/188 dead transitions. [2024-11-08 17:28:47,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 188 transitions, 1178 flow [2024-11-08 17:28:47,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 17:28:47,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-08 17:28:47,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 255 transitions. [2024-11-08 17:28:47,634 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4941860465116279 [2024-11-08 17:28:47,635 INFO L175 Difference]: Start difference. First operand has 70 places, 72 transitions, 343 flow. Second operand 12 states and 255 transitions. [2024-11-08 17:28:47,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 188 transitions, 1178 flow [2024-11-08 17:28:47,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 188 transitions, 1174 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-08 17:28:47,681 INFO L231 Difference]: Finished difference. Result has 86 places, 95 transitions, 625 flow [2024-11-08 17:28:47,683 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=625, PETRI_PLACES=86, PETRI_TRANSITIONS=95} [2024-11-08 17:28:47,684 INFO L277 CegarLoopForPetriNet]: 41 programPoint places, 45 predicate places. [2024-11-08 17:28:47,685 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 95 transitions, 625 flow [2024-11-08 17:28:47,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 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-08 17:28:47,685 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:28:47,686 INFO L204 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] [2024-11-08 17:28:47,707 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 17:28:47,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:28:47,890 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-08 17:28:47,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:28:47,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1389649514, now seen corresponding path program 1 times [2024-11-08 17:28:47,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:28:47,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357741265] [2024-11-08 17:28:47,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:28:47,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:28:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:28:48,021 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-08 17:28:48,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:28:48,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357741265] [2024-11-08 17:28:48,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357741265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:28:48,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:28:48,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:28:48,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882556069] [2024-11-08 17:28:48,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:28:48,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:28:48,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:28:48,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:28:48,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:28:48,080 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2024-11-08 17:28:48,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 95 transitions, 625 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 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-08 17:28:48,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:28:48,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2024-11-08 17:28:48,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:28:48,815 INFO L124 PetriNetUnfolderBase]: 2270/3716 cut-off events. [2024-11-08 17:28:48,815 INFO L125 PetriNetUnfolderBase]: For 8824/9177 co-relation queries the response was YES. [2024-11-08 17:28:48,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12376 conditions, 3716 events. 2270/3716 cut-off events. For 8824/9177 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 22426 event pairs, 1230 based on Foata normal form. 131/3650 useless extension candidates. Maximal degree in co-relation 10402. Up to 2689 conditions per place. [2024-11-08 17:28:48,853 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 77 selfloop transitions, 6 changer transitions 0/112 dead transitions. [2024-11-08 17:28:48,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 112 transitions, 837 flow [2024-11-08 17:28:48,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:28:48,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 17:28:48,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-11-08 17:28:48,855 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5775193798449613 [2024-11-08 17:28:48,855 INFO L175 Difference]: Start difference. First operand has 86 places, 95 transitions, 625 flow. Second operand 6 states and 149 transitions. [2024-11-08 17:28:48,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 112 transitions, 837 flow [2024-11-08 17:28:48,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 112 transitions, 814 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-11-08 17:28:48,913 INFO L231 Difference]: Finished difference. Result has 87 places, 90 transitions, 592 flow [2024-11-08 17:28:48,913 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=592, PETRI_PLACES=87, PETRI_TRANSITIONS=90} [2024-11-08 17:28:48,914 INFO L277 CegarLoopForPetriNet]: 41 programPoint places, 46 predicate places. [2024-11-08 17:28:48,914 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 90 transitions, 592 flow [2024-11-08 17:28:48,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 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-08 17:28:48,914 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:28:48,916 INFO L204 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] [2024-11-08 17:28:48,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:28:48,917 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-08 17:28:48,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:28:48,917 INFO L85 PathProgramCache]: Analyzing trace with hash 215628281, now seen corresponding path program 3 times [2024-11-08 17:28:48,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:28:48,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116910835] [2024-11-08 17:28:48,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:28:48,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:28:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:28:49,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 17:28:49,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:28:49,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116910835] [2024-11-08 17:28:49,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116910835] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:28:49,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065120098] [2024-11-08 17:28:49,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 17:28:49,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:28:49,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:28:49,151 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:28:49,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 17:28:49,254 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-08 17:28:49,254 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 17:28:49,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 17:28:49,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:28:49,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 17:28:49,372 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:28:49,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 17:28:49,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065120098] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 17:28:49,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:28:49,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 15 [2024-11-08 17:28:49,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053395005] [2024-11-08 17:28:49,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:28:49,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:28:49,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:28:49,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:28:49,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:28:49,527 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-11-08 17:28:49,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 90 transitions, 592 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 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-08 17:28:49,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:28:49,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-11-08 17:28:49,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:28:50,912 INFO L124 PetriNetUnfolderBase]: 4160/6298 cut-off events. [2024-11-08 17:28:50,912 INFO L125 PetriNetUnfolderBase]: For 14130/14566 co-relation queries the response was YES. [2024-11-08 17:28:50,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21574 conditions, 6298 events. 4160/6298 cut-off events. For 14130/14566 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 35904 event pairs, 1126 based on Foata normal form. 26/6299 useless extension candidates. Maximal degree in co-relation 18668. Up to 1659 conditions per place. [2024-11-08 17:28:50,971 INFO L140 encePairwiseOnDemand]: 28/43 looper letters, 120 selfloop transitions, 66 changer transitions 0/194 dead transitions. [2024-11-08 17:28:50,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 194 transitions, 1478 flow [2024-11-08 17:28:50,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:28:50,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-08 17:28:50,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 228 transitions. [2024-11-08 17:28:50,972 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5302325581395348 [2024-11-08 17:28:50,972 INFO L175 Difference]: Start difference. First operand has 87 places, 90 transitions, 592 flow. Second operand 10 states and 228 transitions. [2024-11-08 17:28:50,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 194 transitions, 1478 flow [2024-11-08 17:28:51,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 194 transitions, 1425 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-11-08 17:28:51,066 INFO L231 Difference]: Finished difference. Result has 97 places, 122 transitions, 1045 flow [2024-11-08 17:28:51,066 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1045, PETRI_PLACES=97, PETRI_TRANSITIONS=122} [2024-11-08 17:28:51,067 INFO L277 CegarLoopForPetriNet]: 41 programPoint places, 56 predicate places. [2024-11-08 17:28:51,067 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 122 transitions, 1045 flow [2024-11-08 17:28:51,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 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-08 17:28:51,068 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:28:51,068 INFO L204 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] [2024-11-08 17:28:51,092 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 17:28:51,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 17:28:51,269 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-08 17:28:51,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:28:51,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1257273035, now seen corresponding path program 4 times [2024-11-08 17:28:51,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:28:51,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867880636] [2024-11-08 17:28:51,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:28:51,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:28:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:28:51,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 17:28:51,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:28:51,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867880636] [2024-11-08 17:28:51,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867880636] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:28:51,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160393788] [2024-11-08 17:28:51,431 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 17:28:51,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:28:51,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:28:51,434 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:28:51,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 17:28:51,526 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 17:28:51,526 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 17:28:51,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 17:28:51,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:28:51,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 17:28:51,628 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:28:51,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 17:28:51,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160393788] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:28:51,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:28:51,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2024-11-08 17:28:51,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732788355] [2024-11-08 17:28:51,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:28:51,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 17:28:51,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:28:51,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 17:28:51,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-08 17:28:51,855 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 43 [2024-11-08 17:28:51,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 122 transitions, 1045 flow. Second operand has 15 states, 15 states have (on average 8.933333333333334) internal successors, (134), 15 states have internal predecessors, (134), 0 states have call successors, (0), 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-08 17:28:51,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:28:51,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 43 [2024-11-08 17:28:51,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:28:55,199 INFO L124 PetriNetUnfolderBase]: 8848/12965 cut-off events. [2024-11-08 17:28:55,199 INFO L125 PetriNetUnfolderBase]: For 43388/43455 co-relation queries the response was YES. [2024-11-08 17:28:55,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49612 conditions, 12965 events. 8848/12965 cut-off events. For 43388/43455 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 74313 event pairs, 846 based on Foata normal form. 46/12955 useless extension candidates. Maximal degree in co-relation 45021. Up to 2269 conditions per place. [2024-11-08 17:28:55,305 INFO L140 encePairwiseOnDemand]: 25/43 looper letters, 265 selfloop transitions, 211 changer transitions 0/481 dead transitions. [2024-11-08 17:28:55,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 481 transitions, 4590 flow [2024-11-08 17:28:55,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-08 17:28:55,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2024-11-08 17:28:55,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 477 transitions. [2024-11-08 17:28:55,310 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3961794019933555 [2024-11-08 17:28:55,310 INFO L175 Difference]: Start difference. First operand has 97 places, 122 transitions, 1045 flow. Second operand 28 states and 477 transitions. [2024-11-08 17:28:55,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 481 transitions, 4590 flow [2024-11-08 17:28:55,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 481 transitions, 4537 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-11-08 17:28:55,655 INFO L231 Difference]: Finished difference. Result has 135 places, 278 transitions, 3275 flow [2024-11-08 17:28:55,656 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=3275, PETRI_PLACES=135, PETRI_TRANSITIONS=278} [2024-11-08 17:28:55,656 INFO L277 CegarLoopForPetriNet]: 41 programPoint places, 94 predicate places. [2024-11-08 17:28:55,656 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 278 transitions, 3275 flow [2024-11-08 17:28:55,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 8.933333333333334) internal successors, (134), 15 states have internal predecessors, (134), 0 states have call successors, (0), 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-08 17:28:55,657 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:28:55,657 INFO L204 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] [2024-11-08 17:28:55,674 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 17:28:55,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-08 17:28:55,858 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-08 17:28:55,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:28:55,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1156669735, now seen corresponding path program 5 times [2024-11-08 17:28:55,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:28:55,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080030659] [2024-11-08 17:28:55,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:28:55,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:28:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:28:56,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 17:28:56,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:28:56,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080030659] [2024-11-08 17:28:56,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080030659] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:28:56,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580957100] [2024-11-08 17:28:56,034 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-08 17:28:56,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:28:56,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:28:56,036 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:28:56,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 17:28:56,133 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 17:28:56,134 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 17:28:56,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 17:28:56,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:28:56,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 17:28:56,222 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:28:56,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 17:28:56,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580957100] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:28:56,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:28:56,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2024-11-08 17:28:56,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082738512] [2024-11-08 17:28:56,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:28:56,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 17:28:56,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:28:56,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 17:28:56,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:28:56,464 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 43 [2024-11-08 17:28:56,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 278 transitions, 3275 flow. Second operand has 16 states, 16 states have (on average 9.0625) internal successors, (145), 16 states have internal predecessors, (145), 0 states have call successors, (0), 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-08 17:28:56,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:28:56,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 43 [2024-11-08 17:28:56,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:29:00,191 INFO L124 PetriNetUnfolderBase]: 10727/15729 cut-off events. [2024-11-08 17:29:00,192 INFO L125 PetriNetUnfolderBase]: For 86115/86186 co-relation queries the response was YES. [2024-11-08 17:29:00,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70491 conditions, 15729 events. 10727/15729 cut-off events. For 86115/86186 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 92540 event pairs, 1088 based on Foata normal form. 74/15716 useless extension candidates. Maximal degree in co-relation 64689. Up to 2363 conditions per place. [2024-11-08 17:29:00,375 INFO L140 encePairwiseOnDemand]: 26/43 looper letters, 292 selfloop transitions, 277 changer transitions 0/574 dead transitions. [2024-11-08 17:29:00,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 574 transitions, 6668 flow [2024-11-08 17:29:00,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-08 17:29:00,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-11-08 17:29:00,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 461 transitions. [2024-11-08 17:29:00,378 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.41234347048300535 [2024-11-08 17:29:00,378 INFO L175 Difference]: Start difference. First operand has 135 places, 278 transitions, 3275 flow. Second operand 26 states and 461 transitions. [2024-11-08 17:29:00,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 574 transitions, 6668 flow [2024-11-08 17:29:01,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 574 transitions, 6510 flow, removed 66 selfloop flow, removed 6 redundant places. [2024-11-08 17:29:01,209 INFO L231 Difference]: Finished difference. Result has 174 places, 410 transitions, 5728 flow [2024-11-08 17:29:01,210 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3143, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=5728, PETRI_PLACES=174, PETRI_TRANSITIONS=410} [2024-11-08 17:29:01,211 INFO L277 CegarLoopForPetriNet]: 41 programPoint places, 133 predicate places. [2024-11-08 17:29:01,211 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 410 transitions, 5728 flow [2024-11-08 17:29:01,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.0625) internal successors, (145), 16 states have internal predecessors, (145), 0 states have call successors, (0), 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-08 17:29:01,211 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:29:01,214 INFO L204 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] [2024-11-08 17:29:01,236 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 17:29:01,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-08 17:29:01,415 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-08 17:29:01,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:01,415 INFO L85 PathProgramCache]: Analyzing trace with hash -75883839, now seen corresponding path program 6 times [2024-11-08 17:29:01,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:01,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460906291] [2024-11-08 17:29:01,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:01,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:01,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 17:29:01,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:01,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460906291] [2024-11-08 17:29:01,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460906291] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:29:01,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412973404] [2024-11-08 17:29:01,605 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-08 17:29:01,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:29:01,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:29:01,611 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:29:01,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 17:29:01,707 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-11-08 17:29:01,707 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 17:29:01,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 17:29:01,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:29:01,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 17:29:01,813 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:29:01,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 17:29:01,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412973404] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 17:29:01,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:29:01,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 16 [2024-11-08 17:29:01,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835060505] [2024-11-08 17:29:01,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:01,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:29:01,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:01,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:29:01,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2024-11-08 17:29:02,032 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-11-08 17:29:02,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 410 transitions, 5728 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 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-08 17:29:02,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:29:02,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-11-08 17:29:02,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:29:04,407 INFO L124 PetriNetUnfolderBase]: 6295/9630 cut-off events. [2024-11-08 17:29:04,407 INFO L125 PetriNetUnfolderBase]: For 94822/95530 co-relation queries the response was YES. [2024-11-08 17:29:04,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53778 conditions, 9630 events. 6295/9630 cut-off events. For 94822/95530 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 59659 event pairs, 895 based on Foata normal form. 72/9622 useless extension candidates. Maximal degree in co-relation 51762. Up to 1952 conditions per place. [2024-11-08 17:29:04,533 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 232 selfloop transitions, 241 changer transitions 0/481 dead transitions. [2024-11-08 17:29:04,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 481 transitions, 7161 flow [2024-11-08 17:29:04,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:29:04,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-08 17:29:04,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 215 transitions. [2024-11-08 17:29:04,535 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-08 17:29:04,535 INFO L175 Difference]: Start difference. First operand has 174 places, 410 transitions, 5728 flow. Second operand 10 states and 215 transitions. [2024-11-08 17:29:04,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 481 transitions, 7161 flow [2024-11-08 17:29:05,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 481 transitions, 6970 flow, removed 92 selfloop flow, removed 3 redundant places. [2024-11-08 17:29:05,216 INFO L231 Difference]: Finished difference. Result has 186 places, 422 transitions, 6558 flow [2024-11-08 17:29:05,217 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5509, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=225, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6558, PETRI_PLACES=186, PETRI_TRANSITIONS=422} [2024-11-08 17:29:05,218 INFO L277 CegarLoopForPetriNet]: 41 programPoint places, 145 predicate places. [2024-11-08 17:29:05,218 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 422 transitions, 6558 flow [2024-11-08 17:29:05,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 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-08 17:29:05,218 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:29:05,218 INFO L204 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] [2024-11-08 17:29:05,239 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 17:29:05,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:29:05,419 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-08 17:29:05,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:05,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1116103574, now seen corresponding path program 1 times [2024-11-08 17:29:05,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:05,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994727859] [2024-11-08 17:29:05,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:05,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,524 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-08 17:29:05,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:05,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994727859] [2024-11-08 17:29:05,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994727859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:05,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:05,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:29:05,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870022442] [2024-11-08 17:29:05,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:05,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:29:05,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:05,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:29:05,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:29:05,587 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-11-08 17:29:05,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 422 transitions, 6558 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 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-08 17:29:05,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:29:05,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-11-08 17:29:05,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:29:07,320 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L66-1-->L64-7: Formula: (= |v_thread3Thread1of1ForFork1_~i~2#1_14| (+ |v_thread3Thread1of1ForFork1_~i~2#1_13| 1)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_13|} OutVars{thread3Thread1of1ForFork1_#t~post9#1=|v_thread3Thread1of1ForFork1_#t~post9#1_1|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_5|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_14|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post9#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_~i~2#1][422], [Black: 245#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~M~0 0)), Black: 237#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~M~0 0)), Black: 1224#(or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)), Black: 637#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1279#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 639#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 1283#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 1290#true, Black: 1281#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 643#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 641#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 1277#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 635#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 50#(= ~res2~0 ~res1~0), Black: 879#(<= 1 ~N~0), Black: 1058#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 56#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), Black: 1072#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 265#(<= 1 ~N~0), Black: 1076#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 440#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 442#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0) (<= 1 ~M~0)), Black: 1054#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), Black: 54#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 1050#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 438#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1062#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 1056#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 434#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1064#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 993#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)), Black: 1066#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 1080#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 1068#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1047#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 1052#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), Black: 874#true, 1078#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 880#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 907#(<= 0 |thread1Thread1of1ForFork2_~i~0#1|), Black: 1070#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), 467#(<= 1 ~N~0), Black: 1060#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 460#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0) (<= ~M~0 0)), 19#L46-8true, Black: 708#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 851#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), 68#(<= 1 ~N~0), Black: 843#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 835#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 839#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 831#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 8#L55-2true, Black: 655#(<= 1 ~N~0), Black: 853#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), 37#L64-7true, Black: 849#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 855#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), Black: 837#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 845#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), 1275#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 833#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 822#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), 432#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 13#L85-4true, Black: 65#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 69#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 247#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= ~M~0 0)), Black: 241#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~M~0 0)), Black: 110#(and (<= 1 ~N~0) (<= ~M~0 0)), Black: 243#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))]) [2024-11-08 17:29:07,320 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-08 17:29:07,320 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-08 17:29:07,321 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-08 17:29:07,321 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-08 17:29:07,397 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L66-1-->L64-7: Formula: (= |v_thread3Thread1of1ForFork1_~i~2#1_14| (+ |v_thread3Thread1of1ForFork1_~i~2#1_13| 1)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_13|} OutVars{thread3Thread1of1ForFork1_#t~post9#1=|v_thread3Thread1of1ForFork1_#t~post9#1_1|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_5|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_14|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post9#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_~i~2#1][422], [Black: 245#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~M~0 0)), Black: 237#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~M~0 0)), Black: 1224#(or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)), Black: 637#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1279#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 639#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 1283#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 1290#true, Black: 643#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1281#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 641#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 1277#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 635#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), 6#L86true, Black: 50#(= ~res2~0 ~res1~0), Black: 879#(<= 1 ~N~0), Black: 1058#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 56#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), Black: 1072#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 265#(<= 1 ~N~0), Black: 1076#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 440#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 442#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0) (<= 1 ~M~0)), Black: 54#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 1054#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), Black: 1050#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 438#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1062#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 1056#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 434#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1064#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 993#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)), Black: 1066#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 1080#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 1068#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1047#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 1052#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), Black: 874#true, Black: 880#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 1078#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 907#(<= 0 |thread1Thread1of1ForFork2_~i~0#1|), Black: 1070#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), 467#(<= 1 ~N~0), Black: 1060#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 460#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0) (<= ~M~0 0)), 19#L46-8true, Black: 708#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 851#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), 68#(<= 1 ~N~0), Black: 843#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 835#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 839#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 831#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 8#L55-2true, Black: 655#(<= 1 ~N~0), Black: 853#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), 37#L64-7true, Black: 849#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 855#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), Black: 837#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 845#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), 1275#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 833#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 822#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), 432#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 65#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 69#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 247#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= ~M~0 0)), Black: 241#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~M~0 0)), Black: 110#(and (<= 1 ~N~0) (<= ~M~0 0)), Black: 243#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))]) [2024-11-08 17:29:07,398 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-08 17:29:07,398 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-08 17:29:07,398 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-08 17:29:07,398 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-08 17:29:07,684 INFO L124 PetriNetUnfolderBase]: 5038/7854 cut-off events. [2024-11-08 17:29:07,684 INFO L125 PetriNetUnfolderBase]: For 108660/109550 co-relation queries the response was YES. [2024-11-08 17:29:07,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48355 conditions, 7854 events. 5038/7854 cut-off events. For 108660/109550 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 48713 event pairs, 1261 based on Foata normal form. 188/7905 useless extension candidates. Maximal degree in co-relation 48286. Up to 5416 conditions per place. [2024-11-08 17:29:07,787 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 358 selfloop transitions, 34 changer transitions 25/471 dead transitions. [2024-11-08 17:29:07,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 471 transitions, 7839 flow [2024-11-08 17:29:07,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:29:07,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-08 17:29:07,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2024-11-08 17:29:07,789 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5182724252491694 [2024-11-08 17:29:07,789 INFO L175 Difference]: Start difference. First operand has 186 places, 422 transitions, 6558 flow. Second operand 7 states and 156 transitions. [2024-11-08 17:29:07,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 471 transitions, 7839 flow [2024-11-08 17:29:08,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 471 transitions, 7768 flow, removed 20 selfloop flow, removed 10 redundant places. [2024-11-08 17:29:08,478 INFO L231 Difference]: Finished difference. Result has 176 places, 393 transitions, 6299 flow [2024-11-08 17:29:08,479 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=6282, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6299, PETRI_PLACES=176, PETRI_TRANSITIONS=393} [2024-11-08 17:29:08,480 INFO L277 CegarLoopForPetriNet]: 41 programPoint places, 135 predicate places. [2024-11-08 17:29:08,480 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 393 transitions, 6299 flow [2024-11-08 17:29:08,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 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-08 17:29:08,481 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:29:08,481 INFO L204 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-08 17:29:08,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 17:29:08,481 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-08 17:29:08,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:08,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1058439290, now seen corresponding path program 1 times [2024-11-08 17:29:08,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:08,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879317536] [2024-11-08 17:29:08,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:08,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:08,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 17:29:08,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:08,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879317536] [2024-11-08 17:29:08,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879317536] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:29:08,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918352229] [2024-11-08 17:29:08,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:08,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:29:08,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:29:08,627 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:29:08,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 17:29:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:08,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 17:29:08,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:29:08,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 17:29:08,791 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:29:08,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 17:29:08,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918352229] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 17:29:08,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:29:08,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 10 [2024-11-08 17:29:08,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950509121] [2024-11-08 17:29:08,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:08,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:29:08,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:08,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:29:08,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:29:08,878 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-11-08 17:29:08,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 393 transitions, 6299 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 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-08 17:29:08,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:29:08,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-11-08 17:29:08,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:29:09,791 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L57-1-->L55-7: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_14| (+ |v_thread2Thread1of1ForFork0_~i~1#1_13| 1)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_13|} OutVars{thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_5|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_14|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~tmp~1#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post6#1][267], [Black: 245#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~M~0 0)), Black: 237#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~M~0 0)), Black: 1224#(or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)), Black: 637#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 1482#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0)), Black: 1283#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 1290#true, Black: 467#(<= 1 ~N~0), 639#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 643#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1281#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1275#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 641#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 635#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), 239#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 837#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 1279#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 26#L55-7true, Black: 50#(= ~res2~0 ~res1~0), Black: 879#(<= 1 ~N~0), Black: 1058#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 56#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), Black: 1072#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 265#(<= 1 ~N~0), Black: 440#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 1076#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 1054#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), Black: 442#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0) (<= 1 ~M~0)), Black: 54#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 1050#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 432#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 1062#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 438#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1064#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1066#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 1080#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 1068#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1052#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), Black: 880#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1070#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 1060#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 460#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0) (<= ~M~0 0)), Black: 708#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 851#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), Black: 843#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 835#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 839#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 831#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 655#(<= 1 ~N~0), Black: 822#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 853#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), Black: 849#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 855#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), Black: 845#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), 3#L64-2true, Black: 833#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 36#L46-2true, 434#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 1047#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 65#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 13#L85-4true, Black: 69#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 247#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= ~M~0 0)), Black: 241#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~M~0 0)), Black: 110#(and (<= 1 ~N~0) (<= ~M~0 0)), Black: 243#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))]) [2024-11-08 17:29:09,792 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-11-08 17:29:09,792 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-08 17:29:09,792 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-08 17:29:09,792 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-08 17:29:10,065 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L57-1-->L55-7: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_14| (+ |v_thread2Thread1of1ForFork0_~i~1#1_13| 1)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_13|} OutVars{thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_5|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_14|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~tmp~1#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post6#1][342], [Black: 245#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~M~0 0)), 1295#(<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|), Black: 237#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~M~0 0)), Black: 1224#(or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)), Black: 637#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 639#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 1283#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 1281#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 643#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1275#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 641#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 635#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), 1279#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 26#L55-7true, 6#L86true, 438#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 50#(= ~res2~0 ~res1~0), 1307#(<= 1 ~N~0), Black: 879#(<= 1 ~N~0), Black: 1058#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 1072#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 56#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), Black: 265#(<= 1 ~N~0), Black: 1076#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 440#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 1054#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), Black: 54#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 442#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0) (<= 1 ~M~0)), Black: 432#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 1050#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1062#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 434#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1064#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1066#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 1080#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 1068#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1052#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), Black: 880#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1070#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), 467#(<= 1 ~N~0), Black: 1060#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 460#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0) (<= ~M~0 0)), 19#L46-8true, Black: 708#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 851#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), 68#(<= 1 ~N~0), Black: 843#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 835#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 839#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 655#(<= 1 ~N~0), Black: 822#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 853#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), Black: 849#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 855#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), Black: 837#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 845#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), 831#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 833#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 17#L64-8true, 1047#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 65#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 69#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 247#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= ~M~0 0)), Black: 241#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~M~0 0)), Black: 110#(and (<= 1 ~N~0) (<= ~M~0 0)), Black: 243#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))]) [2024-11-08 17:29:10,066 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-11-08 17:29:10,066 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-08 17:29:10,066 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-08 17:29:10,066 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-08 17:29:10,115 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L57-1-->L55-7: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_14| (+ |v_thread2Thread1of1ForFork0_~i~1#1_13| 1)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_13|} OutVars{thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_5|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_14|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~tmp~1#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post6#1][267], [Black: 245#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~M~0 0)), Black: 237#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~M~0 0)), Black: 1224#(or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)), Black: 637#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 1482#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0)), 1290#true, Black: 467#(<= 1 ~N~0), Black: 1283#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 639#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 643#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1281#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1275#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 641#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 635#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), 239#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 837#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 1279#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 26#L55-7true, 6#L86true, Black: 50#(= ~res2~0 ~res1~0), Black: 879#(<= 1 ~N~0), Black: 1058#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 1072#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 56#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), Black: 265#(<= 1 ~N~0), Black: 440#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 1076#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 1054#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), Black: 442#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0) (<= 1 ~M~0)), Black: 54#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 1050#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 432#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 1062#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 438#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1064#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1066#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 1080#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 1068#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1052#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), Black: 880#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1070#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 1060#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 460#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0) (<= ~M~0 0)), Black: 708#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 851#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), Black: 843#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 835#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 839#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 831#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 655#(<= 1 ~N~0), Black: 822#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 853#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), Black: 849#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 855#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), Black: 845#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), 3#L64-2true, Black: 833#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 36#L46-2true, 434#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 1047#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 65#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 69#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 247#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= ~M~0 0)), Black: 241#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~M~0 0)), Black: 110#(and (<= 1 ~N~0) (<= ~M~0 0)), Black: 243#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))]) [2024-11-08 17:29:10,115 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-11-08 17:29:10,116 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-08 17:29:10,116 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-08 17:29:10,116 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-08 17:29:10,263 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L57-1-->L55-7: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_14| (+ |v_thread2Thread1of1ForFork0_~i~1#1_13| 1)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_13|} OutVars{thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_5|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_14|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~tmp~1#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post6#1][342], [Black: 245#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~M~0 0)), 1295#(<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|), Black: 237#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~M~0 0)), Black: 1224#(or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)), Black: 637#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 639#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 1283#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 1281#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 643#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1275#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 641#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 635#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), 1279#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 26#L55-7true, 6#L86true, 438#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 50#(= ~res2~0 ~res1~0), 1307#(<= 1 ~N~0), Black: 879#(<= 1 ~N~0), Black: 1058#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 1072#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 56#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), Black: 265#(<= 1 ~N~0), Black: 1076#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 440#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 1054#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), Black: 54#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 442#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0) (<= 1 ~M~0)), Black: 432#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 1050#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1062#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 434#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1064#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 24#L46-9true, Black: 1066#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 1080#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 1068#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1052#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), Black: 880#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1070#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), 467#(<= 1 ~N~0), Black: 1060#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 460#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0) (<= ~M~0 0)), Black: 708#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 851#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), 68#(<= 1 ~N~0), Black: 843#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 835#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 839#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 655#(<= 1 ~N~0), Black: 822#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 853#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), Black: 849#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 855#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), Black: 837#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 845#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), 831#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 833#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 17#L64-8true, 1047#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 65#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 69#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 247#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= ~M~0 0)), Black: 241#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~M~0 0)), Black: 110#(and (<= 1 ~N~0) (<= ~M~0 0)), Black: 243#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))]) [2024-11-08 17:29:10,263 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-11-08 17:29:10,263 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-08 17:29:10,263 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-08 17:29:10,264 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-08 17:29:11,357 INFO L124 PetriNetUnfolderBase]: 6206/9739 cut-off events. [2024-11-08 17:29:11,358 INFO L125 PetriNetUnfolderBase]: For 154163/155256 co-relation queries the response was YES. [2024-11-08 17:29:11,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63213 conditions, 9739 events. 6206/9739 cut-off events. For 154163/155256 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 63088 event pairs, 1369 based on Foata normal form. 1110/10472 useless extension candidates. Maximal degree in co-relation 63150. Up to 5168 conditions per place. [2024-11-08 17:29:11,494 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 363 selfloop transitions, 39 changer transitions 0/501 dead transitions. [2024-11-08 17:29:11,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 501 transitions, 9066 flow [2024-11-08 17:29:11,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:29:11,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 17:29:11,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2024-11-08 17:29:11,495 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4930232558139535 [2024-11-08 17:29:11,496 INFO L175 Difference]: Start difference. First operand has 176 places, 393 transitions, 6299 flow. Second operand 5 states and 106 transitions. [2024-11-08 17:29:11,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 501 transitions, 9066 flow [2024-11-08 17:29:12,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 501 transitions, 8832 flow, removed 39 selfloop flow, removed 9 redundant places. [2024-11-08 17:29:12,404 INFO L231 Difference]: Finished difference. Result has 165 places, 393 transitions, 6267 flow [2024-11-08 17:29:12,405 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=6108, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6267, PETRI_PLACES=165, PETRI_TRANSITIONS=393} [2024-11-08 17:29:12,405 INFO L277 CegarLoopForPetriNet]: 41 programPoint places, 124 predicate places. [2024-11-08 17:29:12,406 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 393 transitions, 6267 flow [2024-11-08 17:29:12,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 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-08 17:29:12,406 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:29:12,406 INFO L204 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, 1] [2024-11-08 17:29:12,421 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-08 17:29:12,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:29:12,607 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-08 17:29:12,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:12,607 INFO L85 PathProgramCache]: Analyzing trace with hash -148969313, now seen corresponding path program 1 times [2024-11-08 17:29:12,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:12,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855960752] [2024-11-08 17:29:12,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:12,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:13,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:29:13,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:13,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855960752] [2024-11-08 17:29:13,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855960752] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:29:13,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67378110] [2024-11-08 17:29:13,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:13,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:29:13,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:29:13,615 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:29:13,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 17:29:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:13,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-08 17:29:13,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:29:13,927 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 15 treesize of output 7 [2024-11-08 17:29:13,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 17:29:13,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:29:14,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:29:14,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 16 [2024-11-08 17:29:14,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 17:29:14,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67378110] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:29:14,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:29:14,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 6] total 18 [2024-11-08 17:29:14,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015467912] [2024-11-08 17:29:14,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:29:14,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 17:29:14,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:14,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 17:29:14,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-11-08 17:29:14,339 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2024-11-08 17:29:14,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 393 transitions, 6267 flow. Second operand has 19 states, 19 states have (on average 18.789473684210527) internal successors, (357), 19 states have internal predecessors, (357), 0 states have call successors, (0), 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-08 17:29:14,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:29:14,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2024-11-08 17:29:14,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:29:17,572 INFO L124 PetriNetUnfolderBase]: 7229/11285 cut-off events. [2024-11-08 17:29:17,573 INFO L125 PetriNetUnfolderBase]: For 136061/136963 co-relation queries the response was YES. [2024-11-08 17:29:17,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69700 conditions, 11285 events. 7229/11285 cut-off events. For 136061/136963 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 75201 event pairs, 358 based on Foata normal form. 311/11515 useless extension candidates. Maximal degree in co-relation 69639. Up to 6759 conditions per place. [2024-11-08 17:29:17,727 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 548 selfloop transitions, 143 changer transitions 1/794 dead transitions. [2024-11-08 17:29:17,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 794 transitions, 13106 flow [2024-11-08 17:29:17,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 17:29:17,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-08 17:29:17,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 372 transitions. [2024-11-08 17:29:17,730 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6179401993355482 [2024-11-08 17:29:17,730 INFO L175 Difference]: Start difference. First operand has 165 places, 393 transitions, 6267 flow. Second operand 14 states and 372 transitions. [2024-11-08 17:29:17,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 794 transitions, 13106 flow [2024-11-08 17:29:18,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 794 transitions, 13039 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-08 17:29:18,934 INFO L231 Difference]: Finished difference. Result has 180 places, 529 transitions, 9088 flow [2024-11-08 17:29:18,935 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=6227, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=9088, PETRI_PLACES=180, PETRI_TRANSITIONS=529} [2024-11-08 17:29:18,936 INFO L277 CegarLoopForPetriNet]: 41 programPoint places, 139 predicate places. [2024-11-08 17:29:18,936 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 529 transitions, 9088 flow [2024-11-08 17:29:18,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 18.789473684210527) internal successors, (357), 19 states have internal predecessors, (357), 0 states have call successors, (0), 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-08 17:29:18,936 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:29:18,936 INFO L204 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, 1] [2024-11-08 17:29:18,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-08 17:29:19,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:29:19,137 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-08 17:29:19,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:19,138 INFO L85 PathProgramCache]: Analyzing trace with hash 783883341, now seen corresponding path program 1 times [2024-11-08 17:29:19,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:19,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214821234] [2024-11-08 17:29:19,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:19,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:20,547 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:29:20,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:20,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214821234] [2024-11-08 17:29:20,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214821234] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:29:20,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767150473] [2024-11-08 17:29:20,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:20,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:29:20,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:29:20,550 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:29:20,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 17:29:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:20,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-08 17:29:20,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:29:20,711 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 15 treesize of output 1 [2024-11-08 17:29:21,042 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 15 treesize of output 7 [2024-11-08 17:29:21,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:29:21,057 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:29:21,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 17:29:21,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767150473] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:29:21,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:29:21,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 26 [2024-11-08 17:29:21,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392149608] [2024-11-08 17:29:21,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:29:21,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-08 17:29:21,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:21,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-08 17:29:21,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2024-11-08 17:29:22,288 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-11-08 17:29:22,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 529 transitions, 9088 flow. Second operand has 27 states, 27 states have (on average 11.555555555555555) internal successors, (312), 27 states have internal predecessors, (312), 0 states have call successors, (0), 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-08 17:29:22,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:29:22,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-11-08 17:29:22,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:29:32,511 INFO L124 PetriNetUnfolderBase]: 16420/24692 cut-off events. [2024-11-08 17:29:32,511 INFO L125 PetriNetUnfolderBase]: For 267916/269056 co-relation queries the response was YES. [2024-11-08 17:29:32,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154652 conditions, 24692 events. 16420/24692 cut-off events. For 267916/269056 co-relation queries the response was YES. Maximal size of possible extension queue 1252. Compared 170780 event pairs, 621 based on Foata normal form. 21/24687 useless extension candidates. Maximal degree in co-relation 154586. Up to 12635 conditions per place. [2024-11-08 17:29:32,903 INFO L140 encePairwiseOnDemand]: 22/43 looper letters, 1400 selfloop transitions, 561 changer transitions 5/1976 dead transitions. [2024-11-08 17:29:32,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 1976 transitions, 33015 flow [2024-11-08 17:29:32,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-08 17:29:32,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2024-11-08 17:29:32,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 914 transitions. [2024-11-08 17:29:32,907 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4428294573643411 [2024-11-08 17:29:32,907 INFO L175 Difference]: Start difference. First operand has 180 places, 529 transitions, 9088 flow. Second operand 48 states and 914 transitions. [2024-11-08 17:29:32,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 1976 transitions, 33015 flow [2024-11-08 17:29:37,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 1976 transitions, 32664 flow, removed 140 selfloop flow, removed 4 redundant places. [2024-11-08 17:29:37,372 INFO L231 Difference]: Finished difference. Result has 247 places, 1065 transitions, 19328 flow [2024-11-08 17:29:37,373 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=9022, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=19328, PETRI_PLACES=247, PETRI_TRANSITIONS=1065} [2024-11-08 17:29:37,373 INFO L277 CegarLoopForPetriNet]: 41 programPoint places, 206 predicate places. [2024-11-08 17:29:37,373 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 1065 transitions, 19328 flow [2024-11-08 17:29:37,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 11.555555555555555) internal successors, (312), 27 states have internal predecessors, (312), 0 states have call successors, (0), 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-08 17:29:37,374 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:29:37,374 INFO L204 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, 1] [2024-11-08 17:29:37,390 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-08 17:29:37,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-08 17:29:37,576 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 17:29:37,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:37,580 INFO L85 PathProgramCache]: Analyzing trace with hash 611969693, now seen corresponding path program 2 times [2024-11-08 17:29:37,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:37,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347491159] [2024-11-08 17:29:37,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:37,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:29:38,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:38,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347491159] [2024-11-08 17:29:38,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347491159] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:29:38,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479494822] [2024-11-08 17:29:38,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 17:29:38,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:29:38,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:29:38,770 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:29:38,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 17:29:38,884 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 17:29:38,884 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 17:29:38,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-08 17:29:38,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:29:38,941 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 15 treesize of output 1 [2024-11-08 17:29:39,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:29:39,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2024-11-08 17:29:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:29:39,332 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:29:39,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 17:29:39,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479494822] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:29:39,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:29:39,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 28 [2024-11-08 17:29:39,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645043879] [2024-11-08 17:29:39,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:29:39,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-08 17:29:39,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:39,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-08 17:29:39,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2024-11-08 17:29:40,511 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-11-08 17:29:40,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 1065 transitions, 19328 flow. Second operand has 29 states, 29 states have (on average 11.310344827586206) internal successors, (328), 29 states have internal predecessors, (328), 0 states have call successors, (0), 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-08 17:29:40,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:29:40,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-11-08 17:29:40,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:29:57,428 INFO L124 PetriNetUnfolderBase]: 23751/35738 cut-off events. [2024-11-08 17:29:57,428 INFO L125 PetriNetUnfolderBase]: For 514616/516202 co-relation queries the response was YES. [2024-11-08 17:29:57,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248570 conditions, 35738 events. 23751/35738 cut-off events. For 514616/516202 co-relation queries the response was YES. Maximal size of possible extension queue 1682. Compared 259890 event pairs, 1517 based on Foata normal form. 52/35761 useless extension candidates. Maximal degree in co-relation 248481. Up to 19436 conditions per place. [2024-11-08 17:29:57,990 INFO L140 encePairwiseOnDemand]: 22/43 looper letters, 1572 selfloop transitions, 885 changer transitions 1/2468 dead transitions. [2024-11-08 17:29:57,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 2468 transitions, 47745 flow [2024-11-08 17:29:57,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-08 17:29:57,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2024-11-08 17:29:57,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 833 transitions. [2024-11-08 17:29:57,994 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.43049095607235144 [2024-11-08 17:29:57,994 INFO L175 Difference]: Start difference. First operand has 247 places, 1065 transitions, 19328 flow. Second operand 45 states and 833 transitions. [2024-11-08 17:29:57,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 2468 transitions, 47745 flow [2024-11-08 17:30:14,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 2468 transitions, 47527 flow, removed 107 selfloop flow, removed 2 redundant places. [2024-11-08 17:30:14,344 INFO L231 Difference]: Finished difference. Result has 309 places, 1649 transitions, 33701 flow [2024-11-08 17:30:14,344 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=19122, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1065, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=395, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=33701, PETRI_PLACES=309, PETRI_TRANSITIONS=1649} [2024-11-08 17:30:14,345 INFO L277 CegarLoopForPetriNet]: 41 programPoint places, 268 predicate places. [2024-11-08 17:30:14,345 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 1649 transitions, 33701 flow [2024-11-08 17:30:14,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 11.310344827586206) internal successors, (328), 29 states have internal predecessors, (328), 0 states have call successors, (0), 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-08 17:30:14,346 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:30:14,346 INFO L204 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, 1] [2024-11-08 17:30:14,369 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-08 17:30:14,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-08 17:30:14,551 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 17:30:14,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:14,552 INFO L85 PathProgramCache]: Analyzing trace with hash 3229323, now seen corresponding path program 2 times [2024-11-08 17:30:14,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:14,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665918598] [2024-11-08 17:30:14,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:14,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:15,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:30:15,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:15,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665918598] [2024-11-08 17:30:15,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665918598] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:30:15,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388503566] [2024-11-08 17:30:15,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 17:30:15,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:30:15,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:30:15,300 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:30:15,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f196c1a7-7e6c-4044-99ff-95d56cf71f90/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 17:30:15,427 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 17:30:15,427 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 17:30:15,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-08 17:30:15,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:30:15,607 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 15 treesize of output 7 [2024-11-08 17:30:15,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 17:30:15,643 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:30:15,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:30:15,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 16 [2024-11-08 17:30:15,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 17:30:15,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388503566] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:30:15,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:30:15,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 6] total 18 [2024-11-08 17:30:15,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468025839] [2024-11-08 17:30:15,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:30:15,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 17:30:15,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:15,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 17:30:15,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2024-11-08 17:30:16,049 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2024-11-08 17:30:16,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 1649 transitions, 33701 flow. Second operand has 19 states, 19 states have (on average 18.68421052631579) internal successors, (355), 19 states have internal predecessors, (355), 0 states have call successors, (0), 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-08 17:30:16,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:30:16,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2024-11-08 17:30:16,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:30:27,459 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L46-2-->L46-8: Formula: (let ((.cse0 (select (select |v_#memory_int#1_72| v_~A~0.base_104) (+ (* |v_thread1Thread1of1ForFork2_~i~0#1_11| 4) v_~A~0.offset_104)))) (and (= v_~res1~0_55 |v_thread1Thread1of1ForFork2_plus_#res#1_1|) (= (+ .cse0 v_~res1~0_56) |v_thread1Thread1of1ForFork2_plus_#res#1_1|) (<= v_~res1~0_55 2147483647) (<= 0 (+ v_~res1~0_55 2147483648)) (not (= (ite (or (<= |v_thread1Thread1of1ForFork2_plus_#res#1_1| 2147483647) (<= .cse0 0)) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_11| 1) |v_thread1Thread1of1ForFork2_~i~0#1_12|) (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#res#1_1| 2147483648)) (<= 0 .cse0)) 1 0) 0)) (< |v_thread1Thread1of1ForFork2_~i~0#1_11| v_~N~0_93))) InVars {~res1~0=v_~res1~0_56, ~A~0.base=v_~A~0.base_104, ~A~0.offset=v_~A~0.offset_104, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_11|, ~N~0=v_~N~0_93, #memory_int#1=|v_#memory_int#1_72|} OutVars{~res1~0=v_~res1~0_55, ~A~0.base=v_~A~0.base_104, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_1|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_1|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_1|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_1|, ~N~0=v_~N~0_93, #memory_int#1=|v_#memory_int#1_72|, ~A~0.offset=v_~A~0.offset_104, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_12|, thread1Thread1of1ForFork2_#t~ret2#1=|v_thread1Thread1of1ForFork2_#t~ret2#1_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_1|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_1|, thread1Thread1of1ForFork2_#t~mem1#1=|v_thread1Thread1of1ForFork2_#t~mem1#1_1|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_~tmp~0#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_#t~ret2#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1, thread1Thread1of1ForFork2_#t~mem1#1][392], [Black: 245#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~M~0 0)), Black: 237#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~M~0 0)), 18#L66true, Black: 1224#(or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)), Black: 1279#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1281#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 639#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 1275#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 1701#true, Black: 879#(<= 1 ~N~0), Black: 1058#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 1072#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1076#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 1054#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), Black: 54#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 1050#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1062#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 1064#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1066#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 1080#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 1068#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1047#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 1052#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), Black: 880#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1070#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 1060#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 708#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 851#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), Black: 843#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 835#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 839#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 831#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 655#(<= 1 ~N~0), 8#L55-2true, Black: 822#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 853#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), Black: 849#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 855#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), Black: 845#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), Black: 833#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 13#L85-4true, Black: 637#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 467#(<= 1 ~N~0), Black: 643#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 641#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 635#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), 239#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 837#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 1492#(and (= ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~A~0.offset 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res2~0 0)), Black: 1495#(= ~res2~0 ~res1~0), Black: 1689#(and (= ~A~0.offset 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (= ~res2~0 0)), Black: 1489#(and (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 0)), Black: 1695#(and (= ~res2~0 ~res1~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 |thread2Thread1of1ForFork0_~tmp~1#1|)), 1485#true, 1307#(<= 1 ~N~0), Black: 1747#(and (<= 0 ~M~0) (= ~res1~0 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res2~0 0)), 2000#true, Black: 1945#(and (= ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~A~0.offset 0) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~N~0 1) (= ~res2~0 0) (= ~M~0 0)), Black: 1955#(and (= ~res2~0 ~res1~0) (or (= (+ ~res1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0)) (< 0 ~M~0))), Black: 1919#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~res1~0 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 1) (= ~res2~0 0)), Black: 265#(<= 1 ~N~0), Black: 1712#(= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|), Black: 442#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0) (<= 1 ~M~0)), Black: 1713#(= ~res2~0 ~res1~0), Black: 1929#(and (= ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~A~0.offset 0) (<= ~N~0 1) (= ~res2~0 0) (= ~M~0 0)), Black: 438#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1957#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (or (= (+ ~res1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0)) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= (+ ~res1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0)))), Black: 1967#(and (= ~res2~0 ~res1~0) (= (+ ~res1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0))), Black: 434#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1969#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|)), Black: 1771#(and (= ~res2~0 0) (= ~M~0 0) (= ~res1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))), Black: 1709#(and (= ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 0 ~M~0) (= ~A~0.offset 0) (<= ~N~0 1) (= ~res2~0 0)), Black: 1947#(and (= ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 0 ~M~0) (= ~A~0.offset 0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= (+ ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)))) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~N~0 1) (= ~res2~0 0)), Black: 1961#(and (= ~res2~0 ~res1~0) (or (= (+ ~res1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0)) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= (+ ~res1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0)))), Black: 1917#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~res1~0 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 1) (= ~res2~0 0)), Black: 1939#(and (= ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 0 ~M~0) (= ~A~0.offset 0) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~N~0 1) (= ~res2~0 0)), Black: 1941#(and (= ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 0 ~M~0) (= ~A~0.offset 0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= (+ ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)))) (<= ~N~0 1) (= ~res2~0 0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|)), Black: 1943#(and (= ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~N~0 1) (= ~res2~0 0)), 1078#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 1951#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (= ~res2~0 0) (= ~M~0 0) (= ~res1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))), Black: 1482#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0)), Black: 1913#(and (or (= ~N~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= ~res1~0 0) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1949#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (or (= (+ ~res1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0)) (< 0 ~M~0))), Black: 1935#(and (= ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 0 ~M~0) (= ~A~0.offset 0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= (+ ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)))) (<= ~N~0 1) (= ~res2~0 0)), Black: 1937#(and (= ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 0 ~M~0) (= ~A~0.offset 0) (<= ~N~0 1) (= ~res2~0 0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|)), 2293#true, 19#L46-8true, Black: 2248#(and (<= 0 ~M~0) (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|)), Black: 2262#(and (<= 0 ~M~0) (= ~res2~0 ~res1~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 2266#(and (<= 0 ~M~0) (or (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (not (= ~M~0 0))) (or (= ~res2~0 ~res1~0) (not (= ~M~0 0))) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 2256#(and (<= 0 ~M~0) (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 2081#(and (<= 0 ~M~0) (or (= ~res2~0 ~res1~0) (not (= ~M~0 0))) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 2236#(and (<= 0 ~M~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~M~0 |thread3Thread1of1ForFork1_~i~2#1|) (= ~res1~0 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res2~0 0)), Black: 2228#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~M~0 |thread3Thread1of1ForFork1_~i~2#1|) (= ~res1~0 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 1) (= ~res2~0 0)), Black: 2230#(and (= ~A~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~res1~0 0) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~N~0 1) (= ~res2~0 0) (= ~M~0 0)), Black: 2056#(and (<= 0 ~M~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~M~0 |thread3Thread1of1ForFork1_~i~2#1|) (= ~res1~0 0) (= ~res2~0 0)), Black: 2258#(and (<= 0 ~M~0) (or (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (not (= ~M~0 0))) (or (= ~res2~0 ~res1~0) (not (= ~M~0 0)))), Black: 2232#(and (= ~A~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~res1~0 0) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 1) (= ~res2~0 0) (= ~M~0 0)), Black: 2145#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~res2~0 ~res1~0)), Black: 2224#(and (<= 0 ~M~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~res1~0 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res2~0 0)), Black: 2254#(and (<= 0 ~M~0) (= ~res2~0 ~res1~0)), Black: 2226#(and (= ~A~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~M~0 |thread3Thread1of1ForFork1_~i~2#1|) (= ~res1~0 0) (<= ~N~0 1) (= ~res2~0 0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|)), 440#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 2074#(and (<= 0 ~M~0) (or (= ~res2~0 ~res1~0) (not (= ~M~0 0)))), Black: 2242#(and (<= 0 ~M~0) (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|)), 1283#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 2220#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~res1~0 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 1) (= ~res2~0 0)), Black: 2070#(and (<= 0 ~M~0) (or (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (not (= ~M~0 0)))), Black: 65#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 69#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 247#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= ~M~0 0)), Black: 241#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~M~0 0)), Black: 110#(and (<= 1 ~N~0) (<= ~M~0 0)), Black: 243#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))]) [2024-11-08 17:30:27,459 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-08 17:30:27,459 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-08 17:30:27,460 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-08 17:30:27,460 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-08 17:30:29,895 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L46-2-->L46-8: Formula: (let ((.cse0 (select (select |v_#memory_int#1_72| v_~A~0.base_104) (+ (* |v_thread1Thread1of1ForFork2_~i~0#1_11| 4) v_~A~0.offset_104)))) (and (= v_~res1~0_55 |v_thread1Thread1of1ForFork2_plus_#res#1_1|) (= (+ .cse0 v_~res1~0_56) |v_thread1Thread1of1ForFork2_plus_#res#1_1|) (<= v_~res1~0_55 2147483647) (<= 0 (+ v_~res1~0_55 2147483648)) (not (= (ite (or (<= |v_thread1Thread1of1ForFork2_plus_#res#1_1| 2147483647) (<= .cse0 0)) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_11| 1) |v_thread1Thread1of1ForFork2_~i~0#1_12|) (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#res#1_1| 2147483648)) (<= 0 .cse0)) 1 0) 0)) (< |v_thread1Thread1of1ForFork2_~i~0#1_11| v_~N~0_93))) InVars {~res1~0=v_~res1~0_56, ~A~0.base=v_~A~0.base_104, ~A~0.offset=v_~A~0.offset_104, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_11|, ~N~0=v_~N~0_93, #memory_int#1=|v_#memory_int#1_72|} OutVars{~res1~0=v_~res1~0_55, ~A~0.base=v_~A~0.base_104, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_1|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_1|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_1|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_1|, ~N~0=v_~N~0_93, #memory_int#1=|v_#memory_int#1_72|, ~A~0.offset=v_~A~0.offset_104, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_12|, thread1Thread1of1ForFork2_#t~ret2#1=|v_thread1Thread1of1ForFork2_#t~ret2#1_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_1|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_1|, thread1Thread1of1ForFork2_#t~mem1#1=|v_thread1Thread1of1ForFork2_#t~mem1#1_1|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_~tmp~0#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_#t~ret2#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1, thread1Thread1of1ForFork2_#t~mem1#1][392], [Black: 245#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~M~0 0)), Black: 237#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~M~0 0)), 18#L66true, Black: 1224#(or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)), Black: 1279#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1281#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 639#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 1275#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 1701#true, 6#L86true, Black: 879#(<= 1 ~N~0), Black: 1058#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 1072#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1076#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 1054#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), Black: 54#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 1050#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1062#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 1064#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1066#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 1080#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 1068#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1047#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 1052#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), Black: 880#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1070#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 1060#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 708#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 851#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), Black: 843#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 835#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 839#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 831#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 8#L55-2true, Black: 655#(<= 1 ~N~0), Black: 822#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 853#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), Black: 849#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 855#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), Black: 845#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), Black: 833#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 637#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 467#(<= 1 ~N~0), Black: 643#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 641#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 635#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), 239#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 837#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 1492#(and (= ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~A~0.offset 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res2~0 0)), Black: 1495#(= ~res2~0 ~res1~0), Black: 1689#(and (= ~A~0.offset 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (= ~res2~0 0)), Black: 1489#(and (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 0)), Black: 1695#(and (= ~res2~0 ~res1~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 |thread2Thread1of1ForFork0_~tmp~1#1|)), 1485#true, 1307#(<= 1 ~N~0), 2000#true, Black: 1747#(and (<= 0 ~M~0) (= ~res1~0 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res2~0 0)), Black: 1945#(and (= ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~A~0.offset 0) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~N~0 1) (= ~res2~0 0) (= ~M~0 0)), Black: 1955#(and (= ~res2~0 ~res1~0) (or (= (+ ~res1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0)) (< 0 ~M~0))), Black: 265#(<= 1 ~N~0), Black: 1919#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~res1~0 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 1) (= ~res2~0 0)), Black: 1712#(= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|), Black: 1713#(= ~res2~0 ~res1~0), Black: 442#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0) (<= 1 ~M~0)), Black: 1929#(and (= ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~A~0.offset 0) (<= ~N~0 1) (= ~res2~0 0) (= ~M~0 0)), Black: 1957#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (or (= (+ ~res1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0)) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= (+ ~res1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0)))), Black: 438#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1967#(and (= ~res2~0 ~res1~0) (= (+ ~res1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0))), Black: 434#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1969#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|)), Black: 1771#(and (= ~res2~0 0) (= ~M~0 0) (= ~res1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))), Black: 1709#(and (= ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 0 ~M~0) (= ~A~0.offset 0) (<= ~N~0 1) (= ~res2~0 0)), Black: 1947#(and (= ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 0 ~M~0) (= ~A~0.offset 0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= (+ ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)))) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~N~0 1) (= ~res2~0 0)), Black: 1961#(and (= ~res2~0 ~res1~0) (or (= (+ ~res1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0)) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= (+ ~res1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0)))), Black: 1917#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~res1~0 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 1) (= ~res2~0 0)), Black: 1939#(and (= ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 0 ~M~0) (= ~A~0.offset 0) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~N~0 1) (= ~res2~0 0)), Black: 1941#(and (= ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 0 ~M~0) (= ~A~0.offset 0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= (+ ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)))) (<= ~N~0 1) (= ~res2~0 0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|)), Black: 1943#(and (= ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~N~0 1) (= ~res2~0 0)), 1078#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 1951#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (= ~res2~0 0) (= ~M~0 0) (= ~res1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))), Black: 1482#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0)), Black: 1913#(and (or (= ~N~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= ~res1~0 0) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1949#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (or (= (+ ~res1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0)) (< 0 ~M~0))), Black: 1935#(and (= ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 0 ~M~0) (= ~A~0.offset 0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= (+ ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)))) (<= ~N~0 1) (= ~res2~0 0)), Black: 1937#(and (= ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 0 ~M~0) (= ~A~0.offset 0) (<= ~N~0 1) (= ~res2~0 0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|)), 2293#true, 19#L46-8true, Black: 2248#(and (<= 0 ~M~0) (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|)), Black: 2262#(and (<= 0 ~M~0) (= ~res2~0 ~res1~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 2266#(and (<= 0 ~M~0) (or (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (not (= ~M~0 0))) (or (= ~res2~0 ~res1~0) (not (= ~M~0 0))) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 2256#(and (<= 0 ~M~0) (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 2081#(and (<= 0 ~M~0) (or (= ~res2~0 ~res1~0) (not (= ~M~0 0))) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 2236#(and (<= 0 ~M~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~M~0 |thread3Thread1of1ForFork1_~i~2#1|) (= ~res1~0 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res2~0 0)), Black: 2228#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~M~0 |thread3Thread1of1ForFork1_~i~2#1|) (= ~res1~0 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 1) (= ~res2~0 0)), Black: 2230#(and (= ~A~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~res1~0 0) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~N~0 1) (= ~res2~0 0) (= ~M~0 0)), Black: 2056#(and (<= 0 ~M~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~M~0 |thread3Thread1of1ForFork1_~i~2#1|) (= ~res1~0 0) (= ~res2~0 0)), Black: 2258#(and (<= 0 ~M~0) (or (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (not (= ~M~0 0))) (or (= ~res2~0 ~res1~0) (not (= ~M~0 0)))), Black: 2232#(and (= ~A~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~res1~0 0) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 1) (= ~res2~0 0) (= ~M~0 0)), Black: 2145#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~res2~0 ~res1~0)), Black: 2224#(and (<= 0 ~M~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~res1~0 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res2~0 0)), Black: 2254#(and (<= 0 ~M~0) (= ~res2~0 ~res1~0)), Black: 2226#(and (= ~A~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~M~0 |thread3Thread1of1ForFork1_~i~2#1|) (= ~res1~0 0) (<= ~N~0 1) (= ~res2~0 0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|)), 440#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 2074#(and (<= 0 ~M~0) (or (= ~res2~0 ~res1~0) (not (= ~M~0 0)))), Black: 2242#(and (<= 0 ~M~0) (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|)), Black: 2220#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~res1~0 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 1) (= ~res2~0 0)), 1283#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 2070#(and (<= 0 ~M~0) (or (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (not (= ~M~0 0)))), Black: 65#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 69#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 247#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= ~M~0 0)), Black: 241#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~M~0 0)), Black: 110#(and (<= 1 ~N~0) (<= ~M~0 0)), Black: 243#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))]) [2024-11-08 17:30:29,897 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-11-08 17:30:29,897 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-08 17:30:29,897 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-08 17:30:29,897 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event