./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/test-hard1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a532b2d-778d-43e3-8781-ece6abd71af5/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a532b2d-778d-43e3-8781-ece6abd71af5/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a532b2d-778d-43e3-8781-ece6abd71af5/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a532b2d-778d-43e3-8781-ece6abd71af5/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/test-hard1.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a532b2d-778d-43e3-8781-ece6abd71af5/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a532b2d-778d-43e3-8781-ece6abd71af5/bin/uautomizer-verify-4GaUIPS5ZU --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 34f393fd72a97393a0a39d407b9330aa7c1c7e210ad76310ea88c9427f882106 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:11:53,027 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:11:53,103 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a532b2d-778d-43e3-8781-ece6abd71af5/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-31 22:11:53,108 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:11:53,109 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:11:53,145 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:11:53,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:11:53,149 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:11:53,150 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:11:53,150 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:11:53,151 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:11:53,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:11:53,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:11:53,154 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:11:53,154 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:11:53,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:11:53,155 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:11:53,155 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:11:53,155 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:11:53,156 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:11:53,156 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-31 22:11:53,161 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-31 22:11:53,162 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-31 22:11:53,162 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:11:53,162 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:11:53,162 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:11:53,163 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:11:53,163 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:11:53,163 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:11:53,163 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:11:53,164 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:11:53,164 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:11:53,164 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:11:53,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:11:53,165 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:11:53,165 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:11:53,168 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:11:53,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:11:53,169 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:11:53,169 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:11:53,169 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:11:53,170 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:11:53,170 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_6a532b2d-778d-43e3-8781-ece6abd71af5/bin/uautomizer-verify-4GaUIPS5ZU/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_6a532b2d-778d-43e3-8781-ece6abd71af5/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 34f393fd72a97393a0a39d407b9330aa7c1c7e210ad76310ea88c9427f882106 [2024-10-31 22:11:53,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:11:53,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:11:53,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:11:53,471 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:11:53,472 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:11:53,473 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a532b2d-778d-43e3-8781-ece6abd71af5/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/weaver/test-hard1.wvr.c Unable to find full path for "g++" [2024-10-31 22:11:55,502 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:11:55,728 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:11:55,729 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a532b2d-778d-43e3-8781-ece6abd71af5/sv-benchmarks/c/weaver/test-hard1.wvr.c [2024-10-31 22:11:55,736 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a532b2d-778d-43e3-8781-ece6abd71af5/bin/uautomizer-verify-4GaUIPS5ZU/data/bb52c25b0/95f47705aabd4c5b98957b67276c22d0/FLAG0e7759984 [2024-10-31 22:11:55,751 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a532b2d-778d-43e3-8781-ece6abd71af5/bin/uautomizer-verify-4GaUIPS5ZU/data/bb52c25b0/95f47705aabd4c5b98957b67276c22d0 [2024-10-31 22:11:55,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:11:55,756 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:11:55,758 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:11:55,758 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:11:55,766 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:11:55,767 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:11:55" (1/1) ... [2024-10-31 22:11:55,768 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@194673dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:55, skipping insertion in model container [2024-10-31 22:11:55,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:11:55" (1/1) ... [2024-10-31 22:11:55,808 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:11:56,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:11:56,118 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:11:56,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:11:56,182 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:11:56,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:56 WrapperNode [2024-10-31 22:11:56,182 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:11:56,183 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:11:56,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:11:56,184 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:11:56,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:56" (1/1) ... [2024-10-31 22:11:56,201 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:56" (1/1) ... [2024-10-31 22:11:56,221 INFO L138 Inliner]: procedures = 23, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2024-10-31 22:11:56,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:11:56,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:11:56,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:11:56,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:11:56,236 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:56" (1/1) ... [2024-10-31 22:11:56,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:56" (1/1) ... [2024-10-31 22:11:56,239 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:56" (1/1) ... [2024-10-31 22:11:56,263 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-10-31 22:11:56,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:56" (1/1) ... [2024-10-31 22:11:56,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:56" (1/1) ... [2024-10-31 22:11:56,276 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:56" (1/1) ... [2024-10-31 22:11:56,285 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:56" (1/1) ... [2024-10-31 22:11:56,293 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:56" (1/1) ... [2024-10-31 22:11:56,294 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:56" (1/1) ... [2024-10-31 22:11:56,299 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:11:56,302 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:11:56,302 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:11:56,306 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:11:56,307 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:56" (1/1) ... [2024-10-31 22:11:56,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:11:56,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a532b2d-778d-43e3-8781-ece6abd71af5/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:11:56,350 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a532b2d-778d-43e3-8781-ece6abd71af5/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:11:56,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a532b2d-778d-43e3-8781-ece6abd71af5/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:11:56,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:11:56,389 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-31 22:11:56,389 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-31 22:11:56,389 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-31 22:11:56,390 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-31 22:11:56,390 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-31 22:11:56,390 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-31 22:11:56,390 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-31 22:11:56,390 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-31 22:11:56,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:11:56,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-31 22:11:56,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-31 22:11:56,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:11:56,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:11:56,396 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 22:11:56,529 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:11:56,532 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:11:56,879 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 22:11:56,880 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:11:57,135 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:11:57,136 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-31 22:11:57,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:11:57 BoogieIcfgContainer [2024-10-31 22:11:57,138 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:11:57,141 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:11:57,148 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:11:57,153 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:11:57,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:11:55" (1/3) ... [2024-10-31 22:11:57,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6a027f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:11:57, skipping insertion in model container [2024-10-31 22:11:57,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:56" (2/3) ... [2024-10-31 22:11:57,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6a027f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:11:57, skipping insertion in model container [2024-10-31 22:11:57,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:11:57" (3/3) ... [2024-10-31 22:11:57,160 INFO L112 eAbstractionObserver]: Analyzing ICFG test-hard1.wvr.c [2024-10-31 22:11:57,182 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:11:57,182 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-31 22:11:57,182 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 22:11:57,257 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-31 22:11:57,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 46 transitions, 120 flow [2024-10-31 22:11:57,360 INFO L124 PetriNetUnfolderBase]: 4/42 cut-off events. [2024-10-31 22:11:57,364 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-31 22:11:57,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 42 events. 4/42 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-10-31 22:11:57,371 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 46 transitions, 120 flow [2024-10-31 22:11:57,375 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 41 transitions, 106 flow [2024-10-31 22:11:57,390 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:11:57,399 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;@4dfab6f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:11:57,400 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-31 22:11:57,423 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:11:57,424 INFO L124 PetriNetUnfolderBase]: 4/38 cut-off events. [2024-10-31 22:11:57,425 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-31 22:11:57,425 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:11:57,426 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:11:57,426 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-31 22:11:57,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:57,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1972144308, now seen corresponding path program 1 times [2024-10-31 22:11:57,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:57,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528409958] [2024-10-31 22:11:57,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:57,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:57,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:58,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:58,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:58,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528409958] [2024-10-31 22:11:58,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528409958] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:58,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:58,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:11:58,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603155304] [2024-10-31 22:11:58,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:58,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:11:58,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:58,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:11:58,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:11:58,097 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 46 [2024-10-31 22:11:58,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:11:58,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:11:58,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 46 [2024-10-31 22:11:58,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:11:58,637 INFO L124 PetriNetUnfolderBase]: 1367/2172 cut-off events. [2024-10-31 22:11:58,637 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2024-10-31 22:11:58,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4051 conditions, 2172 events. 1367/2172 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 11224 event pairs, 123 based on Foata normal form. 2/2127 useless extension candidates. Maximal degree in co-relation 3481. Up to 1541 conditions per place. [2024-10-31 22:11:58,668 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 35 selfloop transitions, 5 changer transitions 1/58 dead transitions. [2024-10-31 22:11:58,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 58 transitions, 243 flow [2024-10-31 22:11:58,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:11:58,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:11:58,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-10-31 22:11:58,684 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7898550724637681 [2024-10-31 22:11:58,686 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 106 flow. Second operand 3 states and 109 transitions. [2024-10-31 22:11:58,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 58 transitions, 243 flow [2024-10-31 22:11:58,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 58 transitions, 213 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-31 22:11:58,700 INFO L231 Difference]: Finished difference. Result has 43 places, 43 transitions, 119 flow [2024-10-31 22:11:58,704 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=43, PETRI_TRANSITIONS=43} [2024-10-31 22:11:58,711 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -7 predicate places. [2024-10-31 22:11:58,711 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 43 transitions, 119 flow [2024-10-31 22:11:58,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:11:58,712 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:11:58,712 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] [2024-10-31 22:11:58,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:11:58,713 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-31 22:11:58,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:58,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1521002800, now seen corresponding path program 1 times [2024-10-31 22:11:58,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:58,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195675480] [2024-10-31 22:11:58,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:58,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:59,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:59,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:59,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195675480] [2024-10-31 22:11:59,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195675480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:59,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:59,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:11:59,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888893516] [2024-10-31 22:11:59,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:59,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:11:59,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:59,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:11:59,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:11:59,364 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-10-31 22:11:59,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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-10-31 22:11:59,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:11:59,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-10-31 22:11:59,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:12:00,229 INFO L124 PetriNetUnfolderBase]: 3196/4713 cut-off events. [2024-10-31 22:12:00,230 INFO L125 PetriNetUnfolderBase]: For 1275/1275 co-relation queries the response was YES. [2024-10-31 22:12:00,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10729 conditions, 4713 events. 3196/4713 cut-off events. For 1275/1275 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 28007 event pairs, 1020 based on Foata normal form. 0/4226 useless extension candidates. Maximal degree in co-relation 2547. Up to 2129 conditions per place. [2024-10-31 22:12:00,275 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 81 selfloop transitions, 9 changer transitions 0/102 dead transitions. [2024-10-31 22:12:00,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 102 transitions, 478 flow [2024-10-31 22:12:00,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:12:00,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-31 22:12:00,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2024-10-31 22:12:00,314 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7130434782608696 [2024-10-31 22:12:00,314 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 119 flow. Second operand 5 states and 164 transitions. [2024-10-31 22:12:00,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 102 transitions, 478 flow [2024-10-31 22:12:00,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 102 transitions, 465 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:12:00,318 INFO L231 Difference]: Finished difference. Result has 49 places, 49 transitions, 176 flow [2024-10-31 22:12:00,318 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=49, PETRI_TRANSITIONS=49} [2024-10-31 22:12:00,319 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2024-10-31 22:12:00,319 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 49 transitions, 176 flow [2024-10-31 22:12:00,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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-10-31 22:12:00,320 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:12:00,321 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] [2024-10-31 22:12:00,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:12:00,321 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-31 22:12:00,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:12:00,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1650009732, now seen corresponding path program 2 times [2024-10-31 22:12:00,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:12:00,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076581452] [2024-10-31 22:12:00,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:12:00,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:12:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:00,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:12:00,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:12:00,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076581452] [2024-10-31 22:12:00,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076581452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:12:00,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:12:00,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:12:00,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796674887] [2024-10-31 22:12:00,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:12:00,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:12:00,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:12:00,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:12:00,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:12:00,776 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-10-31 22:12:00,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 49 transitions, 176 flow. Second operand has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 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-10-31 22:12:00,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:12:00,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-10-31 22:12:00,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:12:02,171 INFO L124 PetriNetUnfolderBase]: 6047/8942 cut-off events. [2024-10-31 22:12:02,172 INFO L125 PetriNetUnfolderBase]: For 6606/7372 co-relation queries the response was YES. [2024-10-31 22:12:02,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24254 conditions, 8942 events. 6047/8942 cut-off events. For 6606/7372 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 54511 event pairs, 269 based on Foata normal form. 812/9615 useless extension candidates. Maximal degree in co-relation 6289. Up to 5023 conditions per place. [2024-10-31 22:12:02,253 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 110 selfloop transitions, 26 changer transitions 1/149 dead transitions. [2024-10-31 22:12:02,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 149 transitions, 807 flow [2024-10-31 22:12:02,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:12:02,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-31 22:12:02,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 259 transitions. [2024-10-31 22:12:02,256 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7038043478260869 [2024-10-31 22:12:02,256 INFO L175 Difference]: Start difference. First operand has 49 places, 49 transitions, 176 flow. Second operand 8 states and 259 transitions. [2024-10-31 22:12:02,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 149 transitions, 807 flow [2024-10-31 22:12:02,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 149 transitions, 793 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:12:02,268 INFO L231 Difference]: Finished difference. Result has 61 places, 69 transitions, 365 flow [2024-10-31 22:12:02,269 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=365, PETRI_PLACES=61, PETRI_TRANSITIONS=69} [2024-10-31 22:12:02,270 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2024-10-31 22:12:02,271 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 69 transitions, 365 flow [2024-10-31 22:12:02,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 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-10-31 22:12:02,271 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:12:02,271 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] [2024-10-31 22:12:02,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:12:02,272 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-31 22:12:02,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:12:02,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1012594892, now seen corresponding path program 3 times [2024-10-31 22:12:02,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:12:02,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543532027] [2024-10-31 22:12:02,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:12:02,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:12:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:02,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:12:02,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:12:02,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543532027] [2024-10-31 22:12:02,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543532027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:12:02,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:12:02,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:12:02,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797922081] [2024-10-31 22:12:02,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:12:02,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:12:02,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:12:02,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:12:02,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:12:02,787 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2024-10-31 22:12:02,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 69 transitions, 365 flow. Second operand has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 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-10-31 22:12:02,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:12:02,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2024-10-31 22:12:02,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:12:06,794 INFO L124 PetriNetUnfolderBase]: 15661/22591 cut-off events. [2024-10-31 22:12:06,794 INFO L125 PetriNetUnfolderBase]: For 33380/35791 co-relation queries the response was YES. [2024-10-31 22:12:06,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70966 conditions, 22591 events. 15661/22591 cut-off events. For 33380/35791 co-relation queries the response was YES. Maximal size of possible extension queue 1413. Compared 148973 event pairs, 1466 based on Foata normal form. 2516/24878 useless extension candidates. Maximal degree in co-relation 58339. Up to 8129 conditions per place. [2024-10-31 22:12:07,063 INFO L140 encePairwiseOnDemand]: 32/46 looper letters, 288 selfloop transitions, 95 changer transitions 0/393 dead transitions. [2024-10-31 22:12:07,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 393 transitions, 2795 flow [2024-10-31 22:12:07,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-31 22:12:07,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-10-31 22:12:07,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 492 transitions. [2024-10-31 22:12:07,067 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6684782608695652 [2024-10-31 22:12:07,067 INFO L175 Difference]: Start difference. First operand has 61 places, 69 transitions, 365 flow. Second operand 16 states and 492 transitions. [2024-10-31 22:12:07,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 393 transitions, 2795 flow [2024-10-31 22:12:07,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 393 transitions, 2726 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:12:07,144 INFO L231 Difference]: Finished difference. Result has 89 places, 168 transitions, 1485 flow [2024-10-31 22:12:07,145 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1485, PETRI_PLACES=89, PETRI_TRANSITIONS=168} [2024-10-31 22:12:07,145 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 39 predicate places. [2024-10-31 22:12:07,146 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 168 transitions, 1485 flow [2024-10-31 22:12:07,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 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-10-31 22:12:07,147 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:12:07,147 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] [2024-10-31 22:12:07,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:12:07,149 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-31 22:12:07,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:12:07,149 INFO L85 PathProgramCache]: Analyzing trace with hash -389296394, now seen corresponding path program 1 times [2024-10-31 22:12:07,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:12:07,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58004861] [2024-10-31 22:12:07,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:12:07,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:12:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:07,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:12:07,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:12:07,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58004861] [2024-10-31 22:12:07,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58004861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:12:07,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:12:07,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:12:07,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657769530] [2024-10-31 22:12:07,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:12:07,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:12:07,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:12:07,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:12:07,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:12:07,435 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-10-31 22:12:07,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 168 transitions, 1485 flow. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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-10-31 22:12:07,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:12:07,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-10-31 22:12:07,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:12:11,256 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L93-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.base_1| 0) (= (mod v_thread3Thread1of1ForFork0_~cond~2_5 256) 0) (= |v_thread3Thread1of1ForFork0_#res.offset_1| 0)) InVars {thread3Thread1of1ForFork0_~cond~2=v_thread3Thread1of1ForFork0_~cond~2_5} OutVars{thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_1|, thread3Thread1of1ForFork0_~cond~2=v_thread3Thread1of1ForFork0_~cond~2_5, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][182], [Black: 101#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)))), Black: 96#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), Black: 103#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), Black: 98#(<= ~n1~0 0), 33#L74true, 44#L112true, Black: 70#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 79#(<= 1 ~n2~0), Black: 80#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 76#(= ~n2~0 ~n1~0), Black: 86#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 84#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 82#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)))), 16#thread3EXITtrue, 5#L133-1true, 140#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 74#true, Black: 113#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0) (= thread4Thread1of1ForFork2_~cond~3 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 111#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), Black: 99#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 107#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (= ~n2~0 ~n1~0) (or (< ~n1~0 1) (< 0 thread3Thread1of1ForFork0_~cond~2)) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (= thread3Thread1of1ForFork0_~cond~2 0))), 64#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 109#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 117#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 93#true, Black: 105#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 97#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (or (< ~n1~0 1) (and (<= 1 thread3Thread1of1ForFork0_~cond~2) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)))), Black: 60#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 95#(= ~n2~0 ~n1~0), Black: 115#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (<= ~n1~0 0))]) [2024-10-31 22:12:11,257 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-10-31 22:12:11,257 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-31 22:12:11,257 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-31 22:12:11,257 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-31 22:12:11,850 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L93-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.base_1| 0) (= (mod v_thread3Thread1of1ForFork0_~cond~2_5 256) 0) (= |v_thread3Thread1of1ForFork0_#res.offset_1| 0)) InVars {thread3Thread1of1ForFork0_~cond~2=v_thread3Thread1of1ForFork0_~cond~2_5} OutVars{thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_1|, thread3Thread1of1ForFork0_~cond~2=v_thread3Thread1of1ForFork0_~cond~2_5, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][182], [Black: 101#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)))), Black: 96#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), Black: 103#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), Black: 98#(<= ~n1~0 0), 44#L112true, Black: 70#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), Black: 64#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 79#(<= 1 ~n2~0), Black: 80#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 76#(= ~n2~0 ~n1~0), Black: 86#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 84#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 82#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)))), 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), 16#thread3EXITtrue, 5#L133-1true, 140#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 74#true, Black: 113#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0) (= thread4Thread1of1ForFork2_~cond~3 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 111#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), Black: 99#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 107#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (= ~n2~0 ~n1~0) (or (< ~n1~0 1) (< 0 thread3Thread1of1ForFork0_~cond~2)) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (= thread3Thread1of1ForFork0_~cond~2 0))), 31#thread2EXITtrue, Black: 109#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 117#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 93#true, Black: 105#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 60#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 97#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (or (< ~n1~0 1) (and (<= 1 thread3Thread1of1ForFork0_~cond~2) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)))), Black: 95#(= ~n2~0 ~n1~0), Black: 115#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (<= ~n1~0 0))]) [2024-10-31 22:12:11,850 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-10-31 22:12:11,850 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-31 22:12:11,851 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-31 22:12:11,851 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-31 22:12:12,467 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L93-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.base_1| 0) (= (mod v_thread3Thread1of1ForFork0_~cond~2_5 256) 0) (= |v_thread3Thread1of1ForFork0_#res.offset_1| 0)) InVars {thread3Thread1of1ForFork0_~cond~2=v_thread3Thread1of1ForFork0_~cond~2_5} OutVars{thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_1|, thread3Thread1of1ForFork0_~cond~2=v_thread3Thread1of1ForFork0_~cond~2_5, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][166], [Black: 101#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)))), Black: 96#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), Black: 103#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), Black: 98#(<= ~n1~0 0), 44#L112true, Black: 70#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), Black: 64#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 79#(<= 1 ~n2~0), Black: 80#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), 138#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 76#(= ~n2~0 ~n1~0), Black: 86#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 84#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 82#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)))), 16#thread3EXITtrue, 43#L71true, 5#L133-1true, 74#true, Black: 113#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0) (= thread4Thread1of1ForFork2_~cond~3 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 111#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), Black: 99#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 107#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (= ~n2~0 ~n1~0) (or (< ~n1~0 1) (< 0 thread3Thread1of1ForFork0_~cond~2)) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (= thread3Thread1of1ForFork0_~cond~2 0))), Black: 109#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0) (= thread4Thread1of1ForFork2_~cond~3 0)), 93#true, Black: 117#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 105#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 60#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 97#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (or (< ~n1~0 1) (and (<= 1 thread3Thread1of1ForFork0_~cond~2) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)))), Black: 95#(= ~n2~0 ~n1~0), Black: 115#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (<= ~n1~0 0))]) [2024-10-31 22:12:12,468 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-10-31 22:12:12,468 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-31 22:12:12,468 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-31 22:12:12,468 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-31 22:12:12,470 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L93-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.base_1| 0) (= (mod v_thread3Thread1of1ForFork0_~cond~2_5 256) 0) (= |v_thread3Thread1of1ForFork0_#res.offset_1| 0)) InVars {thread3Thread1of1ForFork0_~cond~2=v_thread3Thread1of1ForFork0_~cond~2_5} OutVars{thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_1|, thread3Thread1of1ForFork0_~cond~2=v_thread3Thread1of1ForFork0_~cond~2_5, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][182], [Black: 101#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)))), Black: 96#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), Black: 103#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), Black: 98#(<= ~n1~0 0), 44#L112true, Black: 70#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), Black: 64#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 79#(<= 1 ~n2~0), Black: 80#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 76#(= ~n2~0 ~n1~0), Black: 86#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 84#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 82#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)))), 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), 16#thread3EXITtrue, 140#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 74#true, Black: 113#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0) (= thread4Thread1of1ForFork2_~cond~3 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 111#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), Black: 99#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 28#L134true, Black: 107#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (= ~n2~0 ~n1~0) (or (< ~n1~0 1) (< 0 thread3Thread1of1ForFork0_~cond~2)) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (= thread3Thread1of1ForFork0_~cond~2 0))), Black: 109#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 117#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 93#true, Black: 105#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 60#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 97#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (or (< ~n1~0 1) (and (<= 1 thread3Thread1of1ForFork0_~cond~2) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)))), Black: 95#(= ~n2~0 ~n1~0), Black: 115#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (<= ~n1~0 0))]) [2024-10-31 22:12:12,471 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-10-31 22:12:12,471 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-31 22:12:12,471 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-31 22:12:12,471 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-31 22:12:12,984 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L93-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.base_1| 0) (= (mod v_thread3Thread1of1ForFork0_~cond~2_5 256) 0) (= |v_thread3Thread1of1ForFork0_#res.offset_1| 0)) InVars {thread3Thread1of1ForFork0_~cond~2=v_thread3Thread1of1ForFork0_~cond~2_5} OutVars{thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_1|, thread3Thread1of1ForFork0_~cond~2=v_thread3Thread1of1ForFork0_~cond~2_5, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][166], [Black: 101#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)))), Black: 96#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), Black: 103#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), Black: 98#(<= ~n1~0 0), Black: 70#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), Black: 64#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 79#(<= 1 ~n2~0), Black: 80#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), 138#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 76#(= ~n2~0 ~n1~0), Black: 86#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 84#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)), 19#L109true, Black: 82#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)))), 16#thread3EXITtrue, 43#L71true, 5#L133-1true, 74#true, Black: 113#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0) (= thread4Thread1of1ForFork2_~cond~3 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 111#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), Black: 99#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 107#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (= ~n2~0 ~n1~0) (or (< ~n1~0 1) (< 0 thread3Thread1of1ForFork0_~cond~2)) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (= thread3Thread1of1ForFork0_~cond~2 0))), Black: 109#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 117#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 93#true, Black: 105#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 97#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (or (< ~n1~0 1) (and (<= 1 thread3Thread1of1ForFork0_~cond~2) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)))), Black: 60#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 95#(= ~n2~0 ~n1~0), Black: 115#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (<= ~n1~0 0))]) [2024-10-31 22:12:12,985 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-31 22:12:12,985 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-31 22:12:12,985 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-31 22:12:12,986 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-31 22:12:12,986 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([381] L85-->L90: Formula: (or (and (= v_~p2~0_98 v_~p2~0_97) (= |v_thread3Thread1of1ForFork0_#t~post2_2| |v_thread3Thread1of1ForFork0_#t~post2_1|) (<= v_~n2~0_87 0) (= v_~n2~0_87 v_~n2~0_86)) (and (< 0 v_~n2~0_87) (= (+ v_~n2~0_86 1) v_~n2~0_87) (= (+ v_~m~0_85 v_~p2~0_98) v_~p2~0_97))) InVars {~p2~0=v_~p2~0_98, ~m~0=v_~m~0_85, ~n2~0=v_~n2~0_87, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_1|} OutVars{~p2~0=v_~p2~0_97, ~m~0=v_~m~0_85, ~n2~0=v_~n2~0_86, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_2|} AuxVars[] AssignedVars[~n2~0, ~p2~0, thread3Thread1of1ForFork0_#t~post2][172], [Black: 101#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)))), Black: 96#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), Black: 103#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), Black: 98#(<= ~n1~0 0), Black: 70#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), Black: 64#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 79#(<= 1 ~n2~0), Black: 80#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), 138#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 76#(= ~n2~0 ~n1~0), Black: 86#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 84#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)), 19#L109true, Black: 82#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)))), 43#L71true, 5#L133-1true, 74#true, Black: 113#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0) (= thread4Thread1of1ForFork2_~cond~3 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 111#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), Black: 99#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 35#L90true, Black: 107#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (= ~n2~0 ~n1~0) (or (< ~n1~0 1) (< 0 thread3Thread1of1ForFork0_~cond~2)) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (= thread3Thread1of1ForFork0_~cond~2 0))), Black: 109#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 117#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 93#true, Black: 105#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 97#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (or (< ~n1~0 1) (and (<= 1 thread3Thread1of1ForFork0_~cond~2) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)))), Black: 60#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 95#(= ~n2~0 ~n1~0), Black: 115#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (<= ~n1~0 0))]) [2024-10-31 22:12:12,987 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-10-31 22:12:12,987 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-31 22:12:12,987 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-31 22:12:12,987 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-31 22:12:13,499 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L93-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.base_1| 0) (= (mod v_thread3Thread1of1ForFork0_~cond~2_5 256) 0) (= |v_thread3Thread1of1ForFork0_#res.offset_1| 0)) InVars {thread3Thread1of1ForFork0_~cond~2=v_thread3Thread1of1ForFork0_~cond~2_5} OutVars{thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_1|, thread3Thread1of1ForFork0_~cond~2=v_thread3Thread1of1ForFork0_~cond~2_5, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][166], [Black: 101#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)))), Black: 96#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), Black: 103#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), Black: 98#(<= ~n1~0 0), 44#L112true, Black: 64#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 79#(<= 1 ~n2~0), Black: 80#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), 138#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 76#(= ~n2~0 ~n1~0), Black: 86#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 84#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 82#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)))), 16#thread3EXITtrue, 70#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 74#true, Black: 113#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0) (= thread4Thread1of1ForFork2_~cond~3 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 111#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), 28#L134true, Black: 99#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 107#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (= ~n2~0 ~n1~0) (or (< ~n1~0 1) (< 0 thread3Thread1of1ForFork0_~cond~2)) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (= thread3Thread1of1ForFork0_~cond~2 0))), Black: 109#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 117#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 93#true, Black: 105#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 97#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (or (< ~n1~0 1) (and (<= 1 thread3Thread1of1ForFork0_~cond~2) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)))), Black: 60#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 95#(= ~n2~0 ~n1~0), Black: 115#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (<= ~n1~0 0))]) [2024-10-31 22:12:13,500 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-10-31 22:12:13,500 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-31 22:12:13,501 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-31 22:12:13,501 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-31 22:12:13,631 INFO L124 PetriNetUnfolderBase]: 24934/36189 cut-off events. [2024-10-31 22:12:13,631 INFO L125 PetriNetUnfolderBase]: For 200860/204542 co-relation queries the response was YES. [2024-10-31 22:12:13,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160325 conditions, 36189 events. 24934/36189 cut-off events. For 200860/204542 co-relation queries the response was YES. Maximal size of possible extension queue 1991. Compared 257277 event pairs, 4843 based on Foata normal form. 1266/36261 useless extension candidates. Maximal degree in co-relation 135586. Up to 14471 conditions per place. [2024-10-31 22:12:14,428 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 227 selfloop transitions, 61 changer transitions 0/317 dead transitions. [2024-10-31 22:12:14,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 317 transitions, 3238 flow [2024-10-31 22:12:14,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:12:14,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-31 22:12:14,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2024-10-31 22:12:14,434 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7260869565217392 [2024-10-31 22:12:14,435 INFO L175 Difference]: Start difference. First operand has 89 places, 168 transitions, 1485 flow. Second operand 5 states and 167 transitions. [2024-10-31 22:12:14,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 317 transitions, 3238 flow [2024-10-31 22:12:15,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 317 transitions, 3180 flow, removed 29 selfloop flow, removed 0 redundant places. [2024-10-31 22:12:15,366 INFO L231 Difference]: Finished difference. Result has 96 places, 179 transitions, 1756 flow [2024-10-31 22:12:15,367 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1463, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1756, PETRI_PLACES=96, PETRI_TRANSITIONS=179} [2024-10-31 22:12:15,368 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 46 predicate places. [2024-10-31 22:12:15,368 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 179 transitions, 1756 flow [2024-10-31 22:12:15,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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-10-31 22:12:15,369 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:12:15,369 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] [2024-10-31 22:12:15,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:12:15,369 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-31 22:12:15,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:12:15,370 INFO L85 PathProgramCache]: Analyzing trace with hash -547721406, now seen corresponding path program 4 times [2024-10-31 22:12:15,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:12:15,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023193297] [2024-10-31 22:12:15,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:12:15,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:12:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:15,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:12:15,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:12:15,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023193297] [2024-10-31 22:12:15,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023193297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:12:15,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:12:15,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:12:15,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251656110] [2024-10-31 22:12:15,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:12:15,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:12:15,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:12:15,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:12:15,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:12:15,703 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-10-31 22:12:15,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 179 transitions, 1756 flow. Second operand has 7 states, 7 states have (on average 20.428571428571427) internal successors, (143), 7 states have internal predecessors, (143), 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-10-31 22:12:15,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:12:15,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-10-31 22:12:15,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:12:22,640 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L93-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.base_1| 0) (= (mod v_thread3Thread1of1ForFork0_~cond~2_5 256) 0) (= |v_thread3Thread1of1ForFork0_#res.offset_1| 0)) InVars {thread3Thread1of1ForFork0_~cond~2=v_thread3Thread1of1ForFork0_~cond~2_5} OutVars{thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_1|, thread3Thread1of1ForFork0_~cond~2=v_thread3Thread1of1ForFork0_~cond~2_5, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][81], [Black: 101#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)))), Black: 96#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), Black: 103#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), Black: 98#(<= ~n1~0 0), 44#L112true, Black: 70#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), Black: 64#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 140#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 138#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 134#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))), Black: 79#(<= 1 ~n2~0), Black: 80#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 76#(= ~n2~0 ~n1~0), Black: 86#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 84#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 82#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)))), 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), 132#true, 16#thread3EXITtrue, 74#true, Black: 113#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0) (= thread4Thread1of1ForFork2_~cond~3 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 111#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), Black: 99#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 28#L134true, Black: 107#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (= ~n2~0 ~n1~0) (or (< ~n1~0 1) (< 0 thread3Thread1of1ForFork0_~cond~2)) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (= thread3Thread1of1ForFork0_~cond~2 0))), Black: 109#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 117#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 93#true, Black: 105#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 144#true, Black: 97#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (or (< ~n1~0 1) (and (<= 1 thread3Thread1of1ForFork0_~cond~2) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)))), Black: 60#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 95#(= ~n2~0 ~n1~0), Black: 115#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (<= ~n1~0 0))]) [2024-10-31 22:12:22,641 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-10-31 22:12:22,641 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-31 22:12:22,641 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-31 22:12:22,641 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-31 22:12:22,642 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([381] L85-->L90: Formula: (or (and (= v_~p2~0_98 v_~p2~0_97) (= |v_thread3Thread1of1ForFork0_#t~post2_2| |v_thread3Thread1of1ForFork0_#t~post2_1|) (<= v_~n2~0_87 0) (= v_~n2~0_87 v_~n2~0_86)) (and (< 0 v_~n2~0_87) (= (+ v_~n2~0_86 1) v_~n2~0_87) (= (+ v_~m~0_85 v_~p2~0_98) v_~p2~0_97))) InVars {~p2~0=v_~p2~0_98, ~m~0=v_~m~0_85, ~n2~0=v_~n2~0_87, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_1|} OutVars{~p2~0=v_~p2~0_97, ~m~0=v_~m~0_85, ~n2~0=v_~n2~0_86, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_2|} AuxVars[] AssignedVars[~n2~0, ~p2~0, thread3Thread1of1ForFork0_#t~post2][112], [Black: 101#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)))), Black: 96#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), Black: 103#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0)), Black: 98#(<= ~n1~0 0), 44#L112true, Black: 70#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), Black: 64#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 140#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 138#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 134#(or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))), Black: 79#(<= 1 ~n2~0), Black: 80#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 76#(= ~n2~0 ~n1~0), Black: 86#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 84#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 82#(and (= ~n2~0 ~n1~0) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)))), 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), 132#true, 74#true, Black: 113#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0) (= thread4Thread1of1ForFork2_~cond~3 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 111#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= ~n2~0 ~n1~0) (< 0 ~n2~0))), Black: 99#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 28#L134true, 35#L90true, Black: 107#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (= ~n2~0 ~n1~0) (or (< ~n1~0 1) (< 0 thread3Thread1of1ForFork0_~cond~2)) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (= thread3Thread1of1ForFork0_~cond~2 0))), Black: 109#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0) (= thread4Thread1of1ForFork2_~cond~3 0)), Black: 117#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 93#true, Black: 105#(and (= ~n2~0 ~n1~0) (<= ~n1~0 0) (= thread3Thread1of1ForFork0_~cond~2 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 97#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (or (< ~n1~0 1) (and (<= 1 thread3Thread1of1ForFork0_~cond~2) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)))), 144#true, Black: 60#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 95#(= ~n2~0 ~n1~0), Black: 115#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (<= ~n1~0 0))]) [2024-10-31 22:12:22,642 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-10-31 22:12:22,642 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-31 22:12:22,642 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-31 22:12:22,642 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-31 22:12:22,827 INFO L124 PetriNetUnfolderBase]: 30849/45850 cut-off events. [2024-10-31 22:12:22,828 INFO L125 PetriNetUnfolderBase]: For 285263/291800 co-relation queries the response was YES. [2024-10-31 22:12:23,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219413 conditions, 45850 events. 30849/45850 cut-off events. For 285263/291800 co-relation queries the response was YES. Maximal size of possible extension queue 3071. Compared 348802 event pairs, 5297 based on Foata normal form. 4915/49247 useless extension candidates. Maximal degree in co-relation 168327. Up to 20673 conditions per place. [2024-10-31 22:12:23,375 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 311 selfloop transitions, 146 changer transitions 1/478 dead transitions. [2024-10-31 22:12:23,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 478 transitions, 5638 flow [2024-10-31 22:12:23,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:12:23,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-31 22:12:23,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 315 transitions. [2024-10-31 22:12:23,377 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6847826086956522 [2024-10-31 22:12:23,377 INFO L175 Difference]: Start difference. First operand has 96 places, 179 transitions, 1756 flow. Second operand 10 states and 315 transitions. [2024-10-31 22:12:23,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 478 transitions, 5638 flow [2024-10-31 22:12:25,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 478 transitions, 5462 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:12:25,320 INFO L231 Difference]: Finished difference. Result has 112 places, 287 transitions, 3742 flow [2024-10-31 22:12:25,321 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1698, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3742, PETRI_PLACES=112, PETRI_TRANSITIONS=287} [2024-10-31 22:12:25,322 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 62 predicate places. [2024-10-31 22:12:25,323 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 287 transitions, 3742 flow [2024-10-31 22:12:25,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.428571428571427) internal successors, (143), 7 states have internal predecessors, (143), 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-10-31 22:12:25,323 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:12:25,324 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] [2024-10-31 22:12:25,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:12:25,324 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-31 22:12:25,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:12:25,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1366530340, now seen corresponding path program 1 times [2024-10-31 22:12:25,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:12:25,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902521958] [2024-10-31 22:12:25,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:12:25,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:12:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:25,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:12:25,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:12:25,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902521958] [2024-10-31 22:12:25,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902521958] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:12:25,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:12:25,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:12:25,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116875707] [2024-10-31 22:12:25,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:12:25,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:12:25,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:12:25,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:12:25,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:12:25,853 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2024-10-31 22:12:25,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 287 transitions, 3742 flow. Second operand has 8 states, 8 states have (on average 17.125) internal successors, (137), 8 states have internal predecessors, (137), 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-10-31 22:12:25,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:12:25,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2024-10-31 22:12:25,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand