./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-bad-dot-product.wvr.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 273a578a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-dot-product.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1890d03ecee4b13e5a6c0f8c72292cb7ef9118f93d1435df375cec86140a0197 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-273a578-m [2024-02-19 14:47:27,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 14:47:27,704 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-19 14:47:27,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 14:47:27,708 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 14:47:27,835 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 14:47:27,835 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 14:47:27,836 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 14:47:27,836 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 14:47:27,837 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 14:47:27,837 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 14:47:27,837 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 14:47:27,838 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 14:47:27,838 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 14:47:27,838 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 14:47:27,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 14:47:27,839 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 14:47:27,839 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 14:47:27,839 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-19 14:47:27,840 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 14:47:27,840 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 14:47:27,840 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 14:47:27,840 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 14:47:27,841 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 14:47:27,841 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 14:47:27,841 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 14:47:27,841 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 14:47:27,842 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 14:47:27,842 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 14:47:27,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 14:47:27,842 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 14:47:27,843 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 14:47:27,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:47:27,843 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 14:47:27,843 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 14:47:27,844 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 14:47:27,844 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-19 14:47:27,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-19 14:47:27,844 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 14:47:27,845 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 14:47:27,845 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 14:47:27,845 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 14:47:27,845 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 14:47:27,845 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1890d03ecee4b13e5a6c0f8c72292cb7ef9118f93d1435df375cec86140a0197 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 14:47:28,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 14:47:28,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 14:47:28,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 14:47:28,088 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 14:47:28,088 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 14:47:28,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-dot-product.wvr.c [2024-02-19 14:47:29,213 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 14:47:29,386 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 14:47:29,389 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product.wvr.c [2024-02-19 14:47:29,398 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57a685619/a40dda4b6e8448ffb338f38628cfc6c9/FLAG3e709b82f [2024-02-19 14:47:29,413 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57a685619/a40dda4b6e8448ffb338f38628cfc6c9 [2024-02-19 14:47:29,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 14:47:29,417 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 14:47:29,419 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 14:47:29,419 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 14:47:29,423 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 14:47:29,424 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:47:29" (1/1) ... [2024-02-19 14:47:29,424 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@226231a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:29, skipping insertion in model container [2024-02-19 14:47:29,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:47:29" (1/1) ... [2024-02-19 14:47:29,447 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 14:47:29,624 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product.wvr.c[2865,2878] [2024-02-19 14:47:29,635 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:47:29,644 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 14:47:29,676 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product.wvr.c[2865,2878] [2024-02-19 14:47:29,681 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:47:29,699 INFO L206 MainTranslator]: Completed translation [2024-02-19 14:47:29,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:29 WrapperNode [2024-02-19 14:47:29,699 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 14:47:29,701 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 14:47:29,701 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 14:47:29,701 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 14:47:29,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:29" (1/1) ... [2024-02-19 14:47:29,722 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:29" (1/1) ... [2024-02-19 14:47:29,757 INFO L138 Inliner]: procedures = 26, calls = 55, calls flagged for inlining = 16, calls inlined = 22, statements flattened = 287 [2024-02-19 14:47:29,759 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 14:47:29,760 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 14:47:29,760 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 14:47:29,760 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 14:47:29,768 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:29" (1/1) ... [2024-02-19 14:47:29,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:29" (1/1) ... [2024-02-19 14:47:29,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:29" (1/1) ... [2024-02-19 14:47:29,802 INFO L175 MemorySlicer]: Split 19 memory accesses to 5 slices as follows [2, 2, 2, 11, 2]. 58 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 5 writes are split as follows [0, 1, 1, 2, 1]. [2024-02-19 14:47:29,807 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:29" (1/1) ... [2024-02-19 14:47:29,807 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:29" (1/1) ... [2024-02-19 14:47:29,814 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:29" (1/1) ... [2024-02-19 14:47:29,823 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:29" (1/1) ... [2024-02-19 14:47:29,829 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:29" (1/1) ... [2024-02-19 14:47:29,831 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:29" (1/1) ... [2024-02-19 14:47:29,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 14:47:29,836 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 14:47:29,836 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 14:47:29,836 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 14:47:29,837 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:29" (1/1) ... [2024-02-19 14:47:29,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:47:29,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:47:29,870 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-19 14:47:29,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-19 14:47:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 14:47:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 14:47:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-19 14:47:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-19 14:47:29,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-19 14:47:29,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-19 14:47:29,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-19 14:47:29,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-19 14:47:29,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-19 14:47:29,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-19 14:47:29,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-19 14:47:29,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-19 14:47:29,910 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 14:47:29,910 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 14:47:29,910 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 14:47:29,910 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 14:47:29,910 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-19 14:47:29,910 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-19 14:47:29,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-19 14:47:29,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-19 14:47:29,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-19 14:47:29,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-19 14:47:29,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-19 14:47:29,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-19 14:47:29,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-19 14:47:29,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-19 14:47:29,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 14:47:29,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 14:47:29,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 14:47:29,927 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-19 14:47:30,018 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 14:47:30,020 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 14:47:30,379 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 14:47:30,380 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 14:47:30,681 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 14:47:30,681 INFO L320 CfgBuilder]: Removed 8 assume(true) statements. [2024-02-19 14:47:30,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:47:30 BoogieIcfgContainer [2024-02-19 14:47:30,681 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 14:47:30,683 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 14:47:30,683 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 14:47:30,685 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 14:47:30,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 02:47:29" (1/3) ... [2024-02-19 14:47:30,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1276efc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:47:30, skipping insertion in model container [2024-02-19 14:47:30,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:29" (2/3) ... [2024-02-19 14:47:30,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1276efc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:47:30, skipping insertion in model container [2024-02-19 14:47:30,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:47:30" (3/3) ... [2024-02-19 14:47:30,689 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-dot-product.wvr.c [2024-02-19 14:47:30,704 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 14:47:30,704 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 14:47:30,704 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 14:47:30,747 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-19 14:47:30,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 52 transitions, 125 flow [2024-02-19 14:47:30,810 INFO L124 PetriNetUnfolderBase]: 11/49 cut-off events. [2024-02-19 14:47:30,811 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-19 14:47:30,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 11/49 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 91 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2024-02-19 14:47:30,815 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 52 transitions, 125 flow [2024-02-19 14:47:30,818 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 48 transitions, 114 flow [2024-02-19 14:47:30,825 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 14:47:30,830 INFO L369 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@56769433, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 14:47:30,830 INFO L370 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-02-19 14:47:30,846 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 14:47:30,846 INFO L124 PetriNetUnfolderBase]: 11/47 cut-off events. [2024-02-19 14:47:30,846 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-19 14:47:30,846 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:47:30,847 INFO L234 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] [2024-02-19 14:47:30,847 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 14:47:30,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:47:30,852 INFO L85 PathProgramCache]: Analyzing trace with hash -990683623, now seen corresponding path program 1 times [2024-02-19 14:47:30,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:47:30,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502770338] [2024-02-19 14:47:30,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:47:30,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:47:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:47:31,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:47:31,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:47:31,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502770338] [2024-02-19 14:47:31,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502770338] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:47:31,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:47:31,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 14:47:31,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145613498] [2024-02-19 14:47:31,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:47:31,206 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:47:31,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:47:31,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:47:31,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:47:31,249 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52 [2024-02-19 14:47:31,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 48 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-02-19 14:47:31,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:47:31,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52 [2024-02-19 14:47:31,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:47:31,858 INFO L124 PetriNetUnfolderBase]: 4623/6297 cut-off events. [2024-02-19 14:47:31,859 INFO L125 PetriNetUnfolderBase]: For 290/290 co-relation queries the response was YES. [2024-02-19 14:47:31,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12698 conditions, 6297 events. 4623/6297 cut-off events. For 290/290 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 31754 event pairs, 1074 based on Foata normal form. 612/5033 useless extension candidates. Maximal degree in co-relation 11206. Up to 3984 conditions per place. [2024-02-19 14:47:31,909 INFO L140 encePairwiseOnDemand]: 44/52 looper letters, 61 selfloop transitions, 4 changer transitions 1/73 dead transitions. [2024-02-19 14:47:31,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 73 transitions, 311 flow [2024-02-19 14:47:31,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:47:31,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:47:31,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-02-19 14:47:31,919 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6602564102564102 [2024-02-19 14:47:31,923 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2024-02-19 14:47:31,924 INFO L507 AbstractCegarLoop]: Abstraction has has 49 places, 73 transitions, 311 flow [2024-02-19 14:47:31,924 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-02-19 14:47:31,924 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:47:31,924 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:47:31,924 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-19 14:47:31,925 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 14:47:31,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:47:31,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1752203715, now seen corresponding path program 1 times [2024-02-19 14:47:31,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:47:31,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564836700] [2024-02-19 14:47:31,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:47:31,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:47:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:47:32,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 14:47:32,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:47:32,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564836700] [2024-02-19 14:47:32,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564836700] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:47:32,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:47:32,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:47:32,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442932417] [2024-02-19 14:47:32,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:47:32,079 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:47:32,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:47:32,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:47:32,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:47:32,080 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52 [2024-02-19 14:47:32,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 73 transitions, 311 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-02-19 14:47:32,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:47:32,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52 [2024-02-19 14:47:32,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:47:32,585 INFO L124 PetriNetUnfolderBase]: 4624/6300 cut-off events. [2024-02-19 14:47:32,586 INFO L125 PetriNetUnfolderBase]: For 547/725 co-relation queries the response was YES. [2024-02-19 14:47:32,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18810 conditions, 6300 events. 4624/6300 cut-off events. For 547/725 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 31695 event pairs, 1074 based on Foata normal form. 0/4448 useless extension candidates. Maximal degree in co-relation 16625. Up to 6103 conditions per place. [2024-02-19 14:47:32,623 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 64 selfloop transitions, 2 changer transitions 3/76 dead transitions. [2024-02-19 14:47:32,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 76 transitions, 461 flow [2024-02-19 14:47:32,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 14:47:32,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 14:47:32,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2024-02-19 14:47:32,627 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3942307692307692 [2024-02-19 14:47:32,628 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 5 predicate places. [2024-02-19 14:47:32,628 INFO L507 AbstractCegarLoop]: Abstraction has has 52 places, 76 transitions, 461 flow [2024-02-19 14:47:32,628 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-02-19 14:47:32,628 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:47:32,629 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:47:32,629 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-19 14:47:32,630 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 14:47:32,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:47:32,630 INFO L85 PathProgramCache]: Analyzing trace with hash -189857749, now seen corresponding path program 1 times [2024-02-19 14:47:32,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:47:32,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934575591] [2024-02-19 14:47:32,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:47:32,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:47:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:47:32,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 14:47:32,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:47:32,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934575591] [2024-02-19 14:47:32,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934575591] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:47:32,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:47:32,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 14:47:32,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932096829] [2024-02-19 14:47:32,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:47:32,779 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:47:32,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:47:32,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:47:32,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:47:32,787 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 52 [2024-02-19 14:47:32,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 76 transitions, 461 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-02-19 14:47:32,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:47:32,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 52 [2024-02-19 14:47:32,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:47:33,411 INFO L124 PetriNetUnfolderBase]: 5120/7088 cut-off events. [2024-02-19 14:47:33,412 INFO L125 PetriNetUnfolderBase]: For 2706/2752 co-relation queries the response was YES. [2024-02-19 14:47:33,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27480 conditions, 7088 events. 5120/7088 cut-off events. For 2706/2752 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 37357 event pairs, 578 based on Foata normal form. 0/5266 useless extension candidates. Maximal degree in co-relation 24383. Up to 6624 conditions per place. [2024-02-19 14:47:33,460 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 99 selfloop transitions, 6 changer transitions 3/114 dead transitions. [2024-02-19 14:47:33,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 114 transitions, 917 flow [2024-02-19 14:47:33,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 14:47:33,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 14:47:33,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2024-02-19 14:47:33,461 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2024-02-19 14:47:33,462 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 8 predicate places. [2024-02-19 14:47:33,462 INFO L507 AbstractCegarLoop]: Abstraction has has 55 places, 114 transitions, 917 flow [2024-02-19 14:47:33,462 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-02-19 14:47:33,462 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:47:33,462 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:47:33,462 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-19 14:47:33,463 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 14:47:33,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:47:33,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1994154269, now seen corresponding path program 1 times [2024-02-19 14:47:33,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:47:33,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618687315] [2024-02-19 14:47:33,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:47:33,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:47:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:47:33,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 14:47:33,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:47:33,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618687315] [2024-02-19 14:47:33,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618687315] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:47:33,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334728973] [2024-02-19 14:47:33,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:47:33,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:47:33,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:47:33,599 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:47:33,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-02-19 14:47:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:47:33,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-19 14:47:33,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:47:33,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 14:47:33,775 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:47:33,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 14:47:33,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334728973] provided 1 perfect and 1 imperfect interpolant sequences [2024-02-19 14:47:33,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-02-19 14:47:33,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2024-02-19 14:47:33,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136478475] [2024-02-19 14:47:33,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:47:33,812 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 14:47:33,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:47:33,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 14:47:33,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-02-19 14:47:33,816 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 52 [2024-02-19 14:47:33,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 114 transitions, 917 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-02-19 14:47:33,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:47:33,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 52 [2024-02-19 14:47:33,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:47:33,967 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L62-5-->L64-8: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~M~0_69) (not (= (ite (< (select (select |v_#memory_int#3_130| v_~A~0.base_79) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_3| 4) v_~A~0.offset_79)) v_~size~0_73) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~j~1#1_1| 0)) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} OutVars{~A~0.base=v_~A~0.base_79, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_1|, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~j~1#1=|v_thread2Thread1of1ForFork0_~j~1#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][43], [57#true, thread2Thread1of1ForFork0InUse, 25#L102-1true, 27#L49-5true, thread1Thread1of1ForFork2InUse, 37#L75-5true, thread3Thread1of1ForFork1InUse, 56#(= ~res2~0 ~res1~0), 46#L64-8true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:33,967 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-02-19 14:47:33,968 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2024-02-19 14:47:33,968 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2024-02-19 14:47:33,968 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:47:33,968 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L62-5-->thread2EXIT: Formula: (and (<= v_~M~0_71 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {~M~0=v_~M~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, ~M~0=v_~M~0_71, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1][44], [57#true, thread2Thread1of1ForFork0InUse, 25#L102-1true, 27#L49-5true, thread1Thread1of1ForFork2InUse, 37#L75-5true, thread3Thread1of1ForFork1InUse, 21#thread2EXITtrue, 56#(= ~res2~0 ~res1~0), 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:33,968 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-02-19 14:47:33,968 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2024-02-19 14:47:33,968 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2024-02-19 14:47:33,969 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:47:34,452 INFO L124 PetriNetUnfolderBase]: 5551/7775 cut-off events. [2024-02-19 14:47:34,453 INFO L125 PetriNetUnfolderBase]: For 8236/8267 co-relation queries the response was YES. [2024-02-19 14:47:34,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36819 conditions, 7775 events. 5551/7775 cut-off events. For 8236/8267 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 42075 event pairs, 296 based on Foata normal form. 16/6032 useless extension candidates. Maximal degree in co-relation 33005. Up to 7073 conditions per place. [2024-02-19 14:47:34,507 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 151 selfloop transitions, 11 changer transitions 3/171 dead transitions. [2024-02-19 14:47:34,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 171 transitions, 1715 flow [2024-02-19 14:47:34,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:47:34,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:47:34,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2024-02-19 14:47:34,510 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4153846153846154 [2024-02-19 14:47:34,512 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 12 predicate places. [2024-02-19 14:47:34,512 INFO L507 AbstractCegarLoop]: Abstraction has has 59 places, 171 transitions, 1715 flow [2024-02-19 14:47:34,512 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-02-19 14:47:34,512 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:47:34,512 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:47:34,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-02-19 14:47:34,736 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:47:34,736 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 14:47:34,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:47:34,737 INFO L85 PathProgramCache]: Analyzing trace with hash 716101403, now seen corresponding path program 1 times [2024-02-19 14:47:34,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:47:34,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410816835] [2024-02-19 14:47:34,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:47:34,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:47:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:47:34,870 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 14:47:34,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:47:34,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410816835] [2024-02-19 14:47:34,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410816835] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:47:34,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:47:34,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-19 14:47:34,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285825782] [2024-02-19 14:47:34,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:47:34,871 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 14:47:34,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:47:34,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 14:47:34,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-02-19 14:47:34,883 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 52 [2024-02-19 14:47:34,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 171 transitions, 1715 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-02-19 14:47:34,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:47:34,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 52 [2024-02-19 14:47:34,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:47:35,225 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L62-5-->L64-8: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~M~0_69) (not (= (ite (< (select (select |v_#memory_int#3_130| v_~A~0.base_79) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_3| 4) v_~A~0.offset_79)) v_~size~0_73) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~j~1#1_1| 0)) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} OutVars{~A~0.base=v_~A~0.base_79, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_1|, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~j~1#1=|v_thread2Thread1of1ForFork0_~j~1#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][73], [57#true, thread2Thread1of1ForFork0InUse, 27#L49-5true, 25#L102-1true, thread1Thread1of1ForFork2InUse, 37#L75-5true, thread3Thread1of1ForFork1InUse, 262#(<= ~size~0 0), 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 56#(= ~res2~0 ~res1~0), 46#L64-8true, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:35,226 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-02-19 14:47:35,226 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2024-02-19 14:47:35,226 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2024-02-19 14:47:35,226 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:47:35,226 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L62-5-->thread2EXIT: Formula: (and (<= v_~M~0_71 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {~M~0=v_~M~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, ~M~0=v_~M~0_71, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1][74], [57#true, thread2Thread1of1ForFork0InUse, 27#L49-5true, 25#L102-1true, thread1Thread1of1ForFork2InUse, 37#L75-5true, thread3Thread1of1ForFork1InUse, 262#(<= ~size~0 0), 21#thread2EXITtrue, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 56#(= ~res2~0 ~res1~0), 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:35,226 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-02-19 14:47:35,226 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:47:35,227 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2024-02-19 14:47:35,228 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2024-02-19 14:47:35,257 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L62-5-->L64-8: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~M~0_69) (not (= (ite (< (select (select |v_#memory_int#3_130| v_~A~0.base_79) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_3| 4) v_~A~0.offset_79)) v_~size~0_73) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~j~1#1_1| 0)) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} OutVars{~A~0.base=v_~A~0.base_79, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_1|, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~j~1#1=|v_thread2Thread1of1ForFork0_~j~1#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][91], [57#true, thread2Thread1of1ForFork0InUse, 27#L49-5true, thread1Thread1of1ForFork2InUse, 25#L102-1true, 37#L75-5true, thread3Thread1of1ForFork1InUse, 259#true, 46#L64-8true, 56#(= ~res2~0 ~res1~0), 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:35,257 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-02-19 14:47:35,257 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:47:35,257 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:47:35,257 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:47:35,258 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L62-5-->thread2EXIT: Formula: (and (<= v_~M~0_71 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {~M~0=v_~M~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, ~M~0=v_~M~0_71, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1][92], [57#true, thread2Thread1of1ForFork0InUse, 27#L49-5true, thread1Thread1of1ForFork2InUse, 25#L102-1true, 37#L75-5true, thread3Thread1of1ForFork1InUse, 21#thread2EXITtrue, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 56#(= ~res2~0 ~res1~0), 259#true, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:35,258 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-02-19 14:47:35,258 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:47:35,258 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:47:35,258 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:47:35,335 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L62-5-->L64-8: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~M~0_69) (not (= (ite (< (select (select |v_#memory_int#3_130| v_~A~0.base_79) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_3| 4) v_~A~0.offset_79)) v_~size~0_73) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~j~1#1_1| 0)) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} OutVars{~A~0.base=v_~A~0.base_79, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_1|, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~j~1#1=|v_thread2Thread1of1ForFork0_~j~1#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][112], [57#true, thread2Thread1of1ForFork0InUse, 25#L102-1true, thread1Thread1of1ForFork2InUse, 37#L75-5true, 268#(and (= |thread1Thread1of1ForFork2_#t~mem4#1| (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (+ (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1) 0) (= |thread1Thread1of1ForFork2_~j~0#1| 0) (<= ~size~0 0)), thread3Thread1of1ForFork1InUse, 14#L51-2true, 46#L64-8true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 56#(= ~res2~0 ~res1~0), 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:35,335 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-02-19 14:47:35,335 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:47:35,335 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:47:35,335 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:47:35,336 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L62-5-->thread2EXIT: Formula: (and (<= v_~M~0_71 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {~M~0=v_~M~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, ~M~0=v_~M~0_71, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1][113], [57#true, thread2Thread1of1ForFork0InUse, 25#L102-1true, thread1Thread1of1ForFork2InUse, 37#L75-5true, 268#(and (= |thread1Thread1of1ForFork2_#t~mem4#1| (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (+ (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1) 0) (= |thread1Thread1of1ForFork2_~j~0#1| 0) (<= ~size~0 0)), thread3Thread1of1ForFork1InUse, 14#L51-2true, 21#thread2EXITtrue, 56#(= ~res2~0 ~res1~0), 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:35,336 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-02-19 14:47:35,336 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:47:35,336 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:47:35,336 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:47:35,379 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L62-5-->L64-8: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~M~0_69) (not (= (ite (< (select (select |v_#memory_int#3_130| v_~A~0.base_79) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_3| 4) v_~A~0.offset_79)) v_~size~0_73) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~j~1#1_1| 0)) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} OutVars{~A~0.base=v_~A~0.base_79, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_1|, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~j~1#1=|v_thread2Thread1of1ForFork0_~j~1#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][91], [57#true, thread2Thread1of1ForFork0InUse, thread1Thread1of1ForFork2InUse, 25#L102-1true, 37#L75-5true, thread3Thread1of1ForFork1InUse, 14#L51-2true, 56#(= ~res2~0 ~res1~0), 46#L64-8true, 259#true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:35,379 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-02-19 14:47:35,380 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-19 14:47:35,380 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 14:47:35,380 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 14:47:35,380 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L62-5-->thread2EXIT: Formula: (and (<= v_~M~0_71 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {~M~0=v_~M~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, ~M~0=v_~M~0_71, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1][92], [thread2Thread1of1ForFork0InUse, 57#true, thread1Thread1of1ForFork2InUse, 25#L102-1true, 37#L75-5true, thread3Thread1of1ForFork1InUse, 14#L51-2true, 21#thread2EXITtrue, 259#true, 56#(= ~res2~0 ~res1~0), 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:35,380 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-02-19 14:47:35,380 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-19 14:47:35,380 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 14:47:35,380 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 14:47:35,812 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L62-5-->L64-8: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~M~0_69) (not (= (ite (< (select (select |v_#memory_int#3_130| v_~A~0.base_79) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_3| 4) v_~A~0.offset_79)) v_~size~0_73) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~j~1#1_1| 0)) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} OutVars{~A~0.base=v_~A~0.base_79, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_1|, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~j~1#1=|v_thread2Thread1of1ForFork0_~j~1#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][247], [57#true, thread2Thread1of1ForFork0InUse, thread1Thread1of1ForFork2InUse, 25#L102-1true, 37#L75-5true, thread3Thread1of1ForFork1InUse, 14#L51-2true, 46#L64-8true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 259#true, 54#true, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:35,812 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-02-19 14:47:35,812 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-19 14:47:35,813 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-02-19 14:47:35,813 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-19 14:47:35,813 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L62-5-->thread2EXIT: Formula: (and (<= v_~M~0_71 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {~M~0=v_~M~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, ~M~0=v_~M~0_71, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1][248], [thread2Thread1of1ForFork0InUse, 57#true, thread1Thread1of1ForFork2InUse, 25#L102-1true, 37#L75-5true, thread3Thread1of1ForFork1InUse, 14#L51-2true, 21#thread2EXITtrue, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 259#true, 54#true, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:35,813 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-02-19 14:47:35,813 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-19 14:47:35,813 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-02-19 14:47:35,813 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-19 14:47:36,186 INFO L124 PetriNetUnfolderBase]: 11122/15454 cut-off events. [2024-02-19 14:47:36,187 INFO L125 PetriNetUnfolderBase]: For 24907/25381 co-relation queries the response was YES. [2024-02-19 14:47:36,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87020 conditions, 15454 events. 11122/15454 cut-off events. For 24907/25381 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 88783 event pairs, 638 based on Foata normal form. 54/12067 useless extension candidates. Maximal degree in co-relation 44208. Up to 13868 conditions per place. [2024-02-19 14:47:36,326 INFO L140 encePairwiseOnDemand]: 44/52 looper letters, 390 selfloop transitions, 20 changer transitions 5/420 dead transitions. [2024-02-19 14:47:36,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 420 transitions, 5090 flow [2024-02-19 14:47:36,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 14:47:36,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 14:47:36,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2024-02-19 14:47:36,328 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5160256410256411 [2024-02-19 14:47:36,329 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 17 predicate places. [2024-02-19 14:47:36,329 INFO L507 AbstractCegarLoop]: Abstraction has has 64 places, 420 transitions, 5090 flow [2024-02-19 14:47:36,329 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-02-19 14:47:36,329 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:47:36,329 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:47:36,330 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-19 14:47:36,330 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 14:47:36,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:47:36,330 INFO L85 PathProgramCache]: Analyzing trace with hash -859017553, now seen corresponding path program 1 times [2024-02-19 14:47:36,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:47:36,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043267237] [2024-02-19 14:47:36,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:47:36,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:47:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:47:36,460 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 14:47:36,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:47:36,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043267237] [2024-02-19 14:47:36,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043267237] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:47:36,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:47:36,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-19 14:47:36,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600688597] [2024-02-19 14:47:36,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:47:36,462 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 14:47:36,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:47:36,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 14:47:36,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-02-19 14:47:36,476 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 52 [2024-02-19 14:47:36,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 420 transitions, 5090 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-02-19 14:47:36,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:47:36,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 52 [2024-02-19 14:47:36,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:47:36,852 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L62-5-->L64-8: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~M~0_69) (not (= (ite (< (select (select |v_#memory_int#3_130| v_~A~0.base_79) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_3| 4) v_~A~0.offset_79)) v_~size~0_73) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~j~1#1_1| 0)) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} OutVars{~A~0.base=v_~A~0.base_79, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_1|, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~j~1#1=|v_thread2Thread1of1ForFork0_~j~1#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][77], [37#L75-5true, 262#(<= ~size~0 0), 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 56#(= ~res2~0 ~res1~0), 57#true, thread2Thread1of1ForFork0InUse, 25#L102-1true, 27#L49-5true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 46#L64-8true, 272#(<= ~size~0 0), 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:36,852 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-02-19 14:47:36,853 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2024-02-19 14:47:36,853 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2024-02-19 14:47:36,853 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:47:36,853 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L62-5-->thread2EXIT: Formula: (and (<= v_~M~0_71 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {~M~0=v_~M~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, ~M~0=v_~M~0_71, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1][78], [37#L75-5true, 262#(<= ~size~0 0), 56#(= ~res2~0 ~res1~0), 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), thread2Thread1of1ForFork0InUse, 57#true, 25#L102-1true, 27#L49-5true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 21#thread2EXITtrue, 272#(<= ~size~0 0), 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:36,853 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-02-19 14:47:36,853 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2024-02-19 14:47:36,853 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2024-02-19 14:47:36,854 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:47:36,900 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L62-5-->L64-8: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~M~0_69) (not (= (ite (< (select (select |v_#memory_int#3_130| v_~A~0.base_79) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_3| 4) v_~A~0.offset_79)) v_~size~0_73) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~j~1#1_1| 0)) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} OutVars{~A~0.base=v_~A~0.base_79, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_1|, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~j~1#1=|v_thread2Thread1of1ForFork0_~j~1#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][92], [37#L75-5true, 269#true, 56#(= ~res2~0 ~res1~0), 259#true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), thread2Thread1of1ForFork0InUse, 57#true, 25#L102-1true, 27#L49-5true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 46#L64-8true, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:36,900 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-02-19 14:47:36,901 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:47:36,901 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:47:36,901 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:47:36,901 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L62-5-->thread2EXIT: Formula: (and (<= v_~M~0_71 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {~M~0=v_~M~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, ~M~0=v_~M~0_71, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1][93], [37#L75-5true, 269#true, 259#true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 56#(= ~res2~0 ~res1~0), thread2Thread1of1ForFork0InUse, 57#true, 25#L102-1true, 27#L49-5true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 21#thread2EXITtrue, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:36,901 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-02-19 14:47:36,901 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:47:36,901 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:47:36,902 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:47:37,027 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L62-5-->L64-8: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~M~0_69) (not (= (ite (< (select (select |v_#memory_int#3_130| v_~A~0.base_79) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_3| 4) v_~A~0.offset_79)) v_~size~0_73) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~j~1#1_1| 0)) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} OutVars{~A~0.base=v_~A~0.base_79, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_1|, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~j~1#1=|v_thread2Thread1of1ForFork0_~j~1#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][118], [37#L75-5true, 14#L51-2true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 56#(= ~res2~0 ~res1~0), thread2Thread1of1ForFork0InUse, 57#true, 25#L102-1true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 268#(and (= |thread1Thread1of1ForFork2_#t~mem4#1| (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (+ (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1) 0) (= |thread1Thread1of1ForFork2_~j~0#1| 0) (<= ~size~0 0)), 46#L64-8true, 272#(<= ~size~0 0), 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:37,027 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-02-19 14:47:37,027 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:47:37,027 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:47:37,028 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:47:37,028 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L62-5-->thread2EXIT: Formula: (and (<= v_~M~0_71 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {~M~0=v_~M~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, ~M~0=v_~M~0_71, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1][119], [37#L75-5true, 14#L51-2true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 56#(= ~res2~0 ~res1~0), thread2Thread1of1ForFork0InUse, 57#true, 25#L102-1true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 268#(and (= |thread1Thread1of1ForFork2_#t~mem4#1| (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (+ (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1) 0) (= |thread1Thread1of1ForFork2_~j~0#1| 0) (<= ~size~0 0)), 21#thread2EXITtrue, 272#(<= ~size~0 0), 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:37,028 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-02-19 14:47:37,028 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:47:37,028 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:47:37,028 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:47:37,088 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L62-5-->L64-8: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~M~0_69) (not (= (ite (< (select (select |v_#memory_int#3_130| v_~A~0.base_79) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_3| 4) v_~A~0.offset_79)) v_~size~0_73) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~j~1#1_1| 0)) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} OutVars{~A~0.base=v_~A~0.base_79, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_1|, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~j~1#1=|v_thread2Thread1of1ForFork0_~j~1#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][92], [37#L75-5true, 14#L51-2true, 269#true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 259#true, 56#(= ~res2~0 ~res1~0), thread2Thread1of1ForFork0InUse, 57#true, 25#L102-1true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 46#L64-8true, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:37,088 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-02-19 14:47:37,088 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 14:47:37,088 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 14:47:37,088 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-19 14:47:37,089 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L62-5-->thread2EXIT: Formula: (and (<= v_~M~0_71 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {~M~0=v_~M~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, ~M~0=v_~M~0_71, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1][93], [37#L75-5true, 14#L51-2true, 269#true, 56#(= ~res2~0 ~res1~0), 259#true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), thread2Thread1of1ForFork0InUse, 57#true, 25#L102-1true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 21#thread2EXITtrue, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:37,089 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-02-19 14:47:37,089 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 14:47:37,089 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 14:47:37,089 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-19 14:47:37,289 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L62-5-->L64-8: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~M~0_69) (not (= (ite (< (select (select |v_#memory_int#3_130| v_~A~0.base_79) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_3| 4) v_~A~0.offset_79)) v_~size~0_73) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~j~1#1_1| 0)) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} OutVars{~A~0.base=v_~A~0.base_79, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_1|, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~j~1#1=|v_thread2Thread1of1ForFork0_~j~1#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][200], [278#(and (= |thread3Thread1of1ForFork1_~j~2#1| 0) (<= ~size~0 0) (= (select (select |#memory_int#3| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_#t~mem16#1|) (<= (+ (select (select |#memory_int#3| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) 0)), 44#L77-2true, 14#L51-2true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 56#(= ~res2~0 ~res1~0), thread2Thread1of1ForFork0InUse, 57#true, 25#L102-1true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 268#(and (= |thread1Thread1of1ForFork2_#t~mem4#1| (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (+ (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1) 0) (= |thread1Thread1of1ForFork2_~j~0#1| 0) (<= ~size~0 0)), 46#L64-8true, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:37,289 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-02-19 14:47:37,289 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-02-19 14:47:37,289 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:47:37,289 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:47:37,290 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L62-5-->thread2EXIT: Formula: (and (<= v_~M~0_71 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {~M~0=v_~M~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, ~M~0=v_~M~0_71, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1][201], [278#(and (= |thread3Thread1of1ForFork1_~j~2#1| 0) (<= ~size~0 0) (= (select (select |#memory_int#3| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_#t~mem16#1|) (<= (+ (select (select |#memory_int#3| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) 0)), 44#L77-2true, 14#L51-2true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 56#(= ~res2~0 ~res1~0), 57#true, thread2Thread1of1ForFork0InUse, 25#L102-1true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 268#(and (= |thread1Thread1of1ForFork2_#t~mem4#1| (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (+ (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1) 0) (= |thread1Thread1of1ForFork2_~j~0#1| 0) (<= ~size~0 0)), 21#thread2EXITtrue, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:37,290 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-02-19 14:47:37,290 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-02-19 14:47:37,290 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:47:37,290 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:47:37,359 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L62-5-->L64-8: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~M~0_69) (not (= (ite (< (select (select |v_#memory_int#3_130| v_~A~0.base_79) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_3| 4) v_~A~0.offset_79)) v_~size~0_73) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~j~1#1_1| 0)) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} OutVars{~A~0.base=v_~A~0.base_79, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_1|, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~j~1#1=|v_thread2Thread1of1ForFork0_~j~1#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][92], [44#L77-2true, 14#L51-2true, 269#true, 259#true, 56#(= ~res2~0 ~res1~0), 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), thread2Thread1of1ForFork0InUse, 57#true, 25#L102-1true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 46#L64-8true, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:37,359 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-02-19 14:47:37,360 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-02-19 14:47:37,360 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:47:37,360 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:47:37,360 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L62-5-->thread2EXIT: Formula: (and (<= v_~M~0_71 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {~M~0=v_~M~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, ~M~0=v_~M~0_71, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1][93], [44#L77-2true, 14#L51-2true, 269#true, 56#(= ~res2~0 ~res1~0), 259#true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), thread2Thread1of1ForFork0InUse, 57#true, 25#L102-1true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 21#thread2EXITtrue, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:37,360 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-02-19 14:47:37,360 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-02-19 14:47:37,360 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:47:37,361 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:47:37,594 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L62-5-->L64-8: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~M~0_69) (not (= (ite (< (select (select |v_#memory_int#3_130| v_~A~0.base_79) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_3| 4) v_~A~0.offset_79)) v_~size~0_73) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~j~1#1_1| 0)) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} OutVars{~A~0.base=v_~A~0.base_79, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_1|, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~j~1#1=|v_thread2Thread1of1ForFork0_~j~1#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][279], [37#L75-5true, 14#L51-2true, 269#true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 259#true, 54#true, thread2Thread1of1ForFork0InUse, 57#true, 25#L102-1true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 46#L64-8true, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:37,594 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-02-19 14:47:37,594 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-19 14:47:37,594 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-02-19 14:47:37,594 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-19 14:47:37,594 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L62-5-->thread2EXIT: Formula: (and (<= v_~M~0_71 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {~M~0=v_~M~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, ~M~0=v_~M~0_71, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1][280], [37#L75-5true, 14#L51-2true, 269#true, 259#true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 54#true, thread2Thread1of1ForFork0InUse, 57#true, 25#L102-1true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 21#thread2EXITtrue, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:37,595 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-02-19 14:47:37,595 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-19 14:47:37,595 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-02-19 14:47:37,595 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-19 14:47:37,750 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L62-5-->L64-8: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~M~0_69) (not (= (ite (< (select (select |v_#memory_int#3_130| v_~A~0.base_79) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_3| 4) v_~A~0.offset_79)) v_~size~0_73) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~j~1#1_1| 0)) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} OutVars{~A~0.base=v_~A~0.base_79, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_1|, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~j~1#1=|v_thread2Thread1of1ForFork0_~j~1#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][279], [44#L77-2true, 14#L51-2true, 269#true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 259#true, 54#true, thread2Thread1of1ForFork0InUse, 57#true, 25#L102-1true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 46#L64-8true, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:37,751 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-02-19 14:47:37,751 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-02-19 14:47:37,751 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-02-19 14:47:37,751 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-02-19 14:47:37,751 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L62-5-->thread2EXIT: Formula: (and (<= v_~M~0_71 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {~M~0=v_~M~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, ~M~0=v_~M~0_71, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1][280], [44#L77-2true, 14#L51-2true, 269#true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 259#true, 54#true, thread2Thread1of1ForFork0InUse, 57#true, 25#L102-1true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 21#thread2EXITtrue, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:37,751 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-02-19 14:47:37,751 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-02-19 14:47:37,751 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-02-19 14:47:37,752 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-02-19 14:47:37,940 INFO L124 PetriNetUnfolderBase]: 11120/15206 cut-off events. [2024-02-19 14:47:37,940 INFO L125 PetriNetUnfolderBase]: For 43672/44050 co-relation queries the response was YES. [2024-02-19 14:47:37,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99728 conditions, 15206 events. 11120/15206 cut-off events. For 43672/44050 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 82946 event pairs, 722 based on Foata normal form. 32/11916 useless extension candidates. Maximal degree in co-relation 56808. Up to 13609 conditions per place. [2024-02-19 14:47:38,054 INFO L140 encePairwiseOnDemand]: 44/52 looper letters, 486 selfloop transitions, 36 changer transitions 29/558 dead transitions. [2024-02-19 14:47:38,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 558 transitions, 7854 flow [2024-02-19 14:47:38,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 14:47:38,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 14:47:38,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2024-02-19 14:47:38,056 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.48717948717948717 [2024-02-19 14:47:38,057 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 22 predicate places. [2024-02-19 14:47:38,057 INFO L507 AbstractCegarLoop]: Abstraction has has 69 places, 558 transitions, 7854 flow [2024-02-19 14:47:38,057 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-02-19 14:47:38,057 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:47:38,057 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:47:38,057 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-19 14:47:38,058 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 14:47:38,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:47:38,058 INFO L85 PathProgramCache]: Analyzing trace with hash -279813295, now seen corresponding path program 1 times [2024-02-19 14:47:38,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:47:38,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857690208] [2024-02-19 14:47:38,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:47:38,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:47:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:47:38,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 14:47:38,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:47:38,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857690208] [2024-02-19 14:47:38,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857690208] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:47:38,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997554716] [2024-02-19 14:47:38,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:47:38,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:47:38,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:47:38,197 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:47:38,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-02-19 14:47:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:47:38,304 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-19 14:47:38,306 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:47:38,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2024-02-19 14:47:38,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 14:47:38,379 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:47:38,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2024-02-19 14:47:38,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 14:47:38,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997554716] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:47:38,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:47:38,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-02-19 14:47:38,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270554005] [2024-02-19 14:47:38,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:47:38,443 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-19 14:47:38,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:47:38,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-19 14:47:38,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-02-19 14:47:38,466 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 52 [2024-02-19 14:47:38,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 558 transitions, 7854 flow. Second operand has 15 states, 15 states have (on average 10.933333333333334) internal successors, (164), 15 states have internal predecessors, (164), 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-02-19 14:47:38,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:47:38,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 52 [2024-02-19 14:47:38,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:47:39,163 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L62-5-->L64-8: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~M~0_69) (not (= (ite (< (select (select |v_#memory_int#3_130| v_~A~0.base_79) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_3| 4) v_~A~0.offset_79)) v_~size~0_73) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~j~1#1_1| 0)) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} OutVars{~A~0.base=v_~A~0.base_79, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_1|, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~j~1#1=|v_thread2Thread1of1ForFork0_~j~1#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][171], [37#L75-5true, 14#L51-2true, 56#(= ~res2~0 ~res1~0), 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 57#true, thread2Thread1of1ForFork0InUse, 25#L102-1true, thread1Thread1of1ForFork2InUse, 268#(and (= |thread1Thread1of1ForFork2_#t~mem4#1| (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (+ (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1) 0) (= |thread1Thread1of1ForFork2_~j~0#1| 0) (<= ~size~0 0)), thread3Thread1of1ForFork1InUse, 507#(and (= |thread1Thread1of1ForFork2_#t~mem4#1| (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= |thread1Thread1of1ForFork2_~j~0#1| 0) (<= ~size~0 1)), 46#L64-8true, 272#(<= ~size~0 0), 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:39,163 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-02-19 14:47:39,163 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:47:39,164 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:47:39,164 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:47:39,164 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L62-5-->thread2EXIT: Formula: (and (<= v_~M~0_71 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {~M~0=v_~M~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, ~M~0=v_~M~0_71, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1][172], [37#L75-5true, 14#L51-2true, 56#(= ~res2~0 ~res1~0), 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 57#true, thread2Thread1of1ForFork0InUse, 25#L102-1true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 268#(and (= |thread1Thread1of1ForFork2_#t~mem4#1| (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (+ (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1) 0) (= |thread1Thread1of1ForFork2_~j~0#1| 0) (<= ~size~0 0)), 507#(and (= |thread1Thread1of1ForFork2_#t~mem4#1| (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= |thread1Thread1of1ForFork2_~j~0#1| 0) (<= ~size~0 1)), 21#thread2EXITtrue, 272#(<= ~size~0 0), 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:39,164 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-02-19 14:47:39,164 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:47:39,164 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:47:39,164 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:47:39,274 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L62-5-->L64-8: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~M~0_69) (not (= (ite (< (select (select |v_#memory_int#3_130| v_~A~0.base_79) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_3| 4) v_~A~0.offset_79)) v_~size~0_73) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~j~1#1_1| 0)) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} OutVars{~A~0.base=v_~A~0.base_79, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_1|, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~j~1#1=|v_thread2Thread1of1ForFork0_~j~1#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][212], [37#L75-5true, 14#L51-2true, 269#true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 56#(= ~res2~0 ~res1~0), 259#true, 57#true, thread2Thread1of1ForFork0InUse, thread1Thread1of1ForFork2InUse, 25#L102-1true, thread3Thread1of1ForFork1InUse, 507#(and (= |thread1Thread1of1ForFork2_#t~mem4#1| (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= |thread1Thread1of1ForFork2_~j~0#1| 0) (<= ~size~0 1)), 46#L64-8true, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:39,274 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-02-19 14:47:39,274 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-19 14:47:39,274 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 14:47:39,274 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 14:47:39,275 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L62-5-->thread2EXIT: Formula: (and (<= v_~M~0_71 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {~M~0=v_~M~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, ~M~0=v_~M~0_71, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1][213], [37#L75-5true, 14#L51-2true, 269#true, 259#true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 56#(= ~res2~0 ~res1~0), 57#true, thread2Thread1of1ForFork0InUse, thread1Thread1of1ForFork2InUse, 25#L102-1true, thread3Thread1of1ForFork1InUse, 507#(and (= |thread1Thread1of1ForFork2_#t~mem4#1| (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= |thread1Thread1of1ForFork2_~j~0#1| 0) (<= ~size~0 1)), 21#thread2EXITtrue, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:39,275 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-02-19 14:47:39,275 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-19 14:47:39,275 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 14:47:39,275 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 14:47:39,687 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L62-5-->L64-8: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~M~0_69) (not (= (ite (< (select (select |v_#memory_int#3_130| v_~A~0.base_79) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_3| 4) v_~A~0.offset_79)) v_~size~0_73) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~j~1#1_1| 0)) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} OutVars{~A~0.base=v_~A~0.base_79, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_1|, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~j~1#1=|v_thread2Thread1of1ForFork0_~j~1#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][279], [278#(and (= |thread3Thread1of1ForFork1_~j~2#1| 0) (<= ~size~0 0) (= (select (select |#memory_int#3| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_#t~mem16#1|) (<= (+ (select (select |#memory_int#3| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) 0)), 44#L77-2true, 14#L51-2true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 56#(= ~res2~0 ~res1~0), thread2Thread1of1ForFork0InUse, 57#true, 25#L102-1true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 268#(and (= |thread1Thread1of1ForFork2_#t~mem4#1| (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (+ (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1) 0) (= |thread1Thread1of1ForFork2_~j~0#1| 0) (<= ~size~0 0)), 507#(and (= |thread1Thread1of1ForFork2_#t~mem4#1| (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= |thread1Thread1of1ForFork2_~j~0#1| 0) (<= ~size~0 1)), 46#L64-8true, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:39,688 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-02-19 14:47:39,688 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:47:39,688 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:47:39,688 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-02-19 14:47:39,688 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L62-5-->thread2EXIT: Formula: (and (<= v_~M~0_71 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {~M~0=v_~M~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, ~M~0=v_~M~0_71, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1][280], [278#(and (= |thread3Thread1of1ForFork1_~j~2#1| 0) (<= ~size~0 0) (= (select (select |#memory_int#3| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_#t~mem16#1|) (<= (+ (select (select |#memory_int#3| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) 0)), 44#L77-2true, 14#L51-2true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 56#(= ~res2~0 ~res1~0), thread2Thread1of1ForFork0InUse, 57#true, 25#L102-1true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 268#(and (= |thread1Thread1of1ForFork2_#t~mem4#1| (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (+ (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1) 0) (= |thread1Thread1of1ForFork2_~j~0#1| 0) (<= ~size~0 0)), 507#(and (= |thread1Thread1of1ForFork2_#t~mem4#1| (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= |thread1Thread1of1ForFork2_~j~0#1| 0) (<= ~size~0 1)), 21#thread2EXITtrue, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:39,688 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-02-19 14:47:39,688 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:47:39,688 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:47:39,688 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-02-19 14:47:39,807 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L62-5-->L64-8: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~M~0_69) (not (= (ite (< (select (select |v_#memory_int#3_130| v_~A~0.base_79) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_3| 4) v_~A~0.offset_79)) v_~size~0_73) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~j~1#1_1| 0)) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} OutVars{~A~0.base=v_~A~0.base_79, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_1|, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~j~1#1=|v_thread2Thread1of1ForFork0_~j~1#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][212], [44#L77-2true, 14#L51-2true, 269#true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 56#(= ~res2~0 ~res1~0), 259#true, 57#true, thread2Thread1of1ForFork0InUse, thread1Thread1of1ForFork2InUse, 25#L102-1true, thread3Thread1of1ForFork1InUse, 507#(and (= |thread1Thread1of1ForFork2_#t~mem4#1| (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= |thread1Thread1of1ForFork2_~j~0#1| 0) (<= ~size~0 1)), 46#L64-8true, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:39,807 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-02-19 14:47:39,808 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-02-19 14:47:39,820 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:47:39,820 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:47:39,821 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L62-5-->thread2EXIT: Formula: (and (<= v_~M~0_71 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {~M~0=v_~M~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, ~M~0=v_~M~0_71, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1][213], [44#L77-2true, 14#L51-2true, 269#true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 56#(= ~res2~0 ~res1~0), 259#true, thread2Thread1of1ForFork0InUse, 57#true, thread1Thread1of1ForFork2InUse, 25#L102-1true, thread3Thread1of1ForFork1InUse, 507#(and (= |thread1Thread1of1ForFork2_#t~mem4#1| (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= |thread1Thread1of1ForFork2_~j~0#1| 0) (<= ~size~0 1)), 21#thread2EXITtrue, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:39,821 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-02-19 14:47:39,821 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:47:39,821 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-02-19 14:47:39,821 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:47:40,214 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L62-5-->L64-8: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~M~0_69) (not (= (ite (< (select (select |v_#memory_int#3_130| v_~A~0.base_79) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_3| 4) v_~A~0.offset_79)) v_~size~0_73) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~j~1#1_1| 0)) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} OutVars{~A~0.base=v_~A~0.base_79, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_1|, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~j~1#1=|v_thread2Thread1of1ForFork0_~j~1#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][453], [37#L75-5true, 14#L51-2true, 269#true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 259#true, 54#true, thread2Thread1of1ForFork0InUse, 57#true, thread1Thread1of1ForFork2InUse, 25#L102-1true, thread3Thread1of1ForFork1InUse, 46#L64-8true, 279#true, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:40,214 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-02-19 14:47:40,214 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-02-19 14:47:40,214 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-02-19 14:47:40,214 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-02-19 14:47:40,215 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L62-5-->thread2EXIT: Formula: (and (<= v_~M~0_71 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {~M~0=v_~M~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, ~M~0=v_~M~0_71, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1][454], [37#L75-5true, 14#L51-2true, 269#true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 259#true, 54#true, thread2Thread1of1ForFork0InUse, 57#true, thread1Thread1of1ForFork2InUse, 25#L102-1true, thread3Thread1of1ForFork1InUse, 21#thread2EXITtrue, 279#true, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:40,215 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-02-19 14:47:40,215 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-02-19 14:47:40,215 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-02-19 14:47:40,215 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-02-19 14:47:40,462 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L62-5-->L64-8: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~M~0_69) (not (= (ite (< (select (select |v_#memory_int#3_130| v_~A~0.base_79) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_3| 4) v_~A~0.offset_79)) v_~size~0_73) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~j~1#1_1| 0)) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} OutVars{~A~0.base=v_~A~0.base_79, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_1|, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~j~1#1=|v_thread2Thread1of1ForFork0_~j~1#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][453], [44#L77-2true, 14#L51-2true, 269#true, 259#true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 54#true, thread2Thread1of1ForFork0InUse, 57#true, thread1Thread1of1ForFork2InUse, 25#L102-1true, thread3Thread1of1ForFork1InUse, 46#L64-8true, 279#true, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:40,463 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-02-19 14:47:40,463 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-02-19 14:47:40,463 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-02-19 14:47:40,463 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-02-19 14:47:40,463 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L62-5-->thread2EXIT: Formula: (and (<= v_~M~0_71 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {~M~0=v_~M~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, ~M~0=v_~M~0_71, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1][454], [44#L77-2true, 14#L51-2true, 269#true, 259#true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 54#true, thread2Thread1of1ForFork0InUse, 57#true, thread1Thread1of1ForFork2InUse, 25#L102-1true, thread3Thread1of1ForFork1InUse, 21#thread2EXITtrue, 279#true, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:40,463 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-02-19 14:47:40,463 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-02-19 14:47:40,464 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-02-19 14:47:40,464 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-02-19 14:47:40,737 INFO L124 PetriNetUnfolderBase]: 16381/22575 cut-off events. [2024-02-19 14:47:40,738 INFO L125 PetriNetUnfolderBase]: For 78263/79566 co-relation queries the response was YES. [2024-02-19 14:47:40,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168132 conditions, 22575 events. 16381/22575 cut-off events. For 78263/79566 co-relation queries the response was YES. Maximal size of possible extension queue 846. Compared 131187 event pairs, 1048 based on Foata normal form. 304/18098 useless extension candidates. Maximal degree in co-relation 67712. Up to 20001 conditions per place. [2024-02-19 14:47:40,962 INFO L140 encePairwiseOnDemand]: 44/52 looper letters, 714 selfloop transitions, 55 changer transitions 31/807 dead transitions. [2024-02-19 14:47:40,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 807 transitions, 12991 flow [2024-02-19 14:47:40,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-19 14:47:40,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-19 14:47:40,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2024-02-19 14:47:40,963 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4697802197802198 [2024-02-19 14:47:40,964 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 28 predicate places. [2024-02-19 14:47:40,964 INFO L507 AbstractCegarLoop]: Abstraction has has 75 places, 807 transitions, 12991 flow [2024-02-19 14:47:40,964 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.933333333333334) internal successors, (164), 15 states have internal predecessors, (164), 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-02-19 14:47:40,964 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:47:40,965 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:47:40,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-02-19 14:47:41,176 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-02-19 14:47:41,177 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 14:47:41,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:47:41,181 INFO L85 PathProgramCache]: Analyzing trace with hash 2019887159, now seen corresponding path program 1 times [2024-02-19 14:47:41,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:47:41,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711746173] [2024-02-19 14:47:41,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:47:41,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:47:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:47:41,338 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 14:47:41,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:47:41,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711746173] [2024-02-19 14:47:41,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711746173] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:47:41,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074464340] [2024-02-19 14:47:41,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:47:41,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:47:41,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:47:41,353 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:47:41,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-02-19 14:47:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:47:41,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-19 14:47:41,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:47:41,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2024-02-19 14:47:41,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 14:47:41,531 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:47:41,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2024-02-19 14:47:41,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 14:47:41,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074464340] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:47:41,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:47:41,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-02-19 14:47:41,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544574011] [2024-02-19 14:47:41,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:47:41,608 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-19 14:47:41,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:47:41,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-19 14:47:41,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-02-19 14:47:41,634 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 52 [2024-02-19 14:47:41,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 807 transitions, 12991 flow. Second operand has 15 states, 15 states have (on average 10.933333333333334) internal successors, (164), 15 states have internal predecessors, (164), 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-02-19 14:47:41,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:47:41,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 52 [2024-02-19 14:47:41,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:47:42,351 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L62-5-->L64-8: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~M~0_69) (not (= (ite (< (select (select |v_#memory_int#3_130| v_~A~0.base_79) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_3| 4) v_~A~0.offset_79)) v_~size~0_73) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~j~1#1_1| 0)) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} OutVars{~A~0.base=v_~A~0.base_79, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_1|, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~j~1#1=|v_thread2Thread1of1ForFork0_~j~1#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][104], [37#L75-5true, 262#(<= ~size~0 0), 283#(<= ~size~0 1), 56#(= ~res2~0 ~res1~0), 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), thread2Thread1of1ForFork0InUse, 57#true, 25#L102-1true, 27#L49-5true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 46#L64-8true, 512#(<= ~size~0 1), 272#(<= ~size~0 0), 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:42,352 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-02-19 14:47:42,352 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2024-02-19 14:47:42,352 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:47:42,352 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2024-02-19 14:47:42,352 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L62-5-->thread2EXIT: Formula: (and (<= v_~M~0_71 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {~M~0=v_~M~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, ~M~0=v_~M~0_71, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1][105], [37#L75-5true, 262#(<= ~size~0 0), 283#(<= ~size~0 1), 56#(= ~res2~0 ~res1~0), 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), thread2Thread1of1ForFork0InUse, 57#true, 25#L102-1true, 27#L49-5true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 21#thread2EXITtrue, 512#(<= ~size~0 1), 272#(<= ~size~0 0), 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:42,352 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-02-19 14:47:42,352 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2024-02-19 14:47:42,353 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:47:42,353 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2024-02-19 14:47:42,513 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L62-5-->L64-8: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~M~0_69) (not (= (ite (< (select (select |v_#memory_int#3_130| v_~A~0.base_79) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_3| 4) v_~A~0.offset_79)) v_~size~0_73) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~j~1#1_1| 0)) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} OutVars{~A~0.base=v_~A~0.base_79, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_1|, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~j~1#1=|v_thread2Thread1of1ForFork0_~j~1#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][157], [37#L75-5true, 269#true, 259#true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 56#(= ~res2~0 ~res1~0), 508#true, thread2Thread1of1ForFork0InUse, 57#true, 25#L102-1true, thread1Thread1of1ForFork2InUse, 27#L49-5true, thread3Thread1of1ForFork1InUse, 46#L64-8true, 279#true, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:42,513 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-02-19 14:47:42,513 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:47:42,513 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:47:42,513 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:47:42,514 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L62-5-->thread2EXIT: Formula: (and (<= v_~M~0_71 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {~M~0=v_~M~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, ~M~0=v_~M~0_71, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1][158], [37#L75-5true, 269#true, 259#true, 56#(= ~res2~0 ~res1~0), 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 508#true, thread2Thread1of1ForFork0InUse, 57#true, 25#L102-1true, thread1Thread1of1ForFork2InUse, 27#L49-5true, thread3Thread1of1ForFork1InUse, 21#thread2EXITtrue, 279#true, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:42,514 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-02-19 14:47:42,514 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:47:42,514 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:47:42,514 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:47:42,597 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L62-5-->L64-8: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~M~0_69) (not (= (ite (< (select (select |v_#memory_int#3_130| v_~A~0.base_79) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_3| 4) v_~A~0.offset_79)) v_~size~0_73) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~j~1#1_1| 0)) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} OutVars{~A~0.base=v_~A~0.base_79, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_1|, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~j~1#1=|v_thread2Thread1of1ForFork0_~j~1#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][173], [37#L75-5true, 14#L51-2true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 56#(= ~res2~0 ~res1~0), thread2Thread1of1ForFork0InUse, 57#true, 25#L102-1true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 268#(and (= |thread1Thread1of1ForFork2_#t~mem4#1| (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (+ (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1) 0) (= |thread1Thread1of1ForFork2_~j~0#1| 0) (<= ~size~0 0)), 507#(and (= |thread1Thread1of1ForFork2_#t~mem4#1| (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= |thread1Thread1of1ForFork2_~j~0#1| 0) (<= ~size~0 1)), 512#(<= ~size~0 1), 46#L64-8true, 272#(<= ~size~0 0), 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:42,597 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-02-19 14:47:42,597 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:47:42,598 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:47:42,598 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:47:42,598 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L62-5-->thread2EXIT: Formula: (and (<= v_~M~0_71 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {~M~0=v_~M~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, ~M~0=v_~M~0_71, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1][174], [37#L75-5true, 14#L51-2true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 56#(= ~res2~0 ~res1~0), thread2Thread1of1ForFork0InUse, 57#true, 25#L102-1true, thread1Thread1of1ForFork2InUse, 268#(and (= |thread1Thread1of1ForFork2_#t~mem4#1| (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (+ (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1) 0) (= |thread1Thread1of1ForFork2_~j~0#1| 0) (<= ~size~0 0)), thread3Thread1of1ForFork1InUse, 507#(and (= |thread1Thread1of1ForFork2_#t~mem4#1| (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= |thread1Thread1of1ForFork2_~j~0#1| 0) (<= ~size~0 1)), 21#thread2EXITtrue, 512#(<= ~size~0 1), 272#(<= ~size~0 0), 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:42,598 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-02-19 14:47:42,598 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:47:42,598 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:47:42,598 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:47:42,620 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L62-5-->L64-8: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~M~0_69) (not (= (ite (< (select (select |v_#memory_int#3_130| v_~A~0.base_79) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_3| 4) v_~A~0.offset_79)) v_~size~0_73) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~j~1#1_1| 0)) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} OutVars{~A~0.base=v_~A~0.base_79, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_1|, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~j~1#1=|v_thread2Thread1of1ForFork0_~j~1#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][195], [278#(and (= |thread3Thread1of1ForFork1_~j~2#1| 0) (<= ~size~0 0) (= (select (select |#memory_int#3| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_#t~mem16#1|) (<= (+ (select (select |#memory_int#3| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) 0)), 44#L77-2true, 262#(<= ~size~0 0), 283#(<= ~size~0 1), 56#(= ~res2~0 ~res1~0), 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), thread2Thread1of1ForFork0InUse, 57#true, 736#(and (= |thread3Thread1of1ForFork1_~j~2#1| 0) (<= ~size~0 1) (<= (select (select |#memory_int#3| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (= (select (select |#memory_int#3| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_#t~mem16#1|)), 25#L102-1true, 27#L49-5true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 46#L64-8true, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:42,620 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-02-19 14:47:42,620 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:47:42,620 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:47:42,620 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:47:42,621 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L62-5-->thread2EXIT: Formula: (and (<= v_~M~0_71 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {~M~0=v_~M~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, ~M~0=v_~M~0_71, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1][196], [278#(and (= |thread3Thread1of1ForFork1_~j~2#1| 0) (<= ~size~0 0) (= (select (select |#memory_int#3| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_#t~mem16#1|) (<= (+ (select (select |#memory_int#3| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) 0)), 44#L77-2true, 262#(<= ~size~0 0), 283#(<= ~size~0 1), 56#(= ~res2~0 ~res1~0), 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), thread2Thread1of1ForFork0InUse, 57#true, 736#(and (= |thread3Thread1of1ForFork1_~j~2#1| 0) (<= ~size~0 1) (<= (select (select |#memory_int#3| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (= (select (select |#memory_int#3| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_#t~mem16#1|)), 25#L102-1true, 27#L49-5true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 21#thread2EXITtrue, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:42,621 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-02-19 14:47:42,621 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:47:42,621 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:47:42,621 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:47:42,718 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L62-5-->L64-8: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~M~0_69) (not (= (ite (< (select (select |v_#memory_int#3_130| v_~A~0.base_79) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_3| 4) v_~A~0.offset_79)) v_~size~0_73) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~j~1#1_1| 0)) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} OutVars{~A~0.base=v_~A~0.base_79, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_1|, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~j~1#1=|v_thread2Thread1of1ForFork0_~j~1#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][216], [37#L75-5true, 14#L51-2true, 269#true, 259#true, 56#(= ~res2~0 ~res1~0), 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), thread2Thread1of1ForFork0InUse, 57#true, 25#L102-1true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 507#(and (= |thread1Thread1of1ForFork2_#t~mem4#1| (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= |thread1Thread1of1ForFork2_~j~0#1| 0) (<= ~size~0 1)), 512#(<= ~size~0 1), 46#L64-8true, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:42,718 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-02-19 14:47:42,718 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 14:47:42,719 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 14:47:42,719 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-19 14:47:42,719 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L62-5-->thread2EXIT: Formula: (and (<= v_~M~0_71 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {~M~0=v_~M~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, ~M~0=v_~M~0_71, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1][217], [37#L75-5true, 14#L51-2true, 269#true, 259#true, 56#(= ~res2~0 ~res1~0), 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), thread2Thread1of1ForFork0InUse, 57#true, 25#L102-1true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 507#(and (= |thread1Thread1of1ForFork2_#t~mem4#1| (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= |thread1Thread1of1ForFork2_~j~0#1| 0) (<= ~size~0 1)), 21#thread2EXITtrue, 512#(<= ~size~0 1), 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:42,719 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-02-19 14:47:42,719 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 14:47:42,719 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 14:47:42,719 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-19 14:47:42,818 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L62-5-->L64-8: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~M~0_69) (not (= (ite (< (select (select |v_#memory_int#3_130| v_~A~0.base_79) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_3| 4) v_~A~0.offset_79)) v_~size~0_73) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~j~1#1_1| 0)) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} OutVars{~A~0.base=v_~A~0.base_79, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_1|, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~j~1#1=|v_thread2Thread1of1ForFork0_~j~1#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][157], [37#L75-5true, 14#L51-2true, 269#true, 56#(= ~res2~0 ~res1~0), 259#true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 508#true, 57#true, thread2Thread1of1ForFork0InUse, 25#L102-1true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 46#L64-8true, 279#true, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:42,819 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-02-19 14:47:42,819 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:47:42,819 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-02-19 14:47:42,819 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:47:42,819 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L62-5-->thread2EXIT: Formula: (and (<= v_~M~0_71 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {~M~0=v_~M~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, ~M~0=v_~M~0_71, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1][158], [37#L75-5true, 14#L51-2true, 269#true, 259#true, 56#(= ~res2~0 ~res1~0), 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 508#true, thread2Thread1of1ForFork0InUse, 57#true, 25#L102-1true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 21#thread2EXITtrue, 279#true, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:42,819 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-02-19 14:47:42,819 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:47:42,820 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-02-19 14:47:42,820 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:47:42,846 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L62-5-->L64-8: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~M~0_69) (not (= (ite (< (select (select |v_#memory_int#3_130| v_~A~0.base_79) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_3| 4) v_~A~0.offset_79)) v_~size~0_73) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~j~1#1_1| 0)) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} OutVars{~A~0.base=v_~A~0.base_79, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_1|, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~j~1#1=|v_thread2Thread1of1ForFork0_~j~1#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][157], [44#L77-2true, 269#true, 259#true, 56#(= ~res2~0 ~res1~0), 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 508#true, thread2Thread1of1ForFork0InUse, 57#true, 27#L49-5true, 25#L102-1true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 46#L64-8true, 279#true, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:42,846 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-02-19 14:47:42,846 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:47:42,847 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-02-19 14:47:42,847 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:47:42,847 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L62-5-->thread2EXIT: Formula: (and (<= v_~M~0_71 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {~M~0=v_~M~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, ~M~0=v_~M~0_71, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1][158], [44#L77-2true, 269#true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 56#(= ~res2~0 ~res1~0), 259#true, 508#true, thread2Thread1of1ForFork0InUse, 57#true, 27#L49-5true, 25#L102-1true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 21#thread2EXITtrue, 279#true, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:42,847 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-02-19 14:47:42,847 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:47:42,847 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:47:42,847 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-02-19 14:47:42,952 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L62-5-->L64-8: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~M~0_69) (not (= (ite (< (select (select |v_#memory_int#3_130| v_~A~0.base_79) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_3| 4) v_~A~0.offset_79)) v_~size~0_73) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~j~1#1_1| 0)) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} OutVars{~A~0.base=v_~A~0.base_79, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_1|, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~j~1#1=|v_thread2Thread1of1ForFork0_~j~1#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][299], [278#(and (= |thread3Thread1of1ForFork1_~j~2#1| 0) (<= ~size~0 0) (= (select (select |#memory_int#3| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_#t~mem16#1|) (<= (+ (select (select |#memory_int#3| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) 0)), 44#L77-2true, 14#L51-2true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 56#(= ~res2~0 ~res1~0), thread2Thread1of1ForFork0InUse, 57#true, 736#(and (= |thread3Thread1of1ForFork1_~j~2#1| 0) (<= ~size~0 1) (<= (select (select |#memory_int#3| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (= (select (select |#memory_int#3| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_#t~mem16#1|)), 25#L102-1true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 268#(and (= |thread1Thread1of1ForFork2_#t~mem4#1| (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (+ (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1) 0) (= |thread1Thread1of1ForFork2_~j~0#1| 0) (<= ~size~0 0)), 507#(and (= |thread1Thread1of1ForFork2_#t~mem4#1| (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= |thread1Thread1of1ForFork2_~j~0#1| 0) (<= ~size~0 1)), 46#L64-8true, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:42,952 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-02-19 14:47:42,952 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:47:42,952 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-02-19 14:47:42,952 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:47:42,953 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L62-5-->thread2EXIT: Formula: (and (<= v_~M~0_71 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {~M~0=v_~M~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, ~M~0=v_~M~0_71, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1][300], [278#(and (= |thread3Thread1of1ForFork1_~j~2#1| 0) (<= ~size~0 0) (= (select (select |#memory_int#3| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_#t~mem16#1|) (<= (+ (select (select |#memory_int#3| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) 0)), 44#L77-2true, 14#L51-2true, 56#(= ~res2~0 ~res1~0), 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), thread2Thread1of1ForFork0InUse, 57#true, 736#(and (= |thread3Thread1of1ForFork1_~j~2#1| 0) (<= ~size~0 1) (<= (select (select |#memory_int#3| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (= (select (select |#memory_int#3| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_#t~mem16#1|)), 25#L102-1true, thread1Thread1of1ForFork2InUse, 268#(and (= |thread1Thread1of1ForFork2_#t~mem4#1| (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (+ (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1) 0) (= |thread1Thread1of1ForFork2_~j~0#1| 0) (<= ~size~0 0)), thread3Thread1of1ForFork1InUse, 507#(and (= |thread1Thread1of1ForFork2_#t~mem4#1| (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (select (select |#memory_int#3| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= |thread1Thread1of1ForFork2_~j~0#1| 0) (<= ~size~0 1)), 21#thread2EXITtrue, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:42,953 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-02-19 14:47:42,953 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:47:42,953 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-02-19 14:47:42,953 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:47:43,217 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L62-5-->L64-8: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~M~0_69) (not (= (ite (< (select (select |v_#memory_int#3_130| v_~A~0.base_79) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_3| 4) v_~A~0.offset_79)) v_~size~0_73) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~j~1#1_1| 0)) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} OutVars{~A~0.base=v_~A~0.base_79, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_1|, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~j~1#1=|v_thread2Thread1of1ForFork0_~j~1#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][157], [44#L77-2true, 14#L51-2true, 269#true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 259#true, 56#(= ~res2~0 ~res1~0), 508#true, thread2Thread1of1ForFork0InUse, 57#true, 25#L102-1true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 46#L64-8true, 279#true, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:43,217 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-02-19 14:47:43,217 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:47:43,217 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-02-19 14:47:43,217 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:47:43,218 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L62-5-->thread2EXIT: Formula: (and (<= v_~M~0_71 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {~M~0=v_~M~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, ~M~0=v_~M~0_71, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1][158], [44#L77-2true, 14#L51-2true, 269#true, 56#(= ~res2~0 ~res1~0), 259#true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 508#true, 57#true, thread2Thread1of1ForFork0InUse, 25#L102-1true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 21#thread2EXITtrue, 279#true, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:43,218 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-02-19 14:47:43,218 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:47:43,218 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-02-19 14:47:43,218 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:47:43,768 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L62-5-->L64-8: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~M~0_69) (not (= (ite (< (select (select |v_#memory_int#3_130| v_~A~0.base_79) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_3| 4) v_~A~0.offset_79)) v_~size~0_73) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~j~1#1_1| 0)) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} OutVars{~A~0.base=v_~A~0.base_79, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_1|, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~j~1#1=|v_thread2Thread1of1ForFork0_~j~1#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][483], [37#L75-5true, 14#L51-2true, 269#true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 259#true, 508#true, 54#true, 57#true, thread2Thread1of1ForFork0InUse, 25#L102-1true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 46#L64-8true, 279#true, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:43,769 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-02-19 14:47:43,769 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-02-19 14:47:43,769 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-02-19 14:47:43,769 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-02-19 14:47:43,769 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L62-5-->thread2EXIT: Formula: (and (<= v_~M~0_71 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {~M~0=v_~M~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, ~M~0=v_~M~0_71, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1][484], [37#L75-5true, 14#L51-2true, 269#true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 259#true, 508#true, 54#true, 57#true, thread2Thread1of1ForFork0InUse, 25#L102-1true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 21#thread2EXITtrue, 279#true, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:43,769 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-02-19 14:47:43,770 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-02-19 14:47:43,770 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-02-19 14:47:43,770 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-02-19 14:47:44,244 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L62-5-->L64-8: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~M~0_69) (not (= (ite (< (select (select |v_#memory_int#3_130| v_~A~0.base_79) (+ (* |v_thread2Thread1of1ForFork0_~i~1#1_3| 4) v_~A~0.offset_79)) v_~size~0_73) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~j~1#1_1| 0)) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} OutVars{~A~0.base=v_~A~0.base_79, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_1|, ~A~0.offset=v_~A~0.offset_79, ~size~0=v_~size~0_73, ~M~0=v_~M~0_69, thread2Thread1of1ForFork0_~j~1#1=|v_thread2Thread1of1ForFork0_~j~1#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, #memory_int#3=|v_#memory_int#3_130|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][483], [44#L77-2true, 14#L51-2true, 269#true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 259#true, 508#true, 54#true, thread2Thread1of1ForFork0InUse, 57#true, 25#L102-1true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 46#L64-8true, 279#true, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:44,245 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-02-19 14:47:44,245 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-02-19 14:47:44,245 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-02-19 14:47:44,245 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-02-19 14:47:44,245 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L62-5-->thread2EXIT: Formula: (and (<= v_~M~0_71 |v_thread2Thread1of1ForFork0_~i~1#1_5|) (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {~M~0=v_~M~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, ~M~0=v_~M~0_71, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1][484], [44#L77-2true, 14#L51-2true, 269#true, 66#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 259#true, 508#true, 54#true, thread2Thread1of1ForFork0InUse, 57#true, 25#L102-1true, thread1Thread1of1ForFork2InUse, thread3Thread1of1ForFork1InUse, 21#thread2EXITtrue, 279#true, 258#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0))]) [2024-02-19 14:47:44,245 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-02-19 14:47:44,245 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-02-19 14:47:44,245 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-02-19 14:47:44,246 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-02-19 14:47:44,693 INFO L124 PetriNetUnfolderBase]: 15208/20939 cut-off events. [2024-02-19 14:47:44,693 INFO L125 PetriNetUnfolderBase]: For 93687/96048 co-relation queries the response was YES. [2024-02-19 14:47:44,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176130 conditions, 20939 events. 15208/20939 cut-off events. For 93687/96048 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 120520 event pairs, 880 based on Foata normal form. 74/16636 useless extension candidates. Maximal degree in co-relation 73612. Up to 18625 conditions per place. [2024-02-19 14:47:44,851 INFO L140 encePairwiseOnDemand]: 44/52 looper letters, 810 selfloop transitions, 71 changer transitions 55/945 dead transitions. [2024-02-19 14:47:44,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 945 transitions, 17073 flow [2024-02-19 14:47:44,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-19 14:47:44,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-19 14:47:44,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 162 transitions. [2024-02-19 14:47:44,853 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.44505494505494503 [2024-02-19 14:47:44,853 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 34 predicate places. [2024-02-19 14:47:44,854 INFO L507 AbstractCegarLoop]: Abstraction has has 81 places, 945 transitions, 17073 flow [2024-02-19 14:47:44,854 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.933333333333334) internal successors, (164), 15 states have internal predecessors, (164), 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-02-19 14:47:44,854 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:47:44,854 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:47:44,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-02-19 14:47:45,076 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:47:45,079 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 14:47:45,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:47:45,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1903142267, now seen corresponding path program 2 times [2024-02-19 14:47:45,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:47:45,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904779596] [2024-02-19 14:47:45,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:47:45,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:47:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:47:45,669 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:47:45,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:47:45,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904779596] [2024-02-19 14:47:45,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904779596] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:47:45,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399503534] [2024-02-19 14:47:45,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 14:47:45,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:47:45,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:47:45,671 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:47:45,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-02-19 14:47:45,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 14:47:45,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:47:45,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 21 conjunts are in the unsatisfiable core [2024-02-19 14:47:45,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:47:46,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-02-19 14:47:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 14:47:46,101 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:47:46,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:47:46,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 15 [2024-02-19 14:47:46,356 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 14:47:46,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399503534] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:47:46,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:47:46,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 37 [2024-02-19 14:47:46,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170213932] [2024-02-19 14:47:46,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:47:46,357 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-02-19 14:47:46,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:47:46,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-02-19 14:47:46,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1248, Unknown=0, NotChecked=0, Total=1406 [2024-02-19 14:47:46,518 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 52 [2024-02-19 14:47:46,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 945 transitions, 17073 flow. Second operand has 38 states, 38 states have (on average 8.026315789473685) internal successors, (305), 38 states have internal predecessors, (305), 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-02-19 14:47:46,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:47:46,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 52 [2024-02-19 14:47:46,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:48:03,550 INFO L124 PetriNetUnfolderBase]: 68709/93740 cut-off events. [2024-02-19 14:48:03,551 INFO L125 PetriNetUnfolderBase]: For 388448/389591 co-relation queries the response was YES. [2024-02-19 14:48:03,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 871789 conditions, 93740 events. 68709/93740 cut-off events. For 388448/389591 co-relation queries the response was YES. Maximal size of possible extension queue 3198. Compared 627244 event pairs, 2793 based on Foata normal form. 0/75069 useless extension candidates. Maximal degree in co-relation 239487. Up to 82347 conditions per place. [2024-02-19 14:48:04,639 INFO L140 encePairwiseOnDemand]: 33/52 looper letters, 3763 selfloop transitions, 471 changer transitions 178/4415 dead transitions. [2024-02-19 14:48:04,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 4415 transitions, 87537 flow [2024-02-19 14:48:04,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-02-19 14:48:04,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2024-02-19 14:48:04,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 1031 transitions. [2024-02-19 14:48:04,642 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4046310832025118 [2024-02-19 14:48:04,643 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 82 predicate places. [2024-02-19 14:48:04,643 INFO L507 AbstractCegarLoop]: Abstraction has has 129 places, 4415 transitions, 87537 flow [2024-02-19 14:48:04,643 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 8.026315789473685) internal successors, (305), 38 states have internal predecessors, (305), 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-02-19 14:48:04,643 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:48:04,643 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:48:04,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-02-19 14:48:04,855 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:48:04,855 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 14:48:04,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:48:04,856 INFO L85 PathProgramCache]: Analyzing trace with hash 347719553, now seen corresponding path program 3 times [2024-02-19 14:48:04,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:48:04,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475410931] [2024-02-19 14:48:04,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:48:04,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:48:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:48:05,517 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:48:05,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:48:05,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475410931] [2024-02-19 14:48:05,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475410931] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:48:05,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948195439] [2024-02-19 14:48:05,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 14:48:05,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:48:05,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:48:05,519 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:48:05,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-02-19 14:48:05,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-02-19 14:48:05,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:48:05,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 21 conjunts are in the unsatisfiable core [2024-02-19 14:48:05,649 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:48:05,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-02-19 14:48:05,896 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 14:48:05,897 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:48:06,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:48:06,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2024-02-19 14:48:06,151 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 14:48:06,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948195439] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:48:06,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:48:06,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 37 [2024-02-19 14:48:06,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78755843] [2024-02-19 14:48:06,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:48:06,152 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-02-19 14:48:06,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:48:06,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-02-19 14:48:06,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1247, Unknown=0, NotChecked=0, Total=1406 [2024-02-19 14:48:06,272 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 52 [2024-02-19 14:48:06,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 4415 transitions, 87537 flow. Second operand has 38 states, 38 states have (on average 8.078947368421053) internal successors, (307), 38 states have internal predecessors, (307), 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-02-19 14:48:06,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:48:06,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 52 [2024-02-19 14:48:06,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:49:14,274 INFO L124 PetriNetUnfolderBase]: 100753/137164 cut-off events. [2024-02-19 14:49:14,274 INFO L125 PetriNetUnfolderBase]: For 597252/598437 co-relation queries the response was YES. [2024-02-19 14:49:14,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1409532 conditions, 137164 events. 100753/137164 cut-off events. For 597252/598437 co-relation queries the response was YES. Maximal size of possible extension queue 4439. Compared 945775 event pairs, 2216 based on Foata normal form. 0/110545 useless extension candidates. Maximal degree in co-relation 453511. Up to 120431 conditions per place. [2024-02-19 14:49:16,122 INFO L140 encePairwiseOnDemand]: 33/52 looper letters, 7237 selfloop transitions, 1121 changer transitions 304/8665 dead transitions. [2024-02-19 14:49:16,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 8665 transitions, 188279 flow [2024-02-19 14:49:16,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-02-19 14:49:16,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2024-02-19 14:49:16,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 1171 transitions. [2024-02-19 14:49:16,139 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.40944055944055946 [2024-02-19 14:49:16,139 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 136 predicate places. [2024-02-19 14:49:16,139 INFO L507 AbstractCegarLoop]: Abstraction has has 183 places, 8665 transitions, 188279 flow [2024-02-19 14:49:16,141 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 8.078947368421053) internal successors, (307), 38 states have internal predecessors, (307), 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-02-19 14:49:16,141 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:49:16,141 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:49:16,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-02-19 14:49:16,348 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-02-19 14:49:16,348 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 14:49:16,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:49:16,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1722650047, now seen corresponding path program 4 times [2024-02-19 14:49:16,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:49:16,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470265241] [2024-02-19 14:49:16,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:49:16,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:49:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:49:17,095 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:49:17,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:49:17,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470265241] [2024-02-19 14:49:17,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470265241] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:49:17,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904423380] [2024-02-19 14:49:17,096 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 14:49:17,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:49:17,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:49:17,121 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:49:17,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-02-19 14:49:17,246 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 14:49:17,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:49:17,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 13 conjunts are in the unsatisfiable core [2024-02-19 14:49:17,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:49:17,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-02-19 14:49:17,449 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-19 14:49:17,449 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:49:17,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:49:17,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 17 [2024-02-19 14:49:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-19 14:49:17,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904423380] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:49:17,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:49:17,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 34 [2024-02-19 14:49:17,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949660998] [2024-02-19 14:49:17,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:49:17,660 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-02-19 14:49:17,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:49:17,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-02-19 14:49:17,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=978, Unknown=0, NotChecked=0, Total=1122 [2024-02-19 14:49:17,873 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 52 [2024-02-19 14:49:17,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 8665 transitions, 188279 flow. Second operand has 34 states, 34 states have (on average 7.5588235294117645) internal successors, (257), 34 states have internal predecessors, (257), 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-02-19 14:49:17,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:49:17,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 52 [2024-02-19 14:49:17,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand