./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7146189c-fb09-430a-a247-7523a9ab0648/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7146189c-fb09-430a-a247-7523a9ab0648/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_7146189c-fb09-430a-a247-7523a9ab0648/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7146189c-fb09-430a-a247-7523a9ab0648/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7146189c-fb09-430a-a247-7523a9ab0648/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7146189c-fb09-430a-a247-7523a9ab0648/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3ff96f1177b851e0082faef897c2fcf87c2462cab57ba2153c754c5e198aaf06 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:12:52,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:12:52,220 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7146189c-fb09-430a-a247-7523a9ab0648/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-08 18:12:52,225 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:12:52,225 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:12:52,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:12:52,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:12:52,251 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:12:52,251 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:12:52,252 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:12:52,252 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:12:52,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:12:52,253 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:12:52,254 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:12:52,254 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:12:52,255 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:12:52,255 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:12:52,256 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:12:52,256 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:12:52,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:12:52,257 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 18:12:52,258 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 18:12:52,258 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 18:12:52,258 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:12:52,260 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:12:52,260 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:12:52,264 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 18:12:52,264 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:12:52,265 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:12:52,265 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:12:52,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:12:52,265 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:12:52,266 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:12:52,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:12:52,266 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:12:52,267 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:12:52,267 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:12:52,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:12:52,268 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:12:52,269 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:12:52,269 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:12:52,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:12:52,270 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_7146189c-fb09-430a-a247-7523a9ab0648/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_7146189c-fb09-430a-a247-7523a9ab0648/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 3ff96f1177b851e0082faef897c2fcf87c2462cab57ba2153c754c5e198aaf06 [2024-11-08 18:12:52,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:12:52,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:12:52,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:12:52,543 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:12:52,544 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:12:52,545 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7146189c-fb09-430a-a247-7523a9ab0648/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c Unable to find full path for "g++" [2024-11-08 18:12:54,669 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:12:54,914 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:12:54,915 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7146189c-fb09-430a-a247-7523a9ab0648/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c [2024-11-08 18:12:54,923 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7146189c-fb09-430a-a247-7523a9ab0648/bin/uautomizer-verify-jihMAELWvX/data/c0d6279a6/f5f9923792dd45a4a65dcbb65abf9f40/FLAG9011fe1c7 [2024-11-08 18:12:54,937 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7146189c-fb09-430a-a247-7523a9ab0648/bin/uautomizer-verify-jihMAELWvX/data/c0d6279a6/f5f9923792dd45a4a65dcbb65abf9f40 [2024-11-08 18:12:54,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:12:54,941 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:12:54,943 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:12:54,943 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:12:54,948 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:12:54,948 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:12:54" (1/1) ... [2024-11-08 18:12:54,949 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b74736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:54, skipping insertion in model container [2024-11-08 18:12:54,950 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:12:54" (1/1) ... [2024-11-08 18:12:54,973 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:12:55,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:12:55,199 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:12:55,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:12:55,243 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:12:55,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:55 WrapperNode [2024-11-08 18:12:55,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:12:55,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:12:55,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:12:55,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:12:55,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:55" (1/1) ... [2024-11-08 18:12:55,257 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:55" (1/1) ... [2024-11-08 18:12:55,279 INFO L138 Inliner]: procedures = 21, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 67 [2024-11-08 18:12:55,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:12:55,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:12:55,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:12:55,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:12:55,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:55" (1/1) ... [2024-11-08 18:12:55,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:55" (1/1) ... [2024-11-08 18:12:55,294 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:55" (1/1) ... [2024-11-08 18:12:55,308 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 18:12:55,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:55" (1/1) ... [2024-11-08 18:12:55,308 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:55" (1/1) ... [2024-11-08 18:12:55,313 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:55" (1/1) ... [2024-11-08 18:12:55,317 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:55" (1/1) ... [2024-11-08 18:12:55,318 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:55" (1/1) ... [2024-11-08 18:12:55,319 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:55" (1/1) ... [2024-11-08 18:12:55,321 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:12:55,322 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:12:55,322 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:12:55,323 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:12:55,323 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:55" (1/1) ... [2024-11-08 18:12:55,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:12:55,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7146189c-fb09-430a-a247-7523a9ab0648/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:12:55,361 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7146189c-fb09-430a-a247-7523a9ab0648/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:12:55,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7146189c-fb09-430a-a247-7523a9ab0648/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:12:55,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:12:55,396 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-08 18:12:55,396 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-08 18:12:55,397 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-08 18:12:55,397 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-08 18:12:55,397 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-08 18:12:55,397 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-08 18:12:55,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:12:55,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-08 18:12:55,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-08 18:12:55,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:12:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:12:55,400 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 18:12:55,495 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:12:55,497 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:12:55,770 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 18:12:55,773 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:12:56,031 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:12:56,031 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 18:12:56,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:12:56 BoogieIcfgContainer [2024-11-08 18:12:56,032 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:12:56,035 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:12:56,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:12:56,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:12:56,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:12:54" (1/3) ... [2024-11-08 18:12:56,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1761f69a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:12:56, skipping insertion in model container [2024-11-08 18:12:56,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:55" (2/3) ... [2024-11-08 18:12:56,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1761f69a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:12:56, skipping insertion in model container [2024-11-08 18:12:56,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:12:56" (3/3) ... [2024-11-08 18:12:56,043 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-threaded-sum-3.wvr.c [2024-11-08 18:12:56,061 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:12:56,061 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-08 18:12:56,061 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 18:12:56,139 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-08 18:12:56,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 46 transitions, 113 flow [2024-11-08 18:12:56,235 INFO L124 PetriNetUnfolderBase]: 6/43 cut-off events. [2024-11-08 18:12:56,238 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-08 18:12:56,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 43 events. 6/43 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 82 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-11-08 18:12:56,245 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 46 transitions, 113 flow [2024-11-08 18:12:56,251 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 42 transitions, 102 flow [2024-11-08 18:12:56,269 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:12:56,274 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=None, 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;@720be9ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:12:56,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-08 18:12:56,292 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 18:12:56,292 INFO L124 PetriNetUnfolderBase]: 6/39 cut-off events. [2024-11-08 18:12:56,293 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-08 18:12:56,293 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:12:56,294 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] [2024-11-08 18:12:56,295 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-08 18:12:56,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:12:56,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1950572631, now seen corresponding path program 1 times [2024-11-08 18:12:56,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:12:56,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798312742] [2024-11-08 18:12:56,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:12:56,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:12:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:57,175 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 18:12:57,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:12:57,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798312742] [2024-11-08 18:12:57,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798312742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:12:57,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:12:57,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:12:57,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909284097] [2024-11-08 18:12:57,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:12:57,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:12:57,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:12:57,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:12:57,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:12:57,257 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 46 [2024-11-08 18:12:57,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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 18:12:57,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:12:57,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 46 [2024-11-08 18:12:57,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:12:57,623 INFO L124 PetriNetUnfolderBase]: 717/1240 cut-off events. [2024-11-08 18:12:57,624 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-11-08 18:12:57,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2211 conditions, 1240 events. 717/1240 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 6667 event pairs, 91 based on Foata normal form. 81/1152 useless extension candidates. Maximal degree in co-relation 2138. Up to 607 conditions per place. [2024-11-08 18:12:57,644 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 44 selfloop transitions, 7 changer transitions 0/69 dead transitions. [2024-11-08 18:12:57,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 69 transitions, 270 flow [2024-11-08 18:12:57,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:12:57,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 18:12:57,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2024-11-08 18:12:57,662 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7217391304347827 [2024-11-08 18:12:57,665 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 102 flow. Second operand 5 states and 166 transitions. [2024-11-08 18:12:57,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 69 transitions, 270 flow [2024-11-08 18:12:57,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 69 transitions, 250 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-08 18:12:57,680 INFO L231 Difference]: Finished difference. Result has 45 places, 46 transitions, 142 flow [2024-11-08 18:12:57,682 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=45, PETRI_TRANSITIONS=46} [2024-11-08 18:12:57,689 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, -1 predicate places. [2024-11-08 18:12:57,690 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 46 transitions, 142 flow [2024-11-08 18:12:57,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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 18:12:57,690 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:12:57,691 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] [2024-11-08 18:12:57,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:12:57,692 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-08 18:12:57,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:12:57,692 INFO L85 PathProgramCache]: Analyzing trace with hash 2032322977, now seen corresponding path program 1 times [2024-11-08 18:12:57,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:12:57,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863445531] [2024-11-08 18:12:57,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:12:57,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:12:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:58,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:12:58,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:12:58,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863445531] [2024-11-08 18:12:58,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863445531] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:12:58,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372695141] [2024-11-08 18:12:58,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:12:58,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:12:58,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7146189c-fb09-430a-a247-7523a9ab0648/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:12:58,127 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7146189c-fb09-430a-a247-7523a9ab0648/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:12:58,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7146189c-fb09-430a-a247-7523a9ab0648/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 18:12:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:58,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 18:12:58,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:12:58,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:12:58,588 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:12:59,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:12:59,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372695141] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:12:59,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:12:59,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 6] total 12 [2024-11-08 18:12:59,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79430917] [2024-11-08 18:12:59,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:12:59,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 18:12:59,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:12:59,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 18:12:59,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:12:59,414 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2024-11-08 18:12:59,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 46 transitions, 142 flow. Second operand has 13 states, 13 states have (on average 18.307692307692307) internal successors, (238), 13 states have internal predecessors, (238), 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 18:12:59,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:12:59,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2024-11-08 18:12:59,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:13:02,071 INFO L124 PetriNetUnfolderBase]: 5361/8154 cut-off events. [2024-11-08 18:13:02,071 INFO L125 PetriNetUnfolderBase]: For 3328/3544 co-relation queries the response was YES. [2024-11-08 18:13:02,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18092 conditions, 8154 events. 5361/8154 cut-off events. For 3328/3544 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 47715 event pairs, 256 based on Foata normal form. 400/7712 useless extension candidates. Maximal degree in co-relation 9649. Up to 1588 conditions per place. [2024-11-08 18:13:02,129 INFO L140 encePairwiseOnDemand]: 31/46 looper letters, 242 selfloop transitions, 119 changer transitions 6/377 dead transitions. [2024-11-08 18:13:02,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 377 transitions, 1791 flow [2024-11-08 18:13:02,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-08 18:13:02,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2024-11-08 18:13:02,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 875 transitions. [2024-11-08 18:13:02,136 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.559462915601023 [2024-11-08 18:13:02,136 INFO L175 Difference]: Start difference. First operand has 45 places, 46 transitions, 142 flow. Second operand 34 states and 875 transitions. [2024-11-08 18:13:02,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 377 transitions, 1791 flow [2024-11-08 18:13:02,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 377 transitions, 1775 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 18:13:02,149 INFO L231 Difference]: Finished difference. Result has 100 places, 183 transitions, 1146 flow [2024-11-08 18:13:02,149 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=1146, PETRI_PLACES=100, PETRI_TRANSITIONS=183} [2024-11-08 18:13:02,150 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 54 predicate places. [2024-11-08 18:13:02,151 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 183 transitions, 1146 flow [2024-11-08 18:13:02,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.307692307692307) internal successors, (238), 13 states have internal predecessors, (238), 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 18:13:02,151 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:13:02,151 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 18:13:02,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7146189c-fb09-430a-a247-7523a9ab0648/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 18:13:02,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7146189c-fb09-430a-a247-7523a9ab0648/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:13:02,357 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-08 18:13:02,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:02,358 INFO L85 PathProgramCache]: Analyzing trace with hash -830247535, now seen corresponding path program 1 times [2024-11-08 18:13:02,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:13:02,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199012868] [2024-11-08 18:13:02,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:02,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:13:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:02,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:13:02,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:13:02,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199012868] [2024-11-08 18:13:02,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199012868] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:13:02,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966544078] [2024-11-08 18:13:02,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:02,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:13:02,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7146189c-fb09-430a-a247-7523a9ab0648/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:13:02,991 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7146189c-fb09-430a-a247-7523a9ab0648/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:13:02,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7146189c-fb09-430a-a247-7523a9ab0648/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 18:13:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:03,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 18:13:03,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:13:03,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:13:03,219 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:13:03,363 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 18:13:03,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966544078] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 18:13:03,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:13:03,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 5] total 13 [2024-11-08 18:13:03,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955384536] [2024-11-08 18:13:03,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:13:03,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:13:03,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:13:03,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:13:03,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:13:03,406 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2024-11-08 18:13:03,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 183 transitions, 1146 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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 18:13:03,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:13:03,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2024-11-08 18:13:03,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:13:06,390 INFO L124 PetriNetUnfolderBase]: 10331/15158 cut-off events. [2024-11-08 18:13:06,390 INFO L125 PetriNetUnfolderBase]: For 50560/50882 co-relation queries the response was YES. [2024-11-08 18:13:06,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53262 conditions, 15158 events. 10331/15158 cut-off events. For 50560/50882 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 96774 event pairs, 1756 based on Foata normal form. 484/13876 useless extension candidates. Maximal degree in co-relation 45426. Up to 7450 conditions per place. [2024-11-08 18:13:06,579 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 185 selfloop transitions, 54 changer transitions 0/292 dead transitions. [2024-11-08 18:13:06,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 292 transitions, 2153 flow [2024-11-08 18:13:06,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:13:06,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 18:13:06,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 178 transitions. [2024-11-08 18:13:06,581 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.644927536231884 [2024-11-08 18:13:06,581 INFO L175 Difference]: Start difference. First operand has 100 places, 183 transitions, 1146 flow. Second operand 6 states and 178 transitions. [2024-11-08 18:13:06,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 292 transitions, 2153 flow [2024-11-08 18:13:06,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 292 transitions, 1947 flow, removed 103 selfloop flow, removed 0 redundant places. [2024-11-08 18:13:06,964 INFO L231 Difference]: Finished difference. Result has 109 places, 208 transitions, 1394 flow [2024-11-08 18:13:06,965 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1394, PETRI_PLACES=109, PETRI_TRANSITIONS=208} [2024-11-08 18:13:06,966 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 63 predicate places. [2024-11-08 18:13:06,966 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 208 transitions, 1394 flow [2024-11-08 18:13:06,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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 18:13:06,967 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:13:06,967 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 18:13:06,988 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7146189c-fb09-430a-a247-7523a9ab0648/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 18:13:07,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7146189c-fb09-430a-a247-7523a9ab0648/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-08 18:13:07,171 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-08 18:13:07,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:07,172 INFO L85 PathProgramCache]: Analyzing trace with hash 857689293, now seen corresponding path program 2 times [2024-11-08 18:13:07,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:13:07,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941303709] [2024-11-08 18:13:07,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:07,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:13:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:07,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 18:13:07,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:13:07,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941303709] [2024-11-08 18:13:07,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941303709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:13:07,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:13:07,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:13:07,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144811988] [2024-11-08 18:13:07,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:13:07,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:13:07,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:13:07,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:13:07,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:13:07,624 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 46 [2024-11-08 18:13:07,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 208 transitions, 1394 flow. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 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 18:13:07,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:13:07,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 46 [2024-11-08 18:13:07,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:13:07,893 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L69-->L72: Formula: (= v_thread2Thread1of1ForFork2_~cond~1_11 (ite (= 0 (ite (or (< 0 (mod v_~t~0_8 4294967296)) (< 0 (mod v_~u~0_4 4294967296))) 1 0)) 0 1)) InVars {~u~0=v_~u~0_4, ~t~0=v_~t~0_8} OutVars{thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_11, ~u~0=v_~u~0_4, ~t~0=v_~t~0_8} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1][34], [44#L72true, 56#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 278#(and (or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296)))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 220#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296)))), Black: 132#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 224#(or (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))), Black: 262#(and (or (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), 248#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (= thread1Thread1of1ForFork1_~cond~0 1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1) (<= 1 (mod (+ ~t~0 1) 4294967296))), Black: 192#(or (< 0 (mod ~u~0 4294967296)) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296)))), Black: 276#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 62#true, Black: 266#(and (or (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), Black: 284#(and (or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296)))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), 14#L44true, 16#L113true, Black: 254#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (= thread1Thread1of1ForFork1_~cond~0 1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 252#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (= thread1Thread1of1ForFork1_~cond~0 1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 260#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 268#(and (or (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 282#(and (or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296)))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 244#(and (<= 1 (mod ~t~0 4294967296)) (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (= thread1Thread1of1ForFork1_~cond~0 1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 308#true, Black: 280#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 420#(< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)), 496#true, Black: 176#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))), Black: 490#(and (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (< (mod ~u~0 4294967296) 1))), Black: 272#(and (or (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256))), 461#(or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (< (mod ~u~0 4294967296) 1)), Black: 264#(and (or (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 270#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~u~0 4294967296)) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296))))), Black: 256#(and (or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296)))) (= thread1Thread1of1ForFork1_~cond~0 1)), 31#L82-2true, Black: 58#(and (<= 1 (mod ~T~0 4294967296)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= ~t~0 ~T~0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 55#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0))]) [2024-11-08 18:13:07,893 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-11-08 18:13:07,893 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-08 18:13:07,894 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-08 18:13:07,894 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-08 18:13:08,265 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L69-->L72: Formula: (= v_thread2Thread1of1ForFork2_~cond~1_11 (ite (= 0 (ite (or (< 0 (mod v_~t~0_8 4294967296)) (< 0 (mod v_~u~0_4 4294967296))) 1 0)) 0 1)) InVars {~u~0=v_~u~0_4, ~t~0=v_~t~0_8} OutVars{thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_11, ~u~0=v_~u~0_4, ~t~0=v_~t~0_8} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1][34], [44#L72true, Black: 278#(and (or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296)))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 220#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296)))), Black: 132#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 224#(or (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))), 248#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (= thread1Thread1of1ForFork1_~cond~0 1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1) (<= 1 (mod (+ ~t~0 1) 4294967296))), Black: 262#(and (or (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), Black: 192#(or (< 0 (mod ~u~0 4294967296)) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296)))), Black: 276#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 62#true, Black: 266#(and (or (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), Black: 284#(and (or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296)))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), 16#L113true, 14#L44true, Black: 254#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (= thread1Thread1of1ForFork1_~cond~0 1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 252#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (= thread1Thread1of1ForFork1_~cond~0 1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 260#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 268#(and (or (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 282#(and (or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296)))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 308#true, Black: 244#(and (<= 1 (mod ~t~0 4294967296)) (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (= thread1Thread1of1ForFork1_~cond~0 1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 280#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 420#(< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)), 496#true, Black: 490#(and (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (< (mod ~u~0 4294967296) 1))), Black: 176#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))), Black: 272#(and (or (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256))), 461#(or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (< (mod ~u~0 4294967296) 1)), Black: 264#(and (or (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 270#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~u~0 4294967296)) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296))))), Black: 256#(and (or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296)))) (= thread1Thread1of1ForFork1_~cond~0 1)), 31#L82-2true, Black: 56#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 58#(and (<= 1 (mod ~T~0 4294967296)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= ~t~0 ~T~0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 55#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0))]) [2024-11-08 18:13:08,266 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-11-08 18:13:08,267 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-08 18:13:08,267 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-08 18:13:08,268 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-08 18:13:08,697 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([340] L83-->L85: Formula: (= v_~t~0_41 (+ v_~t~0_42 1)) InVars {~t~0=v_~t~0_42} OutVars{thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_1|, ~t~0=v_~t~0_41} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post5, ~t~0][94], [42#L53true, 420#(< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)), 244#(and (<= 1 (mod ~t~0 4294967296)) (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (= thread1Thread1of1ForFork1_~cond~0 1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 278#(and (or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296)))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 220#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296)))), Black: 248#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (= thread1Thread1of1ForFork1_~cond~0 1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1) (<= 1 (mod (+ ~t~0 1) 4294967296))), Black: 132#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 224#(or (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))), Black: 262#(and (or (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), Black: 192#(or (< 0 (mod ~u~0 4294967296)) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296)))), Black: 276#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 62#true, Black: 266#(and (or (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), 16#L113true, Black: 284#(and (or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296)))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 254#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (= thread1Thread1of1ForFork1_~cond~0 1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 252#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (= thread1Thread1of1ForFork1_~cond~0 1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 260#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), 43#L85true, Black: 268#(and (or (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 461#(or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (< (mod ~u~0 4294967296) 1)), Black: 282#(and (or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296)))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 308#true, 496#true, Black: 280#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 490#(and (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (< (mod ~u~0 4294967296) 1))), Black: 176#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))), Black: 272#(and (or (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 264#(and (or (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 270#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~u~0 4294967296)) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296))))), 27#L69true, Black: 256#(and (or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296)))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 56#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 58#(and (<= 1 (mod ~T~0 4294967296)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= ~t~0 ~T~0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 55#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0))]) [2024-11-08 18:13:08,697 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-08 18:13:08,697 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-08 18:13:08,698 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-08 18:13:08,698 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-08 18:13:09,070 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([340] L83-->L85: Formula: (= v_~t~0_41 (+ v_~t~0_42 1)) InVars {~t~0=v_~t~0_42} OutVars{thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_1|, ~t~0=v_~t~0_41} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post5, ~t~0][94], [42#L53true, 420#(< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)), 244#(and (<= 1 (mod ~t~0 4294967296)) (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (= thread1Thread1of1ForFork1_~cond~0 1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 278#(and (or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296)))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 220#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296)))), Black: 248#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (= thread1Thread1of1ForFork1_~cond~0 1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1) (<= 1 (mod (+ ~t~0 1) 4294967296))), Black: 132#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 224#(or (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))), Black: 262#(and (or (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), Black: 192#(or (< 0 (mod ~u~0 4294967296)) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296)))), Black: 276#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 62#true, Black: 266#(and (or (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), 16#L113true, Black: 284#(and (or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296)))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 254#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (= thread1Thread1of1ForFork1_~cond~0 1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 252#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (= thread1Thread1of1ForFork1_~cond~0 1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 260#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), 43#L85true, Black: 268#(and (or (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 461#(or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (< (mod ~u~0 4294967296) 1)), Black: 282#(and (or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296)))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 308#true, 496#true, Black: 280#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 176#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))), Black: 490#(and (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (< (mod ~u~0 4294967296) 1))), Black: 272#(and (or (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 264#(and (or (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 270#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~u~0 4294967296)) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296))))), 27#L69true, Black: 256#(and (or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296)))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 56#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 58#(and (<= 1 (mod ~T~0 4294967296)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= ~t~0 ~T~0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 55#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0))]) [2024-11-08 18:13:09,070 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-08 18:13:09,071 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-08 18:13:09,071 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-08 18:13:09,071 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-08 18:13:09,071 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-08 18:13:09,074 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L69-->L72: Formula: (= v_thread2Thread1of1ForFork2_~cond~1_11 (ite (= 0 (ite (or (< 0 (mod v_~t~0_8 4294967296)) (< 0 (mod v_~u~0_4 4294967296))) 1 0)) 0 1)) InVars {~u~0=v_~u~0_4, ~t~0=v_~t~0_8} OutVars{thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_11, ~u~0=v_~u~0_4, ~t~0=v_~t~0_8} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1][75], [42#L53true, 44#L72true, Black: 278#(and (or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296)))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 220#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296)))), Black: 132#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 224#(or (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))), Black: 262#(and (or (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), 248#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (= thread1Thread1of1ForFork1_~cond~0 1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1) (<= 1 (mod (+ ~t~0 1) 4294967296))), Black: 192#(or (< 0 (mod ~u~0 4294967296)) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296)))), Black: 276#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 62#true, Black: 266#(and (or (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), 16#L113true, Black: 284#(and (or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296)))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 254#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (= thread1Thread1of1ForFork1_~cond~0 1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 252#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (= thread1Thread1of1ForFork1_~cond~0 1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 260#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 268#(and (or (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 282#(and (or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296)))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 308#true, Black: 244#(and (<= 1 (mod ~t~0 4294967296)) (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (= thread1Thread1of1ForFork1_~cond~0 1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 420#(< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)), 496#true, Black: 280#(and (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 490#(and (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0)) (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (< (mod ~u~0 4294967296) 1))), Black: 176#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))), Black: 272#(and (or (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)) (<= 1 (mod thread1Thread1of1ForFork1_~cond~0 256))), 461#(or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (< (mod ~u~0 4294967296) 1)), Black: 264#(and (or (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 270#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~u~0 4294967296)) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296))))), Black: 256#(and (or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0) (and (<= 1 (mod ~t~0 4294967296)) (<= 1 (mod (+ 4294967295 ~t~0) 4294967296)))) (= thread1Thread1of1ForFork1_~cond~0 1)), 31#L82-2true, Black: 56#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 58#(and (<= 1 (mod ~T~0 4294967296)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= ~t~0 ~T~0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 55#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0))]) [2024-11-08 18:13:09,074 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-08 18:13:09,075 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-08 18:13:09,075 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-08 18:13:09,075 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-08 18:13:09,692 INFO L124 PetriNetUnfolderBase]: 6408/10932 cut-off events. [2024-11-08 18:13:09,693 INFO L125 PetriNetUnfolderBase]: For 45826/46367 co-relation queries the response was YES. [2024-11-08 18:13:09,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41697 conditions, 10932 events. 6408/10932 cut-off events. For 45826/46367 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 83806 event pairs, 1217 based on Foata normal form. 145/10326 useless extension candidates. Maximal degree in co-relation 34998. Up to 6060 conditions per place. [2024-11-08 18:13:09,977 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 165 selfloop transitions, 15 changer transitions 0/255 dead transitions. [2024-11-08 18:13:09,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 255 transitions, 2021 flow [2024-11-08 18:13:09,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:13:09,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 18:13:09,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2024-11-08 18:13:09,979 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6826086956521739 [2024-11-08 18:13:09,979 INFO L175 Difference]: Start difference. First operand has 109 places, 208 transitions, 1394 flow. Second operand 5 states and 157 transitions. [2024-11-08 18:13:09,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 255 transitions, 2021 flow [2024-11-08 18:13:10,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 255 transitions, 2015 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-11-08 18:13:10,250 INFO L231 Difference]: Finished difference. Result has 114 places, 212 transitions, 1482 flow [2024-11-08 18:13:10,250 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1482, PETRI_PLACES=114, PETRI_TRANSITIONS=212} [2024-11-08 18:13:10,251 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 68 predicate places. [2024-11-08 18:13:10,251 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 212 transitions, 1482 flow [2024-11-08 18:13:10,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 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 18:13:10,252 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:13:10,252 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 18:13:10,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 18:13:10,252 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-08 18:13:10,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:10,253 INFO L85 PathProgramCache]: Analyzing trace with hash -2104779519, now seen corresponding path program 3 times [2024-11-08 18:13:10,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:13:10,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856931563] [2024-11-08 18:13:10,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:10,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:13:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:10,450 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 18:13:10,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:13:10,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856931563] [2024-11-08 18:13:10,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856931563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:13:10,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:13:10,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:13:10,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731546997] [2024-11-08 18:13:10,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:13:10,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:13:10,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:13:10,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:13:10,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:13:10,467 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 46 [2024-11-08 18:13:10,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 212 transitions, 1482 flow. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:10,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:13:10,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 46 [2024-11-08 18:13:10,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:13:13,032 INFO L124 PetriNetUnfolderBase]: 10330/17905 cut-off events. [2024-11-08 18:13:13,033 INFO L125 PetriNetUnfolderBase]: For 93215/94095 co-relation queries the response was YES. [2024-11-08 18:13:13,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67890 conditions, 17905 events. 10330/17905 cut-off events. For 93215/94095 co-relation queries the response was YES. Maximal size of possible extension queue 1173. Compared 149640 event pairs, 1519 based on Foata normal form. 364/17177 useless extension candidates. Maximal degree in co-relation 59741. Up to 7183 conditions per place. [2024-11-08 18:13:13,255 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 239 selfloop transitions, 30 changer transitions 0/336 dead transitions. [2024-11-08 18:13:13,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 336 transitions, 2822 flow [2024-11-08 18:13:13,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:13:13,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 18:13:13,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2024-11-08 18:13:13,258 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7260869565217392 [2024-11-08 18:13:13,258 INFO L175 Difference]: Start difference. First operand has 114 places, 212 transitions, 1482 flow. Second operand 5 states and 167 transitions. [2024-11-08 18:13:13,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 336 transitions, 2822 flow [2024-11-08 18:13:13,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 336 transitions, 2804 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 18:13:13,651 INFO L231 Difference]: Finished difference. Result has 119 places, 235 transitions, 1775 flow [2024-11-08 18:13:13,652 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1775, PETRI_PLACES=119, PETRI_TRANSITIONS=235} [2024-11-08 18:13:13,652 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 73 predicate places. [2024-11-08 18:13:13,653 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 235 transitions, 1775 flow [2024-11-08 18:13:13,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:13,653 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:13:13,653 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, 1, 1] [2024-11-08 18:13:13,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 18:13:13,654 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-08 18:13:13,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:13,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1897233713, now seen corresponding path program 1 times [2024-11-08 18:13:13,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:13:13,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554735541] [2024-11-08 18:13:13,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:13,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:13:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:17,076 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 18:13:17,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:13:17,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554735541] [2024-11-08 18:13:17,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554735541] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:13:17,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598109926] [2024-11-08 18:13:17,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:17,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:13:17,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7146189c-fb09-430a-a247-7523a9ab0648/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:13:17,082 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7146189c-fb09-430a-a247-7523a9ab0648/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:13:17,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7146189c-fb09-430a-a247-7523a9ab0648/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 18:13:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:17,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-08 18:13:17,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:13:19,129 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 18:13:19,129 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:13:37,529 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 18:13:37,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598109926] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:13:37,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:13:37,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 31 [2024-11-08 18:13:37,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513308618] [2024-11-08 18:13:37,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:13:37,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-08 18:13:37,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:13:37,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-08 18:13:37,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=795, Unknown=3, NotChecked=0, Total=992 [2024-11-08 18:13:41,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:13:45,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:13:45,768 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 46 [2024-11-08 18:13:45,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 235 transitions, 1775 flow. Second operand has 32 states, 32 states have (on average 10.5625) internal successors, (338), 32 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:45,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:13:45,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 46 [2024-11-08 18:13:45,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:14:43,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:15:01,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:15:05,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:15:33,712 INFO L124 PetriNetUnfolderBase]: 182917/256150 cut-off events. [2024-11-08 18:15:33,712 INFO L125 PetriNetUnfolderBase]: For 1536391/1536391 co-relation queries the response was YES. [2024-11-08 18:15:34,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1079791 conditions, 256150 events. 182917/256150 cut-off events. For 1536391/1536391 co-relation queries the response was YES. Maximal size of possible extension queue 8024. Compared 1916912 event pairs, 10098 based on Foata normal form. 144/256292 useless extension candidates. Maximal degree in co-relation 905850. Up to 35053 conditions per place. [2024-11-08 18:15:36,113 INFO L140 encePairwiseOnDemand]: 25/46 looper letters, 1747 selfloop transitions, 1613 changer transitions 470/3834 dead transitions. [2024-11-08 18:15:36,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 3834 transitions, 36118 flow [2024-11-08 18:15:36,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2024-11-08 18:15:36,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2024-11-08 18:15:36,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 3087 transitions. [2024-11-08 18:15:36,136 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4473913043478261 [2024-11-08 18:15:36,136 INFO L175 Difference]: Start difference. First operand has 119 places, 235 transitions, 1775 flow. Second operand 150 states and 3087 transitions. [2024-11-08 18:15:36,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 3834 transitions, 36118 flow [2024-11-08 18:16:26,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 3834 transitions, 35710 flow, removed 72 selfloop flow, removed 1 redundant places. [2024-11-08 18:16:26,277 INFO L231 Difference]: Finished difference. Result has 388 places, 1939 transitions, 23112 flow [2024-11-08 18:16:26,278 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1741, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=150, PETRI_FLOW=23112, PETRI_PLACES=388, PETRI_TRANSITIONS=1939} [2024-11-08 18:16:26,279 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 342 predicate places. [2024-11-08 18:16:26,279 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 1939 transitions, 23112 flow [2024-11-08 18:16:26,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 10.5625) internal successors, (338), 32 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:16:26,280 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:16:26,280 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, 1, 1, 1, 1, 1, 1] [2024-11-08 18:16:26,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7146189c-fb09-430a-a247-7523a9ab0648/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 18:16:26,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7146189c-fb09-430a-a247-7523a9ab0648/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 18:16:26,481 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-08 18:16:26,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:16:26,481 INFO L85 PathProgramCache]: Analyzing trace with hash -236156381, now seen corresponding path program 1 times [2024-11-08 18:16:26,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:16:26,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345693207] [2024-11-08 18:16:26,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:16:26,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:16:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:16:29,503 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 18:16:29,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:16:29,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345693207] [2024-11-08 18:16:29,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345693207] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:16:29,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136288776] [2024-11-08 18:16:29,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:16:29,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:16:29,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7146189c-fb09-430a-a247-7523a9ab0648/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:16:29,506 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7146189c-fb09-430a-a247-7523a9ab0648/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:16:29,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7146189c-fb09-430a-a247-7523a9ab0648/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 18:16:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:16:29,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 18:16:29,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:16:31,292 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 18:16:31,293 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:16:38,347 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 18:16:38,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136288776] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:16:38,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:16:38,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 29 [2024-11-08 18:16:38,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024739065] [2024-11-08 18:16:38,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:16:38,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-08 18:16:38,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:16:38,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-08 18:16:38,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=664, Unknown=1, NotChecked=0, Total=870 [2024-11-08 18:16:42,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:16:46,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:16:47,038 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-11-08 18:16:47,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 1939 transitions, 23112 flow. Second operand has 30 states, 30 states have (on average 15.0) internal successors, (450), 30 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:16:47,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:16:47,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-11-08 18:16:47,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand