/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:44:53,150 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:44:53,152 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:44:53,189 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:44:53,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:44:53,192 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:44:53,195 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:44:53,199 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:44:53,203 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:44:53,207 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:44:53,208 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:44:53,210 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:44:53,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:44:53,212 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:44:53,213 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:44:53,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:44:53,217 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:44:53,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:44:53,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:44:53,225 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:44:53,227 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:44:53,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:44:53,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:44:53,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:44:53,236 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:44:53,236 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:44:53,237 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:44:53,238 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:44:53,238 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:44:53,239 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:44:53,239 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:44:53,240 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:44:53,242 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:44:53,242 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:44:53,243 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:44:53,243 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:44:53,243 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:44:53,243 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:44:53,244 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:44:53,244 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:44:53,245 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:44:53,246 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:44:53,276 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:44:53,276 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:44:53,278 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:44:53,278 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:44:53,278 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:44:53,279 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:44:53,279 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:44:53,279 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:44:53,279 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:44:53,280 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:44:53,280 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:44:53,281 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:44:53,281 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:44:53,281 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:44:53,281 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:44:53,281 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:44:53,281 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:44:53,281 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:44:53,281 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:44:53,281 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:44:53,282 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:44:53,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:44:53,282 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:44:53,282 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:44:53,282 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:44:53,282 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:44:53,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:44:53,283 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:44:53,283 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-12-06 07:44:53,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:44:53,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:44:53,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:44:53,601 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:44:53,601 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:44:53,602 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2022-12-06 07:44:54,636 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:44:54,807 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:44:54,808 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2022-12-06 07:44:54,814 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e36d8f1a/97b93cd3dcb24834b2eb6a3ef63b4814/FLAGd325f879c [2022-12-06 07:44:54,824 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e36d8f1a/97b93cd3dcb24834b2eb6a3ef63b4814 [2022-12-06 07:44:54,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:44:54,827 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:44:54,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:44:54,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:44:54,831 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:44:54,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:44:54" (1/1) ... [2022-12-06 07:44:54,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@702799c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:54, skipping insertion in model container [2022-12-06 07:44:54,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:44:54" (1/1) ... [2022-12-06 07:44:54,838 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:44:54,855 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:44:55,020 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c[2396,2409] [2022-12-06 07:44:55,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:44:55,034 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:44:55,052 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c[2396,2409] [2022-12-06 07:44:55,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:44:55,067 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:44:55,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:55 WrapperNode [2022-12-06 07:44:55,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:44:55,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:44:55,069 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:44:55,069 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:44:55,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:55" (1/1) ... [2022-12-06 07:44:55,082 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:55" (1/1) ... [2022-12-06 07:44:55,099 INFO L138 Inliner]: procedures = 25, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2022-12-06 07:44:55,100 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:44:55,101 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:44:55,101 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:44:55,101 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:44:55,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:55" (1/1) ... [2022-12-06 07:44:55,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:55" (1/1) ... [2022-12-06 07:44:55,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:55" (1/1) ... [2022-12-06 07:44:55,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:55" (1/1) ... [2022-12-06 07:44:55,173 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:55" (1/1) ... [2022-12-06 07:44:55,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:55" (1/1) ... [2022-12-06 07:44:55,178 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:55" (1/1) ... [2022-12-06 07:44:55,189 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:55" (1/1) ... [2022-12-06 07:44:55,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:44:55,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:44:55,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:44:55,192 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:44:55,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:55" (1/1) ... [2022-12-06 07:44:55,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:44:55,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:44:55,232 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 07:44:55,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 07:44:55,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:44:55,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:44:55,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:44:55,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:44:55,274 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:44:55,274 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:44:55,274 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:44:55,275 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:44:55,275 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 07:44:55,275 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 07:44:55,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:44:55,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 07:44:55,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:44:55,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:44:55,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:44:55,277 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 07:44:55,452 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:44:55,454 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:44:55,678 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:44:55,685 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:44:55,685 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 07:44:55,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:44:55 BoogieIcfgContainer [2022-12-06 07:44:55,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:44:55,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:44:55,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:44:55,692 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:44:55,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:44:54" (1/3) ... [2022-12-06 07:44:55,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50fc1e7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:44:55, skipping insertion in model container [2022-12-06 07:44:55,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:55" (2/3) ... [2022-12-06 07:44:55,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50fc1e7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:44:55, skipping insertion in model container [2022-12-06 07:44:55,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:44:55" (3/3) ... [2022-12-06 07:44:55,694 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2022-12-06 07:44:55,711 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:44:55,712 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:44:55,712 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:44:55,768 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 07:44:55,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 148 transitions, 320 flow [2022-12-06 07:44:55,924 INFO L130 PetriNetUnfolder]: 12/145 cut-off events. [2022-12-06 07:44:55,924 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:44:55,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 12/145 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 100 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2022-12-06 07:44:55,930 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 148 transitions, 320 flow [2022-12-06 07:44:55,935 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 135 transitions, 288 flow [2022-12-06 07:44:55,936 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:55,952 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 135 transitions, 288 flow [2022-12-06 07:44:55,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 135 transitions, 288 flow [2022-12-06 07:44:56,020 INFO L130 PetriNetUnfolder]: 12/135 cut-off events. [2022-12-06 07:44:56,021 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:44:56,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 135 events. 12/135 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 101 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2022-12-06 07:44:56,025 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 135 transitions, 288 flow [2022-12-06 07:44:56,025 INFO L188 LiptonReduction]: Number of co-enabled transitions 1728 [2022-12-06 07:45:01,289 INFO L203 LiptonReduction]: Total number of compositions: 111 [2022-12-06 07:45:01,303 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:45:01,310 INFO L357 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=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@71bcbf52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:45:01,311 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 07:45:01,316 INFO L130 PetriNetUnfolder]: 4/23 cut-off events. [2022-12-06 07:45:01,316 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:45:01,317 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:01,317 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:01,318 INFO L420 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)] === [2022-12-06 07:45:01,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:01,322 INFO L85 PathProgramCache]: Analyzing trace with hash 2027454459, now seen corresponding path program 1 times [2022-12-06 07:45:01,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:01,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075591074] [2022-12-06 07:45:01,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:01,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:01,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:01,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075591074] [2022-12-06 07:45:01,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075591074] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:01,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:01,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 07:45:01,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006149261] [2022-12-06 07:45:01,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:01,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:45:01,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:01,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:45:01,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:45:02,000 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2022-12-06 07:45:02,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2022-12-06 07:45:02,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:02,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2022-12-06 07:45:02,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:02,135 INFO L130 PetriNetUnfolder]: 360/508 cut-off events. [2022-12-06 07:45:02,135 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-12-06 07:45:02,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 508 events. 360/508 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1619 event pairs, 39 based on Foata normal form. 1/306 useless extension candidates. Maximal degree in co-relation 803. Up to 421 conditions per place. [2022-12-06 07:45:02,145 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 32 selfloop transitions, 4 changer transitions 1/40 dead transitions. [2022-12-06 07:45:02,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 40 transitions, 187 flow [2022-12-06 07:45:02,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:45:02,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:45:02,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-06 07:45:02,157 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6527777777777778 [2022-12-06 07:45:02,158 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 66 flow. Second operand 3 states and 47 transitions. [2022-12-06 07:45:02,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 40 transitions, 187 flow [2022-12-06 07:45:02,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 40 transitions, 165 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 07:45:02,166 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 80 flow [2022-12-06 07:45:02,167 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2022-12-06 07:45:02,171 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2022-12-06 07:45:02,171 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:02,172 INFO L89 Accepts]: Start accepts. Operand has 27 places, 27 transitions, 80 flow [2022-12-06 07:45:02,174 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:02,175 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:02,175 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 27 transitions, 80 flow [2022-12-06 07:45:02,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 27 transitions, 80 flow [2022-12-06 07:45:02,184 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([389] thread3EXIT-->L87-2: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem18#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][25], [5#L87-2true, Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), 149#true]) [2022-12-06 07:45:02,184 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-06 07:45:02,184 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:45:02,185 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 07:45:02,185 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 07:45:02,187 INFO L130 PetriNetUnfolder]: 23/64 cut-off events. [2022-12-06 07:45:02,187 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:45:02,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 64 events. 23/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 1 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 64. Up to 26 conditions per place. [2022-12-06 07:45:02,188 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 27 transitions, 80 flow [2022-12-06 07:45:02,189 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 07:45:02,190 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:02,192 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 07:45:02,192 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 80 flow [2022-12-06 07:45:02,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2022-12-06 07:45:02,193 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:02,193 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:02,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:45:02,196 INFO L420 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)] === [2022-12-06 07:45:02,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:02,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1702965316, now seen corresponding path program 1 times [2022-12-06 07:45:02,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:02,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261080684] [2022-12-06 07:45:02,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:02,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:02,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:02,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:02,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261080684] [2022-12-06 07:45:02,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261080684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:02,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:02,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:45:02,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309987612] [2022-12-06 07:45:02,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:02,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:45:02,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:02,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:45:02,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:45:02,417 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:45:02,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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) [2022-12-06 07:45:02,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:02,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:45:02,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:02,639 INFO L130 PetriNetUnfolder]: 663/975 cut-off events. [2022-12-06 07:45:02,639 INFO L131 PetriNetUnfolder]: For 287/287 co-relation queries the response was YES. [2022-12-06 07:45:02,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2385 conditions, 975 events. 663/975 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4056 event pairs, 179 based on Foata normal form. 38/1003 useless extension candidates. Maximal degree in co-relation 488. Up to 368 conditions per place. [2022-12-06 07:45:02,647 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 64 selfloop transitions, 5 changer transitions 0/71 dead transitions. [2022-12-06 07:45:02,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 71 transitions, 348 flow [2022-12-06 07:45:02,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:45:02,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:45:02,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-12-06 07:45:02,650 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2022-12-06 07:45:02,650 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 80 flow. Second operand 6 states and 73 transitions. [2022-12-06 07:45:02,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 71 transitions, 348 flow [2022-12-06 07:45:02,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 71 transitions, 338 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:45:02,654 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 115 flow [2022-12-06 07:45:02,654 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=115, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2022-12-06 07:45:02,655 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2022-12-06 07:45:02,655 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:02,655 INFO L89 Accepts]: Start accepts. Operand has 35 places, 31 transitions, 115 flow [2022-12-06 07:45:02,657 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:02,657 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:02,657 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 31 transitions, 115 flow [2022-12-06 07:45:02,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 115 flow [2022-12-06 07:45:02,665 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([389] thread3EXIT-->L87-2: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem18#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][29], [5#L87-2true, Black: 161#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 ~M~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), Black: 159#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 ~M~0)), Black: 153#true, Black: 155#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0))]) [2022-12-06 07:45:02,665 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2022-12-06 07:45:02,665 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 07:45:02,665 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-12-06 07:45:02,666 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 07:45:02,667 INFO L130 PetriNetUnfolder]: 30/102 cut-off events. [2022-12-06 07:45:02,667 INFO L131 PetriNetUnfolder]: For 6/7 co-relation queries the response was YES. [2022-12-06 07:45:02,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 102 events. 30/102 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 333 event pairs, 1 based on Foata normal form. 1/93 useless extension candidates. Maximal degree in co-relation 107. Up to 35 conditions per place. [2022-12-06 07:45:02,670 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 31 transitions, 115 flow [2022-12-06 07:45:02,670 INFO L188 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-06 07:45:04,800 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:45:04,801 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2146 [2022-12-06 07:45:04,801 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 121 flow [2022-12-06 07:45:04,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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) [2022-12-06 07:45:04,801 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:04,802 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:04,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:45:04,802 INFO L420 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)] === [2022-12-06 07:45:04,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:04,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1920480195, now seen corresponding path program 1 times [2022-12-06 07:45:04,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:04,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905361514] [2022-12-06 07:45:04,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:04,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:04,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:04,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:04,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905361514] [2022-12-06 07:45:04,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905361514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:04,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:04,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:45:04,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13274025] [2022-12-06 07:45:04,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:04,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:45:04,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:04,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:45:04,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:45:04,888 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 07:45:04,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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) [2022-12-06 07:45:04,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:04,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 07:45:04,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:05,011 INFO L130 PetriNetUnfolder]: 483/758 cut-off events. [2022-12-06 07:45:05,012 INFO L131 PetriNetUnfolder]: For 432/460 co-relation queries the response was YES. [2022-12-06 07:45:05,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1997 conditions, 758 events. 483/758 cut-off events. For 432/460 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3161 event pairs, 241 based on Foata normal form. 54/776 useless extension candidates. Maximal degree in co-relation 1345. Up to 477 conditions per place. [2022-12-06 07:45:05,017 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 51 selfloop transitions, 2 changer transitions 1/57 dead transitions. [2022-12-06 07:45:05,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 57 transitions, 301 flow [2022-12-06 07:45:05,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:45:05,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:45:05,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-06 07:45:05,018 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5576923076923077 [2022-12-06 07:45:05,019 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 121 flow. Second operand 4 states and 58 transitions. [2022-12-06 07:45:05,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 57 transitions, 301 flow [2022-12-06 07:45:05,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 57 transitions, 295 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-12-06 07:45:05,022 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 122 flow [2022-12-06 07:45:05,022 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2022-12-06 07:45:05,023 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2022-12-06 07:45:05,023 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:05,023 INFO L89 Accepts]: Start accepts. Operand has 40 places, 31 transitions, 122 flow [2022-12-06 07:45:05,024 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:05,024 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:05,025 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 31 transitions, 122 flow [2022-12-06 07:45:05,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 122 flow [2022-12-06 07:45:05,032 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([389] thread3EXIT-->L87-2: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem18#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][29], [5#L87-2true, Black: 161#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 ~M~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), Black: 159#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 ~M~0)), Black: 153#true, Black: 155#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 170#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 169#(<= ~N~0 0), 167#true]) [2022-12-06 07:45:05,033 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-06 07:45:05,033 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:45:05,033 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 07:45:05,033 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 07:45:05,034 INFO L130 PetriNetUnfolder]: 24/89 cut-off events. [2022-12-06 07:45:05,034 INFO L131 PetriNetUnfolder]: For 14/15 co-relation queries the response was YES. [2022-12-06 07:45:05,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 89 events. 24/89 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 282 event pairs, 1 based on Foata normal form. 1/82 useless extension candidates. Maximal degree in co-relation 121. Up to 29 conditions per place. [2022-12-06 07:45:05,036 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 122 flow [2022-12-06 07:45:05,036 INFO L188 LiptonReduction]: Number of co-enabled transitions 254 [2022-12-06 07:45:05,036 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:05,037 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 07:45:05,037 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 122 flow [2022-12-06 07:45:05,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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) [2022-12-06 07:45:05,037 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:05,038 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:05,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:45:05,038 INFO L420 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)] === [2022-12-06 07:45:05,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:05,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1884357865, now seen corresponding path program 1 times [2022-12-06 07:45:05,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:05,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982056179] [2022-12-06 07:45:05,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:05,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:05,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:05,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:05,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982056179] [2022-12-06 07:45:05,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982056179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:05,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:05,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:45:05,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776015677] [2022-12-06 07:45:05,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:05,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:45:05,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:05,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:45:05,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:45:05,162 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 07:45:05,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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) [2022-12-06 07:45:05,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:05,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 07:45:05,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:05,272 INFO L130 PetriNetUnfolder]: 483/740 cut-off events. [2022-12-06 07:45:05,272 INFO L131 PetriNetUnfolder]: For 490/515 co-relation queries the response was YES. [2022-12-06 07:45:05,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2011 conditions, 740 events. 483/740 cut-off events. For 490/515 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2895 event pairs, 248 based on Foata normal form. 47/784 useless extension candidates. Maximal degree in co-relation 1583. Up to 568 conditions per place. [2022-12-06 07:45:05,277 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 26 selfloop transitions, 0 changer transitions 26/53 dead transitions. [2022-12-06 07:45:05,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 282 flow [2022-12-06 07:45:05,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:45:05,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:45:05,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-06 07:45:05,278 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.53 [2022-12-06 07:45:05,278 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 122 flow. Second operand 4 states and 53 transitions. [2022-12-06 07:45:05,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 282 flow [2022-12-06 07:45:05,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 273 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 07:45:05,281 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 91 flow [2022-12-06 07:45:05,281 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=91, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2022-12-06 07:45:05,282 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2022-12-06 07:45:05,282 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:05,282 INFO L89 Accepts]: Start accepts. Operand has 42 places, 27 transitions, 91 flow [2022-12-06 07:45:05,283 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:05,283 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:05,283 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 27 transitions, 91 flow [2022-12-06 07:45:05,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 27 transitions, 91 flow [2022-12-06 07:45:05,289 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([389] thread3EXIT-->L87-2: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem18#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][25], [5#L87-2true, Black: 175#(<= ~M~0 0), Black: 161#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 ~M~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), Black: 176#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= ~M~0 0)), Black: 159#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 ~M~0)), Black: 153#true, Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 170#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 169#(<= ~N~0 0)]) [2022-12-06 07:45:05,289 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-06 07:45:05,289 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:45:05,289 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 07:45:05,289 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 07:45:05,290 INFO L130 PetriNetUnfolder]: 23/64 cut-off events. [2022-12-06 07:45:05,290 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:45:05,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 64 events. 23/64 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 142 event pairs, 1 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 99. Up to 26 conditions per place. [2022-12-06 07:45:05,291 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 27 transitions, 91 flow [2022-12-06 07:45:05,291 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 07:45:05,292 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:05,293 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 07:45:05,293 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 91 flow [2022-12-06 07:45:05,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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) [2022-12-06 07:45:05,293 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:05,293 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:05,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 07:45:05,294 INFO L420 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)] === [2022-12-06 07:45:05,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:05,294 INFO L85 PathProgramCache]: Analyzing trace with hash 484914264, now seen corresponding path program 1 times [2022-12-06 07:45:05,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:05,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533971120] [2022-12-06 07:45:05,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:05,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:05,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:45:05,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:05,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533971120] [2022-12-06 07:45:05,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533971120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:05,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:05,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:45:05,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765721983] [2022-12-06 07:45:05,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:05,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:45:05,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:05,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:45:05,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:45:05,394 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 07:45:05,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 91 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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) [2022-12-06 07:45:05,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:05,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 07:45:05,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:05,625 INFO L130 PetriNetUnfolder]: 544/798 cut-off events. [2022-12-06 07:45:05,625 INFO L131 PetriNetUnfolder]: For 456/456 co-relation queries the response was YES. [2022-12-06 07:45:05,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2202 conditions, 798 events. 544/798 cut-off events. For 456/456 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3055 event pairs, 139 based on Foata normal form. 16/811 useless extension candidates. Maximal degree in co-relation 2180. Up to 410 conditions per place. [2022-12-06 07:45:05,630 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 58 selfloop transitions, 8 changer transitions 0/67 dead transitions. [2022-12-06 07:45:05,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 67 transitions, 361 flow [2022-12-06 07:45:05,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:45:05,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:45:05,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-12-06 07:45:05,631 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-06 07:45:05,631 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 91 flow. Second operand 6 states and 64 transitions. [2022-12-06 07:45:05,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 67 transitions, 361 flow [2022-12-06 07:45:05,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 67 transitions, 330 flow, removed 14 selfloop flow, removed 7 redundant places. [2022-12-06 07:45:05,635 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 133 flow [2022-12-06 07:45:05,635 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=133, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2022-12-06 07:45:05,636 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2022-12-06 07:45:05,636 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:05,636 INFO L89 Accepts]: Start accepts. Operand has 36 places, 32 transitions, 133 flow [2022-12-06 07:45:05,637 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:05,637 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:05,637 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 32 transitions, 133 flow [2022-12-06 07:45:05,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 133 flow [2022-12-06 07:45:05,644 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([389] thread3EXIT-->L87-2: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem18#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][30], [5#L87-2true, Black: 191#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 187#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 153#true, 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0))]) [2022-12-06 07:45:05,644 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-06 07:45:05,644 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 07:45:05,644 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 07:45:05,644 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 07:45:05,644 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([389] thread3EXIT-->L87-2: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem18#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][30], [5#L87-2true, Black: 191#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 187#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 153#true, 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0))]) [2022-12-06 07:45:05,645 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-06 07:45:05,645 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 07:45:05,645 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:45:05,645 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 07:45:05,645 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:45:05,646 INFO L130 PetriNetUnfolder]: 29/84 cut-off events. [2022-12-06 07:45:05,646 INFO L131 PetriNetUnfolder]: For 11/17 co-relation queries the response was YES. [2022-12-06 07:45:05,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 84 events. 29/84 cut-off events. For 11/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 239 event pairs, 1 based on Foata normal form. 2/76 useless extension candidates. Maximal degree in co-relation 132. Up to 33 conditions per place. [2022-12-06 07:45:05,647 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 32 transitions, 133 flow [2022-12-06 07:45:05,648 INFO L188 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-06 07:45:05,738 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:45:05,740 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-06 07:45:05,741 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 115 flow [2022-12-06 07:45:05,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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) [2022-12-06 07:45:05,741 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:05,741 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:05,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 07:45:05,741 INFO L420 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)] === [2022-12-06 07:45:05,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:05,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1369268887, now seen corresponding path program 1 times [2022-12-06 07:45:05,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:05,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682373775] [2022-12-06 07:45:05,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:05,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:05,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:45:05,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:05,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682373775] [2022-12-06 07:45:05,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682373775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:05,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:05,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:45:05,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028520417] [2022-12-06 07:45:05,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:05,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:45:05,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:05,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:45:05,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:45:05,878 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 07:45:05,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 115 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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) [2022-12-06 07:45:05,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:05,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 07:45:05,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:06,047 INFO L130 PetriNetUnfolder]: 550/824 cut-off events. [2022-12-06 07:45:06,048 INFO L131 PetriNetUnfolder]: For 1083/1083 co-relation queries the response was YES. [2022-12-06 07:45:06,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2669 conditions, 824 events. 550/824 cut-off events. For 1083/1083 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3212 event pairs, 81 based on Foata normal form. 12/835 useless extension candidates. Maximal degree in co-relation 1022. Up to 297 conditions per place. [2022-12-06 07:45:06,053 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 59 selfloop transitions, 11 changer transitions 1/72 dead transitions. [2022-12-06 07:45:06,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 72 transitions, 427 flow [2022-12-06 07:45:06,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:45:06,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:45:06,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-12-06 07:45:06,056 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46794871794871795 [2022-12-06 07:45:06,056 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 115 flow. Second operand 6 states and 73 transitions. [2022-12-06 07:45:06,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 72 transitions, 427 flow [2022-12-06 07:45:06,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 72 transitions, 387 flow, removed 18 selfloop flow, removed 3 redundant places. [2022-12-06 07:45:06,059 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 179 flow [2022-12-06 07:45:06,059 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=179, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2022-12-06 07:45:06,062 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2022-12-06 07:45:06,062 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:06,062 INFO L89 Accepts]: Start accepts. Operand has 40 places, 36 transitions, 179 flow [2022-12-06 07:45:06,063 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:06,063 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:06,063 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 36 transitions, 179 flow [2022-12-06 07:45:06,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 36 transitions, 179 flow [2022-12-06 07:45:06,070 INFO L130 PetriNetUnfolder]: 25/83 cut-off events. [2022-12-06 07:45:06,070 INFO L131 PetriNetUnfolder]: For 47/48 co-relation queries the response was YES. [2022-12-06 07:45:06,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 83 events. 25/83 cut-off events. For 47/48 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 230 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 146. Up to 33 conditions per place. [2022-12-06 07:45:06,071 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 36 transitions, 179 flow [2022-12-06 07:45:06,071 INFO L188 LiptonReduction]: Number of co-enabled transitions 292 [2022-12-06 07:45:06,073 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [369] $Ultimate##0-->L64-5: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2] and [523] $Ultimate##0-->L56-5: Formula: (and (= (+ v_~sum2~0_64 (select (select |v_#memory_int_157| v_~A~0.base_86) v_~A~0.offset_86)) v_~sum2~0_63) (= v_thread2Thread1of1ForFork2_~i~1_43 1) (< 0 v_~M~0_67)) InVars {~A~0.base=v_~A~0.base_86, ~A~0.offset=v_~A~0.offset_86, ~M~0=v_~M~0_67, #memory_int=|v_#memory_int_157|, ~sum2~0=v_~sum2~0_64} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_86, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_43, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_25|, ~A~0.offset=v_~A~0.offset_86, ~M~0=v_~M~0_67, #memory_int=|v_#memory_int_157|, ~sum2~0=v_~sum2~0_63} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0] [2022-12-06 07:45:06,095 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [369] $Ultimate##0-->L64-5: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2] and [525] $Ultimate##0-->L56-5: Formula: (and (< v_thread2Thread1of1ForFork2_~i~1_49 (+ 1 v_~M~0_71)) (= (+ v_~sum2~0_68 (select (select |v_#memory_int_159| v_~A~0.base_88) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_49) (- 4) v_~A~0.offset_88))) v_~sum2~0_67) (= v_thread2Thread1of1ForFork2_~i~1_49 1)) InVars {~A~0.base=v_~A~0.base_88, ~A~0.offset=v_~A~0.offset_88, ~M~0=v_~M~0_71, #memory_int=|v_#memory_int_159|, ~sum2~0=v_~sum2~0_68} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_19|, ~A~0.base=v_~A~0.base_88, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_49, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_27|, ~A~0.offset=v_~A~0.offset_88, ~M~0=v_~M~0_71, #memory_int=|v_#memory_int_159|, ~sum2~0=v_~sum2~0_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0] [2022-12-06 07:45:06,122 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:45:06,124 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-06 07:45:06,124 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 189 flow [2022-12-06 07:45:06,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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) [2022-12-06 07:45:06,124 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:06,124 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:06,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 07:45:06,125 INFO L420 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)] === [2022-12-06 07:45:06,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:06,126 INFO L85 PathProgramCache]: Analyzing trace with hash 81363167, now seen corresponding path program 2 times [2022-12-06 07:45:06,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:06,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17524160] [2022-12-06 07:45:06,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:06,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:06,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:45:06,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:06,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17524160] [2022-12-06 07:45:06,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17524160] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:06,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:06,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:45:06,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532620780] [2022-12-06 07:45:06,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:06,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:45:06,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:06,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:45:06,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:45:06,277 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 07:45:06,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 189 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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) [2022-12-06 07:45:06,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:06,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 07:45:06,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:06,449 INFO L130 PetriNetUnfolder]: 598/875 cut-off events. [2022-12-06 07:45:06,450 INFO L131 PetriNetUnfolder]: For 1655/1655 co-relation queries the response was YES. [2022-12-06 07:45:06,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3035 conditions, 875 events. 598/875 cut-off events. For 1655/1655 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3271 event pairs, 205 based on Foata normal form. 16/890 useless extension candidates. Maximal degree in co-relation 1514. Up to 636 conditions per place. [2022-12-06 07:45:06,456 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 49 selfloop transitions, 11 changer transitions 0/61 dead transitions. [2022-12-06 07:45:06,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 61 transitions, 408 flow [2022-12-06 07:45:06,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:45:06,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:45:06,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-06 07:45:06,459 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40714285714285714 [2022-12-06 07:45:06,459 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 189 flow. Second operand 5 states and 57 transitions. [2022-12-06 07:45:06,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 61 transitions, 408 flow [2022-12-06 07:45:06,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 61 transitions, 369 flow, removed 19 selfloop flow, removed 2 redundant places. [2022-12-06 07:45:06,464 INFO L231 Difference]: Finished difference. Result has 43 places, 40 transitions, 227 flow [2022-12-06 07:45:06,464 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=43, PETRI_TRANSITIONS=40} [2022-12-06 07:45:06,465 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2022-12-06 07:45:06,465 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:06,465 INFO L89 Accepts]: Start accepts. Operand has 43 places, 40 transitions, 227 flow [2022-12-06 07:45:06,468 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:06,468 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:06,468 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 40 transitions, 227 flow [2022-12-06 07:45:06,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 40 transitions, 227 flow [2022-12-06 07:45:06,478 INFO L130 PetriNetUnfolder]: 40/108 cut-off events. [2022-12-06 07:45:06,478 INFO L131 PetriNetUnfolder]: For 128/139 co-relation queries the response was YES. [2022-12-06 07:45:06,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 108 events. 40/108 cut-off events. For 128/139 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 322 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 220. Up to 45 conditions per place. [2022-12-06 07:45:06,479 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 40 transitions, 227 flow [2022-12-06 07:45:06,479 INFO L188 LiptonReduction]: Number of co-enabled transitions 330 [2022-12-06 07:45:06,565 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:45:06,566 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-06 07:45:06,566 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 40 transitions, 245 flow [2022-12-06 07:45:06,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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) [2022-12-06 07:45:06,566 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:06,566 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:06,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 07:45:06,566 INFO L420 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)] === [2022-12-06 07:45:06,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:06,567 INFO L85 PathProgramCache]: Analyzing trace with hash -882476984, now seen corresponding path program 1 times [2022-12-06 07:45:06,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:06,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614209921] [2022-12-06 07:45:06,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:06,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:06,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:06,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:06,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614209921] [2022-12-06 07:45:06,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614209921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:06,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:06,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:45:06,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446801710] [2022-12-06 07:45:06,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:06,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:45:06,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:06,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:45:06,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:45:06,647 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 07:45:06,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 245 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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) [2022-12-06 07:45:06,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:06,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 07:45:06,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:06,779 INFO L130 PetriNetUnfolder]: 603/898 cut-off events. [2022-12-06 07:45:06,779 INFO L131 PetriNetUnfolder]: For 1957/1979 co-relation queries the response was YES. [2022-12-06 07:45:06,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3122 conditions, 898 events. 603/898 cut-off events. For 1957/1979 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3250 event pairs, 239 based on Foata normal form. 61/955 useless extension candidates. Maximal degree in co-relation 2708. Up to 714 conditions per place. [2022-12-06 07:45:06,785 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 55 selfloop transitions, 4 changer transitions 0/61 dead transitions. [2022-12-06 07:45:06,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 61 transitions, 510 flow [2022-12-06 07:45:06,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:45:06,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:45:06,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-06 07:45:06,786 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4112903225806452 [2022-12-06 07:45:06,787 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 245 flow. Second operand 4 states and 51 transitions. [2022-12-06 07:45:06,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 61 transitions, 510 flow [2022-12-06 07:45:06,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 61 transitions, 463 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-06 07:45:06,791 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 234 flow [2022-12-06 07:45:06,791 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2022-12-06 07:45:06,796 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2022-12-06 07:45:06,797 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:06,797 INFO L89 Accepts]: Start accepts. Operand has 43 places, 41 transitions, 234 flow [2022-12-06 07:45:06,798 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:06,798 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:06,798 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 41 transitions, 234 flow [2022-12-06 07:45:06,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 41 transitions, 234 flow [2022-12-06 07:45:06,807 INFO L130 PetriNetUnfolder]: 36/100 cut-off events. [2022-12-06 07:45:06,807 INFO L131 PetriNetUnfolder]: For 130/159 co-relation queries the response was YES. [2022-12-06 07:45:06,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 100 events. 36/100 cut-off events. For 130/159 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 281 event pairs, 0 based on Foata normal form. 5/98 useless extension candidates. Maximal degree in co-relation 224. Up to 45 conditions per place. [2022-12-06 07:45:06,808 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 41 transitions, 234 flow [2022-12-06 07:45:06,808 INFO L188 LiptonReduction]: Number of co-enabled transitions 310 [2022-12-06 07:45:06,863 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_13| 0) (= |v_thread2Thread1of1ForFork2_#res.base_13| 0) (= v_thread2Thread1of1ForFork2_~i~1_47 0) (not (< v_thread2Thread1of1ForFork2_~i~1_47 v_~M~0_69))) InVars {~M~0=v_~M~0_69} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_47, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_13|, ~M~0=v_~M~0_69, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [505] L64-5-->L64-5: Formula: (and (= (+ v_thread3Thread1of1ForFork0_~i~2_38 1) v_thread3Thread1of1ForFork0_~i~2_37) (= (+ v_~sum3~0_36 (select (select |v_#memory_int_131| v_~A~0.base_68) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_38) v_~A~0.offset_68))) v_~sum3~0_35) (< v_thread3Thread1of1ForFork0_~i~2_38 v_~N~0_69)) InVars {~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_38, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_36, ~N~0=v_~N~0_69} OutVars{~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_37, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_35, ~N~0=v_~N~0_69, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_21|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5] [2022-12-06 07:45:06,911 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:45:06,911 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-06 07:45:06,912 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 238 flow [2022-12-06 07:45:06,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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) [2022-12-06 07:45:06,912 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:06,912 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:06,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 07:45:06,912 INFO L420 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)] === [2022-12-06 07:45:06,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:06,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1423117007, now seen corresponding path program 1 times [2022-12-06 07:45:06,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:06,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52070711] [2022-12-06 07:45:06,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:06,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:07,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:07,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:07,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52070711] [2022-12-06 07:45:07,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52070711] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:07,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:07,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:45:07,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307440038] [2022-12-06 07:45:07,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:07,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:45:07,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:07,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:45:07,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:45:07,903 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 07:45:07,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 238 flow. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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) [2022-12-06 07:45:07,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:07,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 07:45:07,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:08,261 INFO L130 PetriNetUnfolder]: 669/1008 cut-off events. [2022-12-06 07:45:08,262 INFO L131 PetriNetUnfolder]: For 2478/2478 co-relation queries the response was YES. [2022-12-06 07:45:08,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3849 conditions, 1008 events. 669/1008 cut-off events. For 2478/2478 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3874 event pairs, 74 based on Foata normal form. 17/1023 useless extension candidates. Maximal degree in co-relation 2597. Up to 795 conditions per place. [2022-12-06 07:45:08,268 INFO L137 encePairwiseOnDemand]: 18/33 looper letters, 74 selfloop transitions, 26 changer transitions 5/105 dead transitions. [2022-12-06 07:45:08,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 105 transitions, 793 flow [2022-12-06 07:45:08,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:45:08,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:45:08,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-12-06 07:45:08,270 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41125541125541126 [2022-12-06 07:45:08,270 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 238 flow. Second operand 7 states and 95 transitions. [2022-12-06 07:45:08,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 105 transitions, 793 flow [2022-12-06 07:45:08,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 105 transitions, 765 flow, removed 13 selfloop flow, removed 3 redundant places. [2022-12-06 07:45:08,278 INFO L231 Difference]: Finished difference. Result has 49 places, 59 transitions, 458 flow [2022-12-06 07:45:08,278 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=458, PETRI_PLACES=49, PETRI_TRANSITIONS=59} [2022-12-06 07:45:08,279 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 19 predicate places. [2022-12-06 07:45:08,279 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:08,279 INFO L89 Accepts]: Start accepts. Operand has 49 places, 59 transitions, 458 flow [2022-12-06 07:45:08,282 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:08,282 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:08,282 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 59 transitions, 458 flow [2022-12-06 07:45:08,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 59 transitions, 458 flow [2022-12-06 07:45:08,296 INFO L130 PetriNetUnfolder]: 57/159 cut-off events. [2022-12-06 07:45:08,296 INFO L131 PetriNetUnfolder]: For 412/468 co-relation queries the response was YES. [2022-12-06 07:45:08,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 159 events. 57/159 cut-off events. For 412/468 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 584 event pairs, 0 based on Foata normal form. 5/153 useless extension candidates. Maximal degree in co-relation 357. Up to 68 conditions per place. [2022-12-06 07:45:08,298 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 59 transitions, 458 flow [2022-12-06 07:45:08,298 INFO L188 LiptonReduction]: Number of co-enabled transitions 396 [2022-12-06 07:45:11,069 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:45:11,070 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2791 [2022-12-06 07:45:11,070 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 59 transitions, 466 flow [2022-12-06 07:45:11,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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) [2022-12-06 07:45:11,070 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:11,070 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:11,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 07:45:11,071 INFO L420 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)] === [2022-12-06 07:45:11,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:11,071 INFO L85 PathProgramCache]: Analyzing trace with hash -955963427, now seen corresponding path program 1 times [2022-12-06 07:45:11,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:11,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262055348] [2022-12-06 07:45:11,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:11,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:11,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:11,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:11,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262055348] [2022-12-06 07:45:11,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262055348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:11,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:11,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:45:11,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688605717] [2022-12-06 07:45:11,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:11,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:45:11,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:11,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:45:11,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:45:11,414 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-06 07:45:11,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 59 transitions, 466 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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) [2022-12-06 07:45:11,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:11,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-06 07:45:11,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:11,644 INFO L130 PetriNetUnfolder]: 798/1216 cut-off events. [2022-12-06 07:45:11,644 INFO L131 PetriNetUnfolder]: For 3685/3797 co-relation queries the response was YES. [2022-12-06 07:45:11,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4812 conditions, 1216 events. 798/1216 cut-off events. For 3685/3797 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4957 event pairs, 146 based on Foata normal form. 42/1254 useless extension candidates. Maximal degree in co-relation 4043. Up to 967 conditions per place. [2022-12-06 07:45:11,652 INFO L137 encePairwiseOnDemand]: 17/35 looper letters, 73 selfloop transitions, 25 changer transitions 5/105 dead transitions. [2022-12-06 07:45:11,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 105 transitions, 908 flow [2022-12-06 07:45:11,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:45:11,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:45:11,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-06 07:45:11,654 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49714285714285716 [2022-12-06 07:45:11,654 INFO L175 Difference]: Start difference. First operand has 49 places, 59 transitions, 466 flow. Second operand 5 states and 87 transitions. [2022-12-06 07:45:11,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 105 transitions, 908 flow [2022-12-06 07:45:11,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 105 transitions, 870 flow, removed 19 selfloop flow, removed 0 redundant places. [2022-12-06 07:45:11,666 INFO L231 Difference]: Finished difference. Result has 55 places, 68 transitions, 593 flow [2022-12-06 07:45:11,667 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=593, PETRI_PLACES=55, PETRI_TRANSITIONS=68} [2022-12-06 07:45:11,667 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 25 predicate places. [2022-12-06 07:45:11,667 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:11,667 INFO L89 Accepts]: Start accepts. Operand has 55 places, 68 transitions, 593 flow [2022-12-06 07:45:11,669 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:11,669 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:11,669 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 68 transitions, 593 flow [2022-12-06 07:45:11,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 68 transitions, 593 flow [2022-12-06 07:45:11,685 INFO L130 PetriNetUnfolder]: 73/207 cut-off events. [2022-12-06 07:45:11,685 INFO L131 PetriNetUnfolder]: For 705/772 co-relation queries the response was YES. [2022-12-06 07:45:11,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 207 events. 73/207 cut-off events. For 705/772 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 884 event pairs, 2 based on Foata normal form. 12/206 useless extension candidates. Maximal degree in co-relation 546. Up to 70 conditions per place. [2022-12-06 07:45:11,710 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 68 transitions, 593 flow [2022-12-06 07:45:11,710 INFO L188 LiptonReduction]: Number of co-enabled transitions 484 [2022-12-06 07:45:11,711 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:11,712 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-06 07:45:11,712 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 68 transitions, 593 flow [2022-12-06 07:45:11,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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) [2022-12-06 07:45:11,712 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:11,712 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:11,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 07:45:11,712 INFO L420 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)] === [2022-12-06 07:45:11,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:11,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1359502275, now seen corresponding path program 1 times [2022-12-06 07:45:11,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:11,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283002140] [2022-12-06 07:45:11,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:11,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:12,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:12,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:12,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283002140] [2022-12-06 07:45:12,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283002140] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:12,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:12,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:45:12,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030407985] [2022-12-06 07:45:12,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:12,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:45:12,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:12,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:45:12,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:45:12,287 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 07:45:12,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 68 transitions, 593 flow. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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) [2022-12-06 07:45:12,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:12,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 07:45:12,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:12,521 INFO L130 PetriNetUnfolder]: 940/1438 cut-off events. [2022-12-06 07:45:12,521 INFO L131 PetriNetUnfolder]: For 5156/5300 co-relation queries the response was YES. [2022-12-06 07:45:12,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6023 conditions, 1438 events. 940/1438 cut-off events. For 5156/5300 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6244 event pairs, 170 based on Foata normal form. 54/1490 useless extension candidates. Maximal degree in co-relation 5192. Up to 1025 conditions per place. [2022-12-06 07:45:12,531 INFO L137 encePairwiseOnDemand]: 18/34 looper letters, 74 selfloop transitions, 32 changer transitions 4/112 dead transitions. [2022-12-06 07:45:12,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 112 transitions, 1059 flow [2022-12-06 07:45:12,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:45:12,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:45:12,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-12-06 07:45:12,533 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5058823529411764 [2022-12-06 07:45:12,533 INFO L175 Difference]: Start difference. First operand has 54 places, 68 transitions, 593 flow. Second operand 5 states and 86 transitions. [2022-12-06 07:45:12,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 112 transitions, 1059 flow [2022-12-06 07:45:12,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 112 transitions, 1026 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 07:45:12,545 INFO L231 Difference]: Finished difference. Result has 57 places, 76 transitions, 755 flow [2022-12-06 07:45:12,545 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=755, PETRI_PLACES=57, PETRI_TRANSITIONS=76} [2022-12-06 07:45:12,545 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 27 predicate places. [2022-12-06 07:45:12,545 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:12,545 INFO L89 Accepts]: Start accepts. Operand has 57 places, 76 transitions, 755 flow [2022-12-06 07:45:12,547 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:12,547 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:12,547 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 76 transitions, 755 flow [2022-12-06 07:45:12,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 76 transitions, 755 flow [2022-12-06 07:45:12,566 INFO L130 PetriNetUnfolder]: 83/246 cut-off events. [2022-12-06 07:45:12,566 INFO L131 PetriNetUnfolder]: For 1063/1133 co-relation queries the response was YES. [2022-12-06 07:45:12,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 862 conditions, 246 events. 83/246 cut-off events. For 1063/1133 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1210 event pairs, 1 based on Foata normal form. 15/244 useless extension candidates. Maximal degree in co-relation 669. Up to 77 conditions per place. [2022-12-06 07:45:12,572 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 76 transitions, 755 flow [2022-12-06 07:45:12,572 INFO L188 LiptonReduction]: Number of co-enabled transitions 568 [2022-12-06 07:45:12,574 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:12,575 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 07:45:12,575 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 76 transitions, 755 flow [2022-12-06 07:45:12,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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) [2022-12-06 07:45:12,575 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:12,575 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:12,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 07:45:12,575 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:12,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:12,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1164826203, now seen corresponding path program 1 times [2022-12-06 07:45:12,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:12,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29056352] [2022-12-06 07:45:12,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:12,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:13,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:13,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:13,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29056352] [2022-12-06 07:45:13,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29056352] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:13,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:13,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:45:13,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418287279] [2022-12-06 07:45:13,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:13,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:45:13,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:13,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:45:13,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:45:13,212 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 07:45:13,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 76 transitions, 755 flow. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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) [2022-12-06 07:45:13,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:13,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 07:45:13,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:13,525 INFO L130 PetriNetUnfolder]: 1066/1629 cut-off events. [2022-12-06 07:45:13,525 INFO L131 PetriNetUnfolder]: For 7283/7436 co-relation queries the response was YES. [2022-12-06 07:45:13,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7233 conditions, 1629 events. 1066/1629 cut-off events. For 7283/7436 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 7126 event pairs, 281 based on Foata normal form. 58/1685 useless extension candidates. Maximal degree in co-relation 6011. Up to 1433 conditions per place. [2022-12-06 07:45:13,538 INFO L137 encePairwiseOnDemand]: 20/34 looper letters, 88 selfloop transitions, 22 changer transitions 3/115 dead transitions. [2022-12-06 07:45:13,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 115 transitions, 1179 flow [2022-12-06 07:45:13,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:45:13,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:45:13,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-12-06 07:45:13,541 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4019607843137255 [2022-12-06 07:45:13,541 INFO L175 Difference]: Start difference. First operand has 57 places, 76 transitions, 755 flow. Second operand 6 states and 82 transitions. [2022-12-06 07:45:13,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 115 transitions, 1179 flow [2022-12-06 07:45:13,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 115 transitions, 1128 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-06 07:45:13,561 INFO L231 Difference]: Finished difference. Result has 62 places, 83 transitions, 829 flow [2022-12-06 07:45:13,561 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=829, PETRI_PLACES=62, PETRI_TRANSITIONS=83} [2022-12-06 07:45:13,562 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 32 predicate places. [2022-12-06 07:45:13,562 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:13,562 INFO L89 Accepts]: Start accepts. Operand has 62 places, 83 transitions, 829 flow [2022-12-06 07:45:13,563 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:13,563 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:13,563 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 83 transitions, 829 flow [2022-12-06 07:45:13,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 83 transitions, 829 flow [2022-12-06 07:45:13,585 INFO L130 PetriNetUnfolder]: 99/286 cut-off events. [2022-12-06 07:45:13,585 INFO L131 PetriNetUnfolder]: For 1184/1261 co-relation queries the response was YES. [2022-12-06 07:45:13,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 991 conditions, 286 events. 99/286 cut-off events. For 1184/1261 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1447 event pairs, 2 based on Foata normal form. 16/285 useless extension candidates. Maximal degree in co-relation 840. Up to 97 conditions per place. [2022-12-06 07:45:13,588 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 83 transitions, 829 flow [2022-12-06 07:45:13,588 INFO L188 LiptonReduction]: Number of co-enabled transitions 630 [2022-12-06 07:45:13,590 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:13,591 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 07:45:13,591 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 83 transitions, 829 flow [2022-12-06 07:45:13,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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) [2022-12-06 07:45:13,591 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:13,591 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:13,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 07:45:13,591 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:13,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:13,592 INFO L85 PathProgramCache]: Analyzing trace with hash 293782741, now seen corresponding path program 1 times [2022-12-06 07:45:13,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:13,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596866832] [2022-12-06 07:45:13,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:13,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:14,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:14,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:14,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596866832] [2022-12-06 07:45:14,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596866832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:14,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:14,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:45:14,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708013338] [2022-12-06 07:45:14,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:14,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:45:14,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:14,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:45:14,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:45:14,283 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 07:45:14,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 83 transitions, 829 flow. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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) [2022-12-06 07:45:14,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:14,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 07:45:14,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:14,684 INFO L130 PetriNetUnfolder]: 1244/1882 cut-off events. [2022-12-06 07:45:14,684 INFO L131 PetriNetUnfolder]: For 8495/8495 co-relation queries the response was YES. [2022-12-06 07:45:14,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8397 conditions, 1882 events. 1244/1882 cut-off events. For 8495/8495 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 8279 event pairs, 344 based on Foata normal form. 1/1883 useless extension candidates. Maximal degree in co-relation 7189. Up to 1734 conditions per place. [2022-12-06 07:45:14,704 INFO L137 encePairwiseOnDemand]: 21/34 looper letters, 103 selfloop transitions, 23 changer transitions 5/131 dead transitions. [2022-12-06 07:45:14,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 131 transitions, 1363 flow [2022-12-06 07:45:14,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:45:14,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:45:14,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2022-12-06 07:45:14,706 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36134453781512604 [2022-12-06 07:45:14,706 INFO L175 Difference]: Start difference. First operand has 62 places, 83 transitions, 829 flow. Second operand 7 states and 86 transitions. [2022-12-06 07:45:14,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 131 transitions, 1363 flow [2022-12-06 07:45:14,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 131 transitions, 1314 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-06 07:45:14,726 INFO L231 Difference]: Finished difference. Result has 69 places, 92 transitions, 936 flow [2022-12-06 07:45:14,726 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=936, PETRI_PLACES=69, PETRI_TRANSITIONS=92} [2022-12-06 07:45:14,727 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 39 predicate places. [2022-12-06 07:45:14,727 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:14,727 INFO L89 Accepts]: Start accepts. Operand has 69 places, 92 transitions, 936 flow [2022-12-06 07:45:14,728 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:14,728 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:14,729 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 92 transitions, 936 flow [2022-12-06 07:45:14,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 92 transitions, 936 flow [2022-12-06 07:45:14,753 INFO L130 PetriNetUnfolder]: 106/301 cut-off events. [2022-12-06 07:45:14,753 INFO L131 PetriNetUnfolder]: For 1344/1437 co-relation queries the response was YES. [2022-12-06 07:45:14,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1115 conditions, 301 events. 106/301 cut-off events. For 1344/1437 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1513 event pairs, 3 based on Foata normal form. 18/301 useless extension candidates. Maximal degree in co-relation 1047. Up to 92 conditions per place. [2022-12-06 07:45:14,756 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 92 transitions, 936 flow [2022-12-06 07:45:14,756 INFO L188 LiptonReduction]: Number of co-enabled transitions 690 [2022-12-06 07:45:14,764 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [503] L48-5-->L48-5: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_36 v_~N~0_63) (= v_thread1Thread1of1ForFork1_~i~0_35 (+ v_thread1Thread1of1ForFork1_~i~0_36 1)) (= v_~sum1~0_53 (+ v_~sum1~0_54 (select (select |v_#memory_int_127| v_~A~0.base_64) (+ (* v_thread1Thread1of1ForFork1_~i~0_36 4) v_~A~0.offset_64))))) InVars {~A~0.base=v_~A~0.base_64, ~A~0.offset=v_~A~0.offset_64, ~sum1~0=v_~sum1~0_54, #memory_int=|v_#memory_int_127|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_36, ~N~0=v_~N~0_63} OutVars{~A~0.base=v_~A~0.base_64, ~A~0.offset=v_~A~0.offset_64, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_27|, ~sum1~0=v_~sum1~0_53, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, #memory_int=|v_#memory_int_127|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, ~N~0=v_~N~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] [2022-12-06 07:45:14,820 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [523] $Ultimate##0-->L56-5: Formula: (and (= (+ v_~sum2~0_64 (select (select |v_#memory_int_157| v_~A~0.base_86) v_~A~0.offset_86)) v_~sum2~0_63) (= v_thread2Thread1of1ForFork2_~i~1_43 1) (< 0 v_~M~0_67)) InVars {~A~0.base=v_~A~0.base_86, ~A~0.offset=v_~A~0.offset_86, ~M~0=v_~M~0_67, #memory_int=|v_#memory_int_157|, ~sum2~0=v_~sum2~0_64} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_86, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_43, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_25|, ~A~0.offset=v_~A~0.offset_86, ~M~0=v_~M~0_67, #memory_int=|v_#memory_int_157|, ~sum2~0=v_~sum2~0_63} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0] [2022-12-06 07:45:14,917 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [532] $Ultimate##0-->L48-5: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_43 (+ 1 v_~N~0_93)) (= v_~sum1~0_77 (+ v_~sum1~0_78 (select (select |v_#memory_int_171| v_~A~0.base_100) (+ v_~A~0.offset_100 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_43 4))))) (= v_thread1Thread1of1ForFork1_~i~0_43 1)) InVars {~A~0.base=v_~A~0.base_100, ~A~0.offset=v_~A~0.offset_100, ~sum1~0=v_~sum1~0_78, #memory_int=|v_#memory_int_171|, ~N~0=v_~N~0_93} OutVars{~A~0.base=v_~A~0.base_100, ~A~0.offset=v_~A~0.offset_100, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_31|, ~sum1~0=v_~sum1~0_77, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_171|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_43, ~N~0=v_~N~0_93} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [536] L64-5-->L48-5: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_59 v_~N~0_101)) (= |v_thread3Thread1of1ForFork0_#res.offset_15| 0) (= 0 |v_thread3Thread1of1ForFork0_#res.base_15|) (= v_thread1Thread1of1ForFork1_~i~0_47 (+ v_thread1Thread1of1ForFork1_~i~0_48 1)) (< v_thread1Thread1of1ForFork1_~i~0_48 v_~N~0_101) (= v_~sum1~0_85 (+ (select (select |v_#memory_int_187| v_~A~0.base_110) (+ v_~A~0.offset_110 (* v_thread1Thread1of1ForFork1_~i~0_48 4))) v_~sum1~0_86))) InVars {~A~0.base=v_~A~0.base_110, ~A~0.offset=v_~A~0.offset_110, ~sum1~0=v_~sum1~0_86, #memory_int=|v_#memory_int_187|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_59, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_48, ~N~0=v_~N~0_101} OutVars{~A~0.base=v_~A~0.base_110, ~A~0.offset=v_~A~0.offset_110, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_33|, ~sum1~0=v_~sum1~0_85, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_25|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_15|, #memory_int=|v_#memory_int_187|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_59, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_47, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_15|, ~N~0=v_~N~0_101} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#res.base] [2022-12-06 07:45:14,997 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:45:14,997 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 270 [2022-12-06 07:45:14,997 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 91 transitions, 952 flow [2022-12-06 07:45:14,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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) [2022-12-06 07:45:14,998 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:14,998 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:14,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 07:45:14,998 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:14,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:14,998 INFO L85 PathProgramCache]: Analyzing trace with hash 791534071, now seen corresponding path program 2 times [2022-12-06 07:45:14,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:14,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595915161] [2022-12-06 07:45:14,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:14,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:15,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:15,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595915161] [2022-12-06 07:45:15,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595915161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:15,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:15,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:45:15,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553574738] [2022-12-06 07:45:15,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:15,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:45:15,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:15,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:45:15,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:45:15,541 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 37 [2022-12-06 07:45:15,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 91 transitions, 952 flow. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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) [2022-12-06 07:45:15,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:15,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 37 [2022-12-06 07:45:15,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:15,864 INFO L130 PetriNetUnfolder]: 1238/1890 cut-off events. [2022-12-06 07:45:15,864 INFO L131 PetriNetUnfolder]: For 9733/9886 co-relation queries the response was YES. [2022-12-06 07:45:15,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8780 conditions, 1890 events. 1238/1890 cut-off events. For 9733/9886 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 8673 event pairs, 228 based on Foata normal form. 58/1946 useless extension candidates. Maximal degree in co-relation 8361. Up to 1295 conditions per place. [2022-12-06 07:45:15,878 INFO L137 encePairwiseOnDemand]: 22/37 looper letters, 86 selfloop transitions, 39 changer transitions 4/131 dead transitions. [2022-12-06 07:45:15,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 131 transitions, 1418 flow [2022-12-06 07:45:15,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:45:15,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:45:15,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2022-12-06 07:45:15,879 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4810810810810811 [2022-12-06 07:45:15,879 INFO L175 Difference]: Start difference. First operand has 68 places, 91 transitions, 952 flow. Second operand 5 states and 89 transitions. [2022-12-06 07:45:15,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 131 transitions, 1418 flow [2022-12-06 07:45:15,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 131 transitions, 1346 flow, removed 29 selfloop flow, removed 3 redundant places. [2022-12-06 07:45:15,905 INFO L231 Difference]: Finished difference. Result has 70 places, 94 transitions, 1023 flow [2022-12-06 07:45:15,905 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1023, PETRI_PLACES=70, PETRI_TRANSITIONS=94} [2022-12-06 07:45:15,906 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 40 predicate places. [2022-12-06 07:45:15,906 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:15,906 INFO L89 Accepts]: Start accepts. Operand has 70 places, 94 transitions, 1023 flow [2022-12-06 07:45:15,907 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:15,907 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:15,908 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 94 transitions, 1023 flow [2022-12-06 07:45:15,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 94 transitions, 1023 flow [2022-12-06 07:45:15,939 INFO L130 PetriNetUnfolder]: 120/342 cut-off events. [2022-12-06 07:45:15,939 INFO L131 PetriNetUnfolder]: For 1669/1752 co-relation queries the response was YES. [2022-12-06 07:45:15,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1316 conditions, 342 events. 120/342 cut-off events. For 1669/1752 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1818 event pairs, 3 based on Foata normal form. 16/332 useless extension candidates. Maximal degree in co-relation 1112. Up to 94 conditions per place. [2022-12-06 07:45:15,943 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 94 transitions, 1023 flow [2022-12-06 07:45:15,943 INFO L188 LiptonReduction]: Number of co-enabled transitions 718 [2022-12-06 07:45:15,944 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:15,945 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-06 07:45:15,945 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 94 transitions, 1023 flow [2022-12-06 07:45:15,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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) [2022-12-06 07:45:15,946 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:15,946 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:15,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 07:45:15,947 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:15,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:15,947 INFO L85 PathProgramCache]: Analyzing trace with hash -2044737383, now seen corresponding path program 1 times [2022-12-06 07:45:15,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:15,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703053265] [2022-12-06 07:45:15,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:15,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:15,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:15,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:15,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703053265] [2022-12-06 07:45:15,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703053265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:15,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:15,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:45:15,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226992112] [2022-12-06 07:45:15,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:15,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:45:15,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:15,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:45:15,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:45:15,997 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 37 [2022-12-06 07:45:15,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 94 transitions, 1023 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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) [2022-12-06 07:45:15,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:15,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 37 [2022-12-06 07:45:15,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:16,258 INFO L130 PetriNetUnfolder]: 1586/2424 cut-off events. [2022-12-06 07:45:16,258 INFO L131 PetriNetUnfolder]: For 13935/14022 co-relation queries the response was YES. [2022-12-06 07:45:16,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11694 conditions, 2424 events. 1586/2424 cut-off events. For 13935/14022 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 11417 event pairs, 764 based on Foata normal form. 35/2451 useless extension candidates. Maximal degree in co-relation 10316. Up to 1688 conditions per place. [2022-12-06 07:45:16,275 INFO L137 encePairwiseOnDemand]: 34/37 looper letters, 114 selfloop transitions, 1 changer transitions 0/117 dead transitions. [2022-12-06 07:45:16,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 117 transitions, 1396 flow [2022-12-06 07:45:16,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:45:16,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:45:16,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-12-06 07:45:16,276 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6126126126126126 [2022-12-06 07:45:16,276 INFO L175 Difference]: Start difference. First operand has 70 places, 94 transitions, 1023 flow. Second operand 3 states and 68 transitions. [2022-12-06 07:45:16,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 117 transitions, 1396 flow [2022-12-06 07:45:16,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 117 transitions, 1325 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-12-06 07:45:16,299 INFO L231 Difference]: Finished difference. Result has 69 places, 92 transitions, 940 flow [2022-12-06 07:45:16,299 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=940, PETRI_PLACES=69, PETRI_TRANSITIONS=92} [2022-12-06 07:45:16,299 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 39 predicate places. [2022-12-06 07:45:16,299 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:16,299 INFO L89 Accepts]: Start accepts. Operand has 69 places, 92 transitions, 940 flow [2022-12-06 07:45:16,300 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:16,300 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:16,300 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 92 transitions, 940 flow [2022-12-06 07:45:16,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 92 transitions, 940 flow [2022-12-06 07:45:16,331 INFO L130 PetriNetUnfolder]: 139/407 cut-off events. [2022-12-06 07:45:16,332 INFO L131 PetriNetUnfolder]: For 1506/1589 co-relation queries the response was YES. [2022-12-06 07:45:16,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1464 conditions, 407 events. 139/407 cut-off events. For 1506/1589 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2331 event pairs, 4 based on Foata normal form. 16/397 useless extension candidates. Maximal degree in co-relation 1256. Up to 127 conditions per place. [2022-12-06 07:45:16,337 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 92 transitions, 940 flow [2022-12-06 07:45:16,337 INFO L188 LiptonReduction]: Number of co-enabled transitions 710 [2022-12-06 07:45:16,338 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:16,339 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-06 07:45:16,339 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 92 transitions, 940 flow [2022-12-06 07:45:16,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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) [2022-12-06 07:45:16,339 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:16,339 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:16,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 07:45:16,339 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:16,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:16,340 INFO L85 PathProgramCache]: Analyzing trace with hash 998026839, now seen corresponding path program 2 times [2022-12-06 07:45:16,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:16,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230332189] [2022-12-06 07:45:16,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:16,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:16,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:16,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:16,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230332189] [2022-12-06 07:45:16,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230332189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:16,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:16,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:45:16,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940319622] [2022-12-06 07:45:16,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:16,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:45:16,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:16,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:45:16,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:45:16,900 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 07:45:16,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 92 transitions, 940 flow. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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) [2022-12-06 07:45:16,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:16,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 07:45:16,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:17,297 INFO L130 PetriNetUnfolder]: 1702/2557 cut-off events. [2022-12-06 07:45:17,297 INFO L131 PetriNetUnfolder]: For 12270/12270 co-relation queries the response was YES. [2022-12-06 07:45:17,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11779 conditions, 2557 events. 1702/2557 cut-off events. For 12270/12270 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 11773 event pairs, 577 based on Foata normal form. 1/2558 useless extension candidates. Maximal degree in co-relation 10409. Up to 2469 conditions per place. [2022-12-06 07:45:17,315 INFO L137 encePairwiseOnDemand]: 23/35 looper letters, 99 selfloop transitions, 21 changer transitions 7/127 dead transitions. [2022-12-06 07:45:17,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 127 transitions, 1382 flow [2022-12-06 07:45:17,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:45:17,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:45:17,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-12-06 07:45:17,316 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3142857142857143 [2022-12-06 07:45:17,316 INFO L175 Difference]: Start difference. First operand has 69 places, 92 transitions, 940 flow. Second operand 7 states and 77 transitions. [2022-12-06 07:45:17,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 127 transitions, 1382 flow [2022-12-06 07:45:17,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 127 transitions, 1381 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:45:17,346 INFO L231 Difference]: Finished difference. Result has 76 places, 96 transitions, 1027 flow [2022-12-06 07:45:17,346 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1027, PETRI_PLACES=76, PETRI_TRANSITIONS=96} [2022-12-06 07:45:17,347 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 46 predicate places. [2022-12-06 07:45:17,347 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:17,347 INFO L89 Accepts]: Start accepts. Operand has 76 places, 96 transitions, 1027 flow [2022-12-06 07:45:17,349 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:17,349 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:17,349 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 96 transitions, 1027 flow [2022-12-06 07:45:17,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 96 transitions, 1027 flow [2022-12-06 07:45:17,383 INFO L130 PetriNetUnfolder]: 144/421 cut-off events. [2022-12-06 07:45:17,383 INFO L131 PetriNetUnfolder]: For 1715/1798 co-relation queries the response was YES. [2022-12-06 07:45:17,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1562 conditions, 421 events. 144/421 cut-off events. For 1715/1798 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2409 event pairs, 4 based on Foata normal form. 16/410 useless extension candidates. Maximal degree in co-relation 1476. Up to 128 conditions per place. [2022-12-06 07:45:17,388 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 96 transitions, 1027 flow [2022-12-06 07:45:17,388 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:45:17,395 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [523] $Ultimate##0-->L56-5: Formula: (and (= (+ v_~sum2~0_64 (select (select |v_#memory_int_157| v_~A~0.base_86) v_~A~0.offset_86)) v_~sum2~0_63) (= v_thread2Thread1of1ForFork2_~i~1_43 1) (< 0 v_~M~0_67)) InVars {~A~0.base=v_~A~0.base_86, ~A~0.offset=v_~A~0.offset_86, ~M~0=v_~M~0_67, #memory_int=|v_#memory_int_157|, ~sum2~0=v_~sum2~0_64} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_86, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_43, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_25|, ~A~0.offset=v_~A~0.offset_86, ~M~0=v_~M~0_67, #memory_int=|v_#memory_int_157|, ~sum2~0=v_~sum2~0_63} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0] [2022-12-06 07:45:17,449 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [532] $Ultimate##0-->L48-5: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_43 (+ 1 v_~N~0_93)) (= v_~sum1~0_77 (+ v_~sum1~0_78 (select (select |v_#memory_int_171| v_~A~0.base_100) (+ v_~A~0.offset_100 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_43 4))))) (= v_thread1Thread1of1ForFork1_~i~0_43 1)) InVars {~A~0.base=v_~A~0.base_100, ~A~0.offset=v_~A~0.offset_100, ~sum1~0=v_~sum1~0_78, #memory_int=|v_#memory_int_171|, ~N~0=v_~N~0_93} OutVars{~A~0.base=v_~A~0.base_100, ~A~0.offset=v_~A~0.offset_100, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_31|, ~sum1~0=v_~sum1~0_77, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_171|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_43, ~N~0=v_~N~0_93} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] [2022-12-06 07:45:17,502 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:45:17,502 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 155 [2022-12-06 07:45:17,503 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 95 transitions, 1034 flow [2022-12-06 07:45:17,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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) [2022-12-06 07:45:17,503 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:17,503 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:17,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 07:45:17,503 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:17,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:17,503 INFO L85 PathProgramCache]: Analyzing trace with hash 702707311, now seen corresponding path program 1 times [2022-12-06 07:45:17,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:17,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015743278] [2022-12-06 07:45:17,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:17,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:17,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:17,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:17,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015743278] [2022-12-06 07:45:17,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015743278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:17,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:17,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:45:17,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687363173] [2022-12-06 07:45:17,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:17,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:45:17,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:17,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:45:17,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:45:17,560 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:45:17,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 95 transitions, 1034 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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) [2022-12-06 07:45:17,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:17,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:45:17,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:17,862 INFO L130 PetriNetUnfolder]: 1568/2381 cut-off events. [2022-12-06 07:45:17,863 INFO L131 PetriNetUnfolder]: For 12877/12877 co-relation queries the response was YES. [2022-12-06 07:45:17,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11249 conditions, 2381 events. 1568/2381 cut-off events. For 12877/12877 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 11065 event pairs, 593 based on Foata normal form. 50/2431 useless extension candidates. Maximal degree in co-relation 11077. Up to 1209 conditions per place. [2022-12-06 07:45:17,879 INFO L137 encePairwiseOnDemand]: 29/37 looper letters, 128 selfloop transitions, 10 changer transitions 7/145 dead transitions. [2022-12-06 07:45:17,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 145 transitions, 1606 flow [2022-12-06 07:45:17,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:45:17,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:45:17,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2022-12-06 07:45:17,880 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5351351351351351 [2022-12-06 07:45:17,880 INFO L175 Difference]: Start difference. First operand has 75 places, 95 transitions, 1034 flow. Second operand 5 states and 99 transitions. [2022-12-06 07:45:17,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 145 transitions, 1606 flow [2022-12-06 07:45:17,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 145 transitions, 1559 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-06 07:45:17,905 INFO L231 Difference]: Finished difference. Result has 78 places, 89 transitions, 955 flow [2022-12-06 07:45:17,906 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=955, PETRI_PLACES=78, PETRI_TRANSITIONS=89} [2022-12-06 07:45:17,906 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 48 predicate places. [2022-12-06 07:45:17,906 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:17,906 INFO L89 Accepts]: Start accepts. Operand has 78 places, 89 transitions, 955 flow [2022-12-06 07:45:17,907 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:17,907 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:17,907 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 89 transitions, 955 flow [2022-12-06 07:45:17,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 89 transitions, 955 flow [2022-12-06 07:45:17,936 INFO L130 PetriNetUnfolder]: 125/364 cut-off events. [2022-12-06 07:45:17,936 INFO L131 PetriNetUnfolder]: For 1429/1470 co-relation queries the response was YES. [2022-12-06 07:45:17,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1400 conditions, 364 events. 125/364 cut-off events. For 1429/1470 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2006 event pairs, 4 based on Foata normal form. 15/358 useless extension candidates. Maximal degree in co-relation 1338. Up to 116 conditions per place. [2022-12-06 07:45:17,940 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 89 transitions, 955 flow [2022-12-06 07:45:17,940 INFO L188 LiptonReduction]: Number of co-enabled transitions 692 [2022-12-06 07:45:17,942 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:17,943 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-06 07:45:17,943 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 89 transitions, 955 flow [2022-12-06 07:45:17,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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) [2022-12-06 07:45:17,943 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:17,943 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:17,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 07:45:17,944 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:17,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:17,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1408419310, now seen corresponding path program 1 times [2022-12-06 07:45:17,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:17,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279224241] [2022-12-06 07:45:17,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:17,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:18,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:18,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:18,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279224241] [2022-12-06 07:45:18,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279224241] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:18,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:18,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:45:18,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013400696] [2022-12-06 07:45:18,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:18,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:45:18,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:18,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:45:18,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:45:18,042 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 07:45:18,042 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 89 transitions, 955 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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) [2022-12-06 07:45:18,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:18,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 07:45:18,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:18,393 INFO L130 PetriNetUnfolder]: 1528/2324 cut-off events. [2022-12-06 07:45:18,394 INFO L131 PetriNetUnfolder]: For 13925/14015 co-relation queries the response was YES. [2022-12-06 07:45:18,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11434 conditions, 2324 events. 1528/2324 cut-off events. For 13925/14015 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 10745 event pairs, 660 based on Foata normal form. 89/2405 useless extension candidates. Maximal degree in co-relation 11364. Up to 1409 conditions per place. [2022-12-06 07:45:18,413 INFO L137 encePairwiseOnDemand]: 29/34 looper letters, 124 selfloop transitions, 4 changer transitions 0/130 dead transitions. [2022-12-06 07:45:18,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 130 transitions, 1511 flow [2022-12-06 07:45:18,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:45:18,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:45:18,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-12-06 07:45:18,414 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6029411764705882 [2022-12-06 07:45:18,414 INFO L175 Difference]: Start difference. First operand has 77 places, 89 transitions, 955 flow. Second operand 4 states and 82 transitions. [2022-12-06 07:45:18,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 130 transitions, 1511 flow [2022-12-06 07:45:18,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 130 transitions, 1505 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 07:45:18,438 INFO L231 Difference]: Finished difference. Result has 81 places, 91 transitions, 992 flow [2022-12-06 07:45:18,438 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=992, PETRI_PLACES=81, PETRI_TRANSITIONS=91} [2022-12-06 07:45:18,438 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 51 predicate places. [2022-12-06 07:45:18,438 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:18,438 INFO L89 Accepts]: Start accepts. Operand has 81 places, 91 transitions, 992 flow [2022-12-06 07:45:18,439 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:18,439 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:18,439 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 91 transitions, 992 flow [2022-12-06 07:45:18,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 91 transitions, 992 flow [2022-12-06 07:45:18,472 INFO L130 PetriNetUnfolder]: 143/403 cut-off events. [2022-12-06 07:45:18,472 INFO L131 PetriNetUnfolder]: For 1720/1781 co-relation queries the response was YES. [2022-12-06 07:45:18,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1629 conditions, 403 events. 143/403 cut-off events. For 1720/1781 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2249 event pairs, 10 based on Foata normal form. 18/399 useless extension candidates. Maximal degree in co-relation 1437. Up to 142 conditions per place. [2022-12-06 07:45:18,477 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 91 transitions, 992 flow [2022-12-06 07:45:18,478 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:45:18,480 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:18,482 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-06 07:45:18,482 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 91 transitions, 992 flow [2022-12-06 07:45:18,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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) [2022-12-06 07:45:18,482 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:18,482 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:18,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 07:45:18,483 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:18,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:18,483 INFO L85 PathProgramCache]: Analyzing trace with hash 569166126, now seen corresponding path program 1 times [2022-12-06 07:45:18,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:18,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26569932] [2022-12-06 07:45:18,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:18,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:18,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:18,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:18,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26569932] [2022-12-06 07:45:18,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26569932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:18,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:18,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:45:18,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239988704] [2022-12-06 07:45:18,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:18,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:45:18,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:18,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:45:18,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:45:18,550 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 07:45:18,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 91 transitions, 992 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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) [2022-12-06 07:45:18,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:18,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 07:45:18,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:18,851 INFO L130 PetriNetUnfolder]: 1427/2222 cut-off events. [2022-12-06 07:45:18,852 INFO L131 PetriNetUnfolder]: For 15700/15839 co-relation queries the response was YES. [2022-12-06 07:45:18,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11259 conditions, 2222 events. 1427/2222 cut-off events. For 15700/15839 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10597 event pairs, 630 based on Foata normal form. 158/2378 useless extension candidates. Maximal degree in co-relation 10315. Up to 1169 conditions per place. [2022-12-06 07:45:18,869 INFO L137 encePairwiseOnDemand]: 30/34 looper letters, 108 selfloop transitions, 5 changer transitions 1/116 dead transitions. [2022-12-06 07:45:18,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 116 transitions, 1370 flow [2022-12-06 07:45:18,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:45:18,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:45:18,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-12-06 07:45:18,870 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5661764705882353 [2022-12-06 07:45:18,870 INFO L175 Difference]: Start difference. First operand has 81 places, 91 transitions, 992 flow. Second operand 4 states and 77 transitions. [2022-12-06 07:45:18,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 116 transitions, 1370 flow [2022-12-06 07:45:18,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 116 transitions, 1355 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 07:45:18,893 INFO L231 Difference]: Finished difference. Result has 83 places, 84 transitions, 933 flow [2022-12-06 07:45:18,893 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=933, PETRI_PLACES=83, PETRI_TRANSITIONS=84} [2022-12-06 07:45:18,894 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 53 predicate places. [2022-12-06 07:45:18,894 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:18,894 INFO L89 Accepts]: Start accepts. Operand has 83 places, 84 transitions, 933 flow [2022-12-06 07:45:18,895 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:18,895 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:18,896 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 84 transitions, 933 flow [2022-12-06 07:45:18,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 84 transitions, 933 flow [2022-12-06 07:45:18,926 INFO L130 PetriNetUnfolder]: 119/368 cut-off events. [2022-12-06 07:45:18,927 INFO L131 PetriNetUnfolder]: For 1587/1644 co-relation queries the response was YES. [2022-12-06 07:45:18,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1476 conditions, 368 events. 119/368 cut-off events. For 1587/1644 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2135 event pairs, 11 based on Foata normal form. 17/364 useless extension candidates. Maximal degree in co-relation 1326. Up to 122 conditions per place. [2022-12-06 07:45:18,931 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 84 transitions, 933 flow [2022-12-06 07:45:18,931 INFO L188 LiptonReduction]: Number of co-enabled transitions 656 [2022-12-06 07:45:19,160 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:45:19,161 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 267 [2022-12-06 07:45:19,161 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 84 transitions, 944 flow [2022-12-06 07:45:19,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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) [2022-12-06 07:45:19,161 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:19,161 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:19,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 07:45:19,161 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:19,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:19,162 INFO L85 PathProgramCache]: Analyzing trace with hash 2141029274, now seen corresponding path program 1 times [2022-12-06 07:45:19,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:19,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645950509] [2022-12-06 07:45:19,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:19,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:19,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:19,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:19,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645950509] [2022-12-06 07:45:19,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645950509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:19,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:19,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:45:19,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640040889] [2022-12-06 07:45:19,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:19,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:45:19,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:19,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:45:19,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:45:19,251 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 07:45:19,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 84 transitions, 944 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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) [2022-12-06 07:45:19,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:19,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 07:45:19,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:19,568 INFO L130 PetriNetUnfolder]: 1380/2175 cut-off events. [2022-12-06 07:45:19,568 INFO L131 PetriNetUnfolder]: For 14458/14458 co-relation queries the response was YES. [2022-12-06 07:45:19,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11013 conditions, 2175 events. 1380/2175 cut-off events. For 14458/14458 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 10470 event pairs, 551 based on Foata normal form. 137/2312 useless extension candidates. Maximal degree in co-relation 9991. Up to 833 conditions per place. [2022-12-06 07:45:19,585 INFO L137 encePairwiseOnDemand]: 31/39 looper letters, 99 selfloop transitions, 12 changer transitions 5/116 dead transitions. [2022-12-06 07:45:19,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 116 transitions, 1380 flow [2022-12-06 07:45:19,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:45:19,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:45:19,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-12-06 07:45:19,586 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.532051282051282 [2022-12-06 07:45:19,586 INFO L175 Difference]: Start difference. First operand has 83 places, 84 transitions, 944 flow. Second operand 4 states and 83 transitions. [2022-12-06 07:45:19,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 116 transitions, 1380 flow [2022-12-06 07:45:19,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 116 transitions, 1338 flow, removed 13 selfloop flow, removed 3 redundant places. [2022-12-06 07:45:19,627 INFO L231 Difference]: Finished difference. Result has 84 places, 75 transitions, 851 flow [2022-12-06 07:45:19,627 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=851, PETRI_PLACES=84, PETRI_TRANSITIONS=75} [2022-12-06 07:45:19,627 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 54 predicate places. [2022-12-06 07:45:19,627 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:19,628 INFO L89 Accepts]: Start accepts. Operand has 84 places, 75 transitions, 851 flow [2022-12-06 07:45:19,628 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:19,628 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:19,629 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 75 transitions, 851 flow [2022-12-06 07:45:19,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 75 transitions, 851 flow [2022-12-06 07:45:19,655 INFO L130 PetriNetUnfolder]: 90/319 cut-off events. [2022-12-06 07:45:19,655 INFO L131 PetriNetUnfolder]: For 1594/1643 co-relation queries the response was YES. [2022-12-06 07:45:19,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1315 conditions, 319 events. 90/319 cut-off events. For 1594/1643 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1861 event pairs, 10 based on Foata normal form. 13/312 useless extension candidates. Maximal degree in co-relation 1175. Up to 99 conditions per place. [2022-12-06 07:45:19,659 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 75 transitions, 851 flow [2022-12-06 07:45:19,659 INFO L188 LiptonReduction]: Number of co-enabled transitions 560 [2022-12-06 07:45:19,660 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:19,661 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-06 07:45:19,661 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 75 transitions, 851 flow [2022-12-06 07:45:19,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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) [2022-12-06 07:45:19,661 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:19,662 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:19,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 07:45:19,662 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:19,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:19,662 INFO L85 PathProgramCache]: Analyzing trace with hash 686814983, now seen corresponding path program 1 times [2022-12-06 07:45:19,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:19,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673460186] [2022-12-06 07:45:19,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:19,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:19,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:19,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:19,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673460186] [2022-12-06 07:45:19,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673460186] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:19,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:19,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:45:19,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396518228] [2022-12-06 07:45:19,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:19,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:45:19,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:19,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:45:19,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:45:19,783 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 07:45:19,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 75 transitions, 851 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 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) [2022-12-06 07:45:19,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:19,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 07:45:19,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:20,087 INFO L130 PetriNetUnfolder]: 1376/2195 cut-off events. [2022-12-06 07:45:20,087 INFO L131 PetriNetUnfolder]: For 15072/15072 co-relation queries the response was YES. [2022-12-06 07:45:20,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10914 conditions, 2195 events. 1376/2195 cut-off events. For 15072/15072 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 10635 event pairs, 844 based on Foata normal form. 12/2207 useless extension candidates. Maximal degree in co-relation 9924. Up to 1291 conditions per place. [2022-12-06 07:45:20,099 INFO L137 encePairwiseOnDemand]: 35/39 looper letters, 95 selfloop transitions, 2 changer transitions 1/98 dead transitions. [2022-12-06 07:45:20,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 98 transitions, 1182 flow [2022-12-06 07:45:20,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:45:20,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:45:20,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-12-06 07:45:20,101 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2022-12-06 07:45:20,101 INFO L175 Difference]: Start difference. First operand has 84 places, 75 transitions, 851 flow. Second operand 3 states and 69 transitions. [2022-12-06 07:45:20,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 98 transitions, 1182 flow [2022-12-06 07:45:20,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 98 transitions, 1166 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:45:20,131 INFO L231 Difference]: Finished difference. Result has 84 places, 73 transitions, 801 flow [2022-12-06 07:45:20,131 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=801, PETRI_PLACES=84, PETRI_TRANSITIONS=73} [2022-12-06 07:45:20,131 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 54 predicate places. [2022-12-06 07:45:20,131 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:20,132 INFO L89 Accepts]: Start accepts. Operand has 84 places, 73 transitions, 801 flow [2022-12-06 07:45:20,134 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:20,135 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:20,135 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 73 transitions, 801 flow [2022-12-06 07:45:20,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 73 transitions, 801 flow [2022-12-06 07:45:20,162 INFO L130 PetriNetUnfolder]: 86/315 cut-off events. [2022-12-06 07:45:20,163 INFO L131 PetriNetUnfolder]: For 1428/1476 co-relation queries the response was YES. [2022-12-06 07:45:20,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1282 conditions, 315 events. 86/315 cut-off events. For 1428/1476 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1852 event pairs, 10 based on Foata normal form. 10/305 useless extension candidates. Maximal degree in co-relation 1142. Up to 99 conditions per place. [2022-12-06 07:45:20,166 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 73 transitions, 801 flow [2022-12-06 07:45:20,166 INFO L188 LiptonReduction]: Number of co-enabled transitions 542 [2022-12-06 07:45:20,167 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:20,168 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-06 07:45:20,168 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 73 transitions, 801 flow [2022-12-06 07:45:20,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 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) [2022-12-06 07:45:20,169 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:20,169 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:20,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 07:45:20,169 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:20,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:20,169 INFO L85 PathProgramCache]: Analyzing trace with hash 586471010, now seen corresponding path program 1 times [2022-12-06 07:45:20,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:20,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871047725] [2022-12-06 07:45:20,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:20,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:20,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:20,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:20,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871047725] [2022-12-06 07:45:20,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871047725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:20,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:20,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:45:20,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683450076] [2022-12-06 07:45:20,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:20,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:45:20,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:20,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:45:20,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:45:20,226 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:45:20,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 73 transitions, 801 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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) [2022-12-06 07:45:20,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:20,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:45:20,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:20,536 INFO L130 PetriNetUnfolder]: 1443/2302 cut-off events. [2022-12-06 07:45:20,536 INFO L131 PetriNetUnfolder]: For 14754/14754 co-relation queries the response was YES. [2022-12-06 07:45:20,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11356 conditions, 2302 events. 1443/2302 cut-off events. For 14754/14754 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 11330 event pairs, 602 based on Foata normal form. 60/2362 useless extension candidates. Maximal degree in co-relation 10366. Up to 848 conditions per place. [2022-12-06 07:45:20,553 INFO L137 encePairwiseOnDemand]: 31/37 looper letters, 107 selfloop transitions, 4 changer transitions 6/117 dead transitions. [2022-12-06 07:45:20,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 117 transitions, 1301 flow [2022-12-06 07:45:20,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:45:20,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:45:20,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2022-12-06 07:45:20,554 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4810810810810811 [2022-12-06 07:45:20,554 INFO L175 Difference]: Start difference. First operand has 84 places, 73 transitions, 801 flow. Second operand 5 states and 89 transitions. [2022-12-06 07:45:20,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 117 transitions, 1301 flow [2022-12-06 07:45:20,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 117 transitions, 1299 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-06 07:45:20,595 INFO L231 Difference]: Finished difference. Result has 89 places, 70 transitions, 739 flow [2022-12-06 07:45:20,595 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=739, PETRI_PLACES=89, PETRI_TRANSITIONS=70} [2022-12-06 07:45:20,595 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 59 predicate places. [2022-12-06 07:45:20,595 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:20,595 INFO L89 Accepts]: Start accepts. Operand has 89 places, 70 transitions, 739 flow [2022-12-06 07:45:20,596 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:20,596 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:20,597 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 70 transitions, 739 flow [2022-12-06 07:45:20,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 70 transitions, 739 flow [2022-12-06 07:45:20,623 INFO L130 PetriNetUnfolder]: 82/295 cut-off events. [2022-12-06 07:45:20,623 INFO L131 PetriNetUnfolder]: For 1368/1414 co-relation queries the response was YES. [2022-12-06 07:45:20,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1241 conditions, 295 events. 82/295 cut-off events. For 1368/1414 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1665 event pairs, 10 based on Foata normal form. 8/286 useless extension candidates. Maximal degree in co-relation 1098. Up to 98 conditions per place. [2022-12-06 07:45:20,626 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 70 transitions, 739 flow [2022-12-06 07:45:20,628 INFO L188 LiptonReduction]: Number of co-enabled transitions 530 [2022-12-06 07:45:20,629 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [525] $Ultimate##0-->L56-5: Formula: (and (< v_thread2Thread1of1ForFork2_~i~1_49 (+ 1 v_~M~0_71)) (= (+ v_~sum2~0_68 (select (select |v_#memory_int_159| v_~A~0.base_88) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_49) (- 4) v_~A~0.offset_88))) v_~sum2~0_67) (= v_thread2Thread1of1ForFork2_~i~1_49 1)) InVars {~A~0.base=v_~A~0.base_88, ~A~0.offset=v_~A~0.offset_88, ~M~0=v_~M~0_71, #memory_int=|v_#memory_int_159|, ~sum2~0=v_~sum2~0_68} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_19|, ~A~0.base=v_~A~0.base_88, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_49, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_27|, ~A~0.offset=v_~A~0.offset_88, ~M~0=v_~M~0_71, #memory_int=|v_#memory_int_159|, ~sum2~0=v_~sum2~0_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0] and [532] $Ultimate##0-->L48-5: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_43 (+ 1 v_~N~0_93)) (= v_~sum1~0_77 (+ v_~sum1~0_78 (select (select |v_#memory_int_171| v_~A~0.base_100) (+ v_~A~0.offset_100 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_43 4))))) (= v_thread1Thread1of1ForFork1_~i~0_43 1)) InVars {~A~0.base=v_~A~0.base_100, ~A~0.offset=v_~A~0.offset_100, ~sum1~0=v_~sum1~0_78, #memory_int=|v_#memory_int_171|, ~N~0=v_~N~0_93} OutVars{~A~0.base=v_~A~0.base_100, ~A~0.offset=v_~A~0.offset_100, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_31|, ~sum1~0=v_~sum1~0_77, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_171|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_43, ~N~0=v_~N~0_93} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] [2022-12-06 07:45:20,668 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:45:20,669 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:45:20,669 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 70 transitions, 750 flow [2022-12-06 07:45:20,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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) [2022-12-06 07:45:20,669 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:20,669 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:20,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 07:45:20,669 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:20,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:20,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1829278939, now seen corresponding path program 1 times [2022-12-06 07:45:20,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:20,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474823507] [2022-12-06 07:45:20,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:20,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:20,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:20,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:20,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474823507] [2022-12-06 07:45:20,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474823507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:20,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:20,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:45:20,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662994028] [2022-12-06 07:45:20,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:20,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:45:20,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:20,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:45:20,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:45:20,760 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 07:45:20,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 70 transitions, 750 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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) [2022-12-06 07:45:20,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:20,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 07:45:20,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:21,049 INFO L130 PetriNetUnfolder]: 1299/2098 cut-off events. [2022-12-06 07:45:21,050 INFO L131 PetriNetUnfolder]: For 13364/13364 co-relation queries the response was YES. [2022-12-06 07:45:21,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10479 conditions, 2098 events. 1299/2098 cut-off events. For 13364/13364 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 10397 event pairs, 360 based on Foata normal form. 24/2122 useless extension candidates. Maximal degree in co-relation 9469. Up to 916 conditions per place. [2022-12-06 07:45:21,066 INFO L137 encePairwiseOnDemand]: 29/38 looper letters, 103 selfloop transitions, 7 changer transitions 2/112 dead transitions. [2022-12-06 07:45:21,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 112 transitions, 1226 flow [2022-12-06 07:45:21,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:45:21,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:45:21,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-12-06 07:45:21,067 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4631578947368421 [2022-12-06 07:45:21,067 INFO L175 Difference]: Start difference. First operand has 89 places, 70 transitions, 750 flow. Second operand 5 states and 88 transitions. [2022-12-06 07:45:21,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 112 transitions, 1226 flow [2022-12-06 07:45:21,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 112 transitions, 1209 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 07:45:21,109 INFO L231 Difference]: Finished difference. Result has 92 places, 68 transitions, 729 flow [2022-12-06 07:45:21,109 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=729, PETRI_PLACES=92, PETRI_TRANSITIONS=68} [2022-12-06 07:45:21,109 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 62 predicate places. [2022-12-06 07:45:21,109 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:21,109 INFO L89 Accepts]: Start accepts. Operand has 92 places, 68 transitions, 729 flow [2022-12-06 07:45:21,110 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:21,110 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:21,110 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 68 transitions, 729 flow [2022-12-06 07:45:21,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 68 transitions, 729 flow [2022-12-06 07:45:21,135 INFO L130 PetriNetUnfolder]: 79/287 cut-off events. [2022-12-06 07:45:21,136 INFO L131 PetriNetUnfolder]: For 1384/1427 co-relation queries the response was YES. [2022-12-06 07:45:21,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1236 conditions, 287 events. 79/287 cut-off events. For 1384/1427 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1620 event pairs, 11 based on Foata normal form. 5/276 useless extension candidates. Maximal degree in co-relation 1091. Up to 100 conditions per place. [2022-12-06 07:45:21,139 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 68 transitions, 729 flow [2022-12-06 07:45:21,139 INFO L188 LiptonReduction]: Number of co-enabled transitions 500 [2022-12-06 07:45:21,140 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:21,141 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-06 07:45:21,141 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 68 transitions, 729 flow [2022-12-06 07:45:21,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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) [2022-12-06 07:45:21,142 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:21,142 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:21,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 07:45:21,142 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:21,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:21,142 INFO L85 PathProgramCache]: Analyzing trace with hash 31418726, now seen corresponding path program 1 times [2022-12-06 07:45:21,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:21,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167808023] [2022-12-06 07:45:21,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:21,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:21,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:21,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:21,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167808023] [2022-12-06 07:45:21,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167808023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:21,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:21,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:45:21,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644033501] [2022-12-06 07:45:21,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:21,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:45:21,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:21,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:45:21,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:45:21,237 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 07:45:21,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 68 transitions, 729 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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) [2022-12-06 07:45:21,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:21,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 07:45:21,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:21,535 INFO L130 PetriNetUnfolder]: 1223/1990 cut-off events. [2022-12-06 07:45:21,535 INFO L131 PetriNetUnfolder]: For 12798/12798 co-relation queries the response was YES. [2022-12-06 07:45:21,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9990 conditions, 1990 events. 1223/1990 cut-off events. For 12798/12798 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 9747 event pairs, 503 based on Foata normal form. 32/2022 useless extension candidates. Maximal degree in co-relation 8862. Up to 677 conditions per place. [2022-12-06 07:45:21,548 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 102 selfloop transitions, 4 changer transitions 4/110 dead transitions. [2022-12-06 07:45:21,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 110 transitions, 1205 flow [2022-12-06 07:45:21,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:45:21,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:45:21,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-12-06 07:45:21,550 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49142857142857144 [2022-12-06 07:45:21,550 INFO L175 Difference]: Start difference. First operand has 92 places, 68 transitions, 729 flow. Second operand 5 states and 86 transitions. [2022-12-06 07:45:21,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 110 transitions, 1205 flow [2022-12-06 07:45:21,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 110 transitions, 1184 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 07:45:21,577 INFO L231 Difference]: Finished difference. Result has 95 places, 64 transitions, 670 flow [2022-12-06 07:45:21,577 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=670, PETRI_PLACES=95, PETRI_TRANSITIONS=64} [2022-12-06 07:45:21,578 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 65 predicate places. [2022-12-06 07:45:21,578 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:21,578 INFO L89 Accepts]: Start accepts. Operand has 95 places, 64 transitions, 670 flow [2022-12-06 07:45:21,579 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:21,579 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:21,579 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 64 transitions, 670 flow [2022-12-06 07:45:21,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 64 transitions, 670 flow [2022-12-06 07:45:21,604 INFO L130 PetriNetUnfolder]: 72/276 cut-off events. [2022-12-06 07:45:21,604 INFO L131 PetriNetUnfolder]: For 1318/1361 co-relation queries the response was YES. [2022-12-06 07:45:21,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1164 conditions, 276 events. 72/276 cut-off events. For 1318/1361 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1544 event pairs, 9 based on Foata normal form. 5/266 useless extension candidates. Maximal degree in co-relation 1037. Up to 97 conditions per place. [2022-12-06 07:45:21,607 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 64 transitions, 670 flow [2022-12-06 07:45:21,607 INFO L188 LiptonReduction]: Number of co-enabled transitions 464 [2022-12-06 07:45:21,620 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [533] $Ultimate##0-->L64-5: Formula: (and (= (+ (select (select |v_#memory_int_173| v_~A~0.base_102) (+ v_~A~0.offset_102 (* 4 v_thread3Thread1of1ForFork0_~i~2_56))) v_~sum3~0_62) v_~sum3~0_61) (= |v_thread2Thread1of1ForFork2_#res.base_15| 0) (< v_thread3Thread1of1ForFork0_~i~2_56 v_~N~0_95) (not (< v_thread2Thread1of1ForFork2_~i~1_57 v_~M~0_83)) (= v_thread2Thread1of1ForFork2_~i~1_57 0) (= (+ v_thread3Thread1of1ForFork0_~i~2_56 1) v_thread3Thread1of1ForFork0_~i~2_55) (= |v_thread2Thread1of1ForFork2_#res.offset_15| 0)) InVars {~A~0.base=v_~A~0.base_102, ~A~0.offset=v_~A~0.offset_102, ~M~0=v_~M~0_83, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_56, #memory_int=|v_#memory_int_173|, ~sum3~0=v_~sum3~0_62, ~N~0=v_~N~0_95} OutVars{~A~0.base=v_~A~0.base_102, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_57, ~A~0.offset=v_~A~0.offset_102, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_15|, ~M~0=v_~M~0_83, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_55, #memory_int=|v_#memory_int_173|, ~sum3~0=v_~sum3~0_61, ~N~0=v_~N~0_95, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_27|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_25|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5, thread2Thread1of1ForFork2_#res.offset] and [532] $Ultimate##0-->L48-5: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_43 (+ 1 v_~N~0_93)) (= v_~sum1~0_77 (+ v_~sum1~0_78 (select (select |v_#memory_int_171| v_~A~0.base_100) (+ v_~A~0.offset_100 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_43 4))))) (= v_thread1Thread1of1ForFork1_~i~0_43 1)) InVars {~A~0.base=v_~A~0.base_100, ~A~0.offset=v_~A~0.offset_100, ~sum1~0=v_~sum1~0_78, #memory_int=|v_#memory_int_171|, ~N~0=v_~N~0_93} OutVars{~A~0.base=v_~A~0.base_100, ~A~0.offset=v_~A~0.offset_100, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_31|, ~sum1~0=v_~sum1~0_77, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_171|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_43, ~N~0=v_~N~0_93} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] [2022-12-06 07:45:21,789 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [548] $Ultimate##0-->L48-5: Formula: (let ((.cse0 (select |v_#memory_int_211| v_~A~0.base_134))) (and (= (+ v_thread3Thread1of1ForFork0_~i~2_96 1) v_thread3Thread1of1ForFork0_~i~2_95) (= v_~sum3~0_99 (+ (select .cse0 (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_96) v_~A~0.offset_134)) v_~sum3~0_100)) (= |v_thread2Thread1of1ForFork2_#res.offset_17| 0) (< v_thread1Thread1of1ForFork1_~i~0_63 (+ v_~N~0_125 1)) (= |v_thread2Thread1of1ForFork2_#res.base_17| 0) (< v_thread3Thread1of1ForFork0_~i~2_96 v_~N~0_125) (= v_thread1Thread1of1ForFork1_~i~0_63 1) (= v_~sum1~0_109 (+ v_~sum1~0_110 (select .cse0 (+ v_~A~0.offset_134 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_63 4))))) (= v_thread2Thread1of1ForFork2_~i~1_65 0) (not (< v_thread2Thread1of1ForFork2_~i~1_65 v_~M~0_99)))) InVars {~A~0.base=v_~A~0.base_134, ~A~0.offset=v_~A~0.offset_134, ~sum1~0=v_~sum1~0_110, ~M~0=v_~M~0_99, #memory_int=|v_#memory_int_211|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_96, ~sum3~0=v_~sum3~0_100, ~N~0=v_~N~0_125} OutVars{~A~0.base=v_~A~0.base_134, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_95, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_63, ~sum3~0=v_~sum3~0_99, ~N~0=v_~N~0_125, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_49|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_65, ~A~0.offset=v_~A~0.offset_134, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_47|, ~sum1~0=v_~sum1~0_109, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_17|, ~M~0=v_~M~0_99, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_39|, #memory_int=|v_#memory_int_211|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_47|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_17|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread2Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_~i~2, thread1Thread1of1ForFork1_~i~0, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5, thread2Thread1of1ForFork2_#res.offset] and [505] L64-5-->L64-5: Formula: (and (= (+ v_thread3Thread1of1ForFork0_~i~2_38 1) v_thread3Thread1of1ForFork0_~i~2_37) (= (+ v_~sum3~0_36 (select (select |v_#memory_int_131| v_~A~0.base_68) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_38) v_~A~0.offset_68))) v_~sum3~0_35) (< v_thread3Thread1of1ForFork0_~i~2_38 v_~N~0_69)) InVars {~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_38, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_36, ~N~0=v_~N~0_69} OutVars{~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_37, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_35, ~N~0=v_~N~0_69, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_21|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5] [2022-12-06 07:45:21,921 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:45:21,921 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 343 [2022-12-06 07:45:21,922 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 63 transitions, 696 flow [2022-12-06 07:45:21,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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) [2022-12-06 07:45:21,922 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:21,922 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:21,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 07:45:21,922 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:21,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:21,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1696855821, now seen corresponding path program 1 times [2022-12-06 07:45:21,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:21,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278664970] [2022-12-06 07:45:21,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:21,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:21,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:21,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:21,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278664970] [2022-12-06 07:45:21,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278664970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:21,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:21,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:45:21,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50842967] [2022-12-06 07:45:21,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:21,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:45:21,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:21,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:45:21,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:45:21,998 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:45:21,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 63 transitions, 696 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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) [2022-12-06 07:45:21,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:21,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:45:21,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:22,407 INFO L130 PetriNetUnfolder]: 1085/1798 cut-off events. [2022-12-06 07:45:22,407 INFO L131 PetriNetUnfolder]: For 12370/12370 co-relation queries the response was YES. [2022-12-06 07:45:22,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9021 conditions, 1798 events. 1085/1798 cut-off events. For 12370/12370 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8912 event pairs, 265 based on Foata normal form. 78/1876 useless extension candidates. Maximal degree in co-relation 8164. Up to 609 conditions per place. [2022-12-06 07:45:22,419 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 120 selfloop transitions, 10 changer transitions 9/139 dead transitions. [2022-12-06 07:45:22,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 139 transitions, 1364 flow [2022-12-06 07:45:22,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:45:22,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:45:22,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 124 transitions. [2022-12-06 07:45:22,421 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37237237237237236 [2022-12-06 07:45:22,421 INFO L175 Difference]: Start difference. First operand has 93 places, 63 transitions, 696 flow. Second operand 9 states and 124 transitions. [2022-12-06 07:45:22,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 139 transitions, 1364 flow [2022-12-06 07:45:22,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 139 transitions, 1270 flow, removed 16 selfloop flow, removed 11 redundant places. [2022-12-06 07:45:22,451 INFO L231 Difference]: Finished difference. Result has 93 places, 53 transitions, 511 flow [2022-12-06 07:45:22,451 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=511, PETRI_PLACES=93, PETRI_TRANSITIONS=53} [2022-12-06 07:45:22,451 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 63 predicate places. [2022-12-06 07:45:22,451 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:22,452 INFO L89 Accepts]: Start accepts. Operand has 93 places, 53 transitions, 511 flow [2022-12-06 07:45:22,452 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:22,452 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:22,453 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 53 transitions, 511 flow [2022-12-06 07:45:22,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 53 transitions, 511 flow [2022-12-06 07:45:22,474 INFO L130 PetriNetUnfolder]: 64/206 cut-off events. [2022-12-06 07:45:22,474 INFO L131 PetriNetUnfolder]: For 735/778 co-relation queries the response was YES. [2022-12-06 07:45:22,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 206 events. 64/206 cut-off events. For 735/778 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 929 event pairs, 7 based on Foata normal form. 3/197 useless extension candidates. Maximal degree in co-relation 869. Up to 91 conditions per place. [2022-12-06 07:45:22,477 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 53 transitions, 511 flow [2022-12-06 07:45:22,477 INFO L188 LiptonReduction]: Number of co-enabled transitions 374 [2022-12-06 07:45:22,478 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:22,480 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 07:45:22,480 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 53 transitions, 511 flow [2022-12-06 07:45:22,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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) [2022-12-06 07:45:22,480 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:22,481 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:22,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 07:45:22,481 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:22,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:22,481 INFO L85 PathProgramCache]: Analyzing trace with hash -622438843, now seen corresponding path program 1 times [2022-12-06 07:45:22,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:22,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812363843] [2022-12-06 07:45:22,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:22,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:22,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:22,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:22,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812363843] [2022-12-06 07:45:22,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812363843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:22,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:22,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:45:22,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137588440] [2022-12-06 07:45:22,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:22,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:45:22,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:22,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:45:22,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:45:22,611 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 07:45:22,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 53 transitions, 511 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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) [2022-12-06 07:45:22,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:22,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 07:45:22,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:22,826 INFO L130 PetriNetUnfolder]: 780/1217 cut-off events. [2022-12-06 07:45:22,827 INFO L131 PetriNetUnfolder]: For 7550/7550 co-relation queries the response was YES. [2022-12-06 07:45:22,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6539 conditions, 1217 events. 780/1217 cut-off events. For 7550/7550 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4932 event pairs, 224 based on Foata normal form. 4/1221 useless extension candidates. Maximal degree in co-relation 6212. Up to 609 conditions per place. [2022-12-06 07:45:22,834 INFO L137 encePairwiseOnDemand]: 30/36 looper letters, 84 selfloop transitions, 4 changer transitions 2/90 dead transitions. [2022-12-06 07:45:22,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 90 transitions, 871 flow [2022-12-06 07:45:22,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:45:22,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:45:22,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-12-06 07:45:22,837 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4388888888888889 [2022-12-06 07:45:22,837 INFO L175 Difference]: Start difference. First operand has 87 places, 53 transitions, 511 flow. Second operand 5 states and 79 transitions. [2022-12-06 07:45:22,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 90 transitions, 871 flow [2022-12-06 07:45:22,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 90 transitions, 762 flow, removed 38 selfloop flow, removed 11 redundant places. [2022-12-06 07:45:22,850 INFO L231 Difference]: Finished difference. Result has 78 places, 49 transitions, 389 flow [2022-12-06 07:45:22,851 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=389, PETRI_PLACES=78, PETRI_TRANSITIONS=49} [2022-12-06 07:45:22,851 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 48 predicate places. [2022-12-06 07:45:22,852 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:22,852 INFO L89 Accepts]: Start accepts. Operand has 78 places, 49 transitions, 389 flow [2022-12-06 07:45:22,852 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:22,852 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:22,852 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 49 transitions, 389 flow [2022-12-06 07:45:22,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 49 transitions, 389 flow [2022-12-06 07:45:22,867 INFO L130 PetriNetUnfolder]: 61/191 cut-off events. [2022-12-06 07:45:22,867 INFO L131 PetriNetUnfolder]: For 503/544 co-relation queries the response was YES. [2022-12-06 07:45:22,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 717 conditions, 191 events. 61/191 cut-off events. For 503/544 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 831 event pairs, 7 based on Foata normal form. 3/182 useless extension candidates. Maximal degree in co-relation 635. Up to 86 conditions per place. [2022-12-06 07:45:22,869 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 49 transitions, 389 flow [2022-12-06 07:45:22,869 INFO L188 LiptonReduction]: Number of co-enabled transitions 354 [2022-12-06 07:45:22,870 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:22,870 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 07:45:22,870 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 49 transitions, 389 flow [2022-12-06 07:45:22,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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) [2022-12-06 07:45:22,870 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:22,870 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:22,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 07:45:22,871 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:22,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:22,871 INFO L85 PathProgramCache]: Analyzing trace with hash 828824796, now seen corresponding path program 1 times [2022-12-06 07:45:22,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:22,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387126596] [2022-12-06 07:45:22,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:22,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:23,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:23,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:23,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387126596] [2022-12-06 07:45:23,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387126596] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:23,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:23,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:45:23,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216799821] [2022-12-06 07:45:23,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:23,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:45:23,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:23,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:45:23,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:45:23,461 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 07:45:23,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 49 transitions, 389 flow. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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) [2022-12-06 07:45:23,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:23,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 07:45:23,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:23,721 INFO L130 PetriNetUnfolder]: 719/1126 cut-off events. [2022-12-06 07:45:23,721 INFO L131 PetriNetUnfolder]: For 4765/4858 co-relation queries the response was YES. [2022-12-06 07:45:23,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5513 conditions, 1126 events. 719/1126 cut-off events. For 4765/4858 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4628 event pairs, 230 based on Foata normal form. 59/1179 useless extension candidates. Maximal degree in co-relation 4984. Up to 975 conditions per place. [2022-12-06 07:45:23,729 INFO L137 encePairwiseOnDemand]: 24/34 looper letters, 40 selfloop transitions, 8 changer transitions 26/76 dead transitions. [2022-12-06 07:45:23,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 76 transitions, 653 flow [2022-12-06 07:45:23,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:45:23,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:45:23,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-12-06 07:45:23,730 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3431372549019608 [2022-12-06 07:45:23,730 INFO L175 Difference]: Start difference. First operand has 78 places, 49 transitions, 389 flow. Second operand 6 states and 70 transitions. [2022-12-06 07:45:23,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 76 transitions, 653 flow [2022-12-06 07:45:23,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 76 transitions, 618 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-06 07:45:23,741 INFO L231 Difference]: Finished difference. Result has 79 places, 43 transitions, 317 flow [2022-12-06 07:45:23,741 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=317, PETRI_PLACES=79, PETRI_TRANSITIONS=43} [2022-12-06 07:45:23,742 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 49 predicate places. [2022-12-06 07:45:23,742 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:23,742 INFO L89 Accepts]: Start accepts. Operand has 79 places, 43 transitions, 317 flow [2022-12-06 07:45:23,742 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:23,743 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:23,743 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 43 transitions, 317 flow [2022-12-06 07:45:23,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 43 transitions, 317 flow [2022-12-06 07:45:23,756 INFO L130 PetriNetUnfolder]: 61/165 cut-off events. [2022-12-06 07:45:23,756 INFO L131 PetriNetUnfolder]: For 393/432 co-relation queries the response was YES. [2022-12-06 07:45:23,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 165 events. 61/165 cut-off events. For 393/432 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 629 event pairs, 7 based on Foata normal form. 1/154 useless extension candidates. Maximal degree in co-relation 567. Up to 83 conditions per place. [2022-12-06 07:45:23,758 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 43 transitions, 317 flow [2022-12-06 07:45:23,758 INFO L188 LiptonReduction]: Number of co-enabled transitions 310 [2022-12-06 07:45:23,758 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:23,759 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 07:45:23,759 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 43 transitions, 317 flow [2022-12-06 07:45:23,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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) [2022-12-06 07:45:23,759 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:23,759 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:23,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 07:45:23,759 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:23,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:23,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1708469611, now seen corresponding path program 1 times [2022-12-06 07:45:23,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:23,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737913506] [2022-12-06 07:45:23,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:23,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:23,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:23,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:45:23,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:23,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737913506] [2022-12-06 07:45:23,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737913506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:23,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:23,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:45:23,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968727986] [2022-12-06 07:45:23,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:23,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:45:23,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:23,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:45:23,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:45:23,830 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 07:45:23,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 43 transitions, 317 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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) [2022-12-06 07:45:23,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:23,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 07:45:23,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:24,022 INFO L130 PetriNetUnfolder]: 880/1322 cut-off events. [2022-12-06 07:45:24,023 INFO L131 PetriNetUnfolder]: For 4552/4552 co-relation queries the response was YES. [2022-12-06 07:45:24,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6274 conditions, 1322 events. 880/1322 cut-off events. For 4552/4552 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5122 event pairs, 271 based on Foata normal form. 12/1334 useless extension candidates. Maximal degree in co-relation 6230. Up to 732 conditions per place. [2022-12-06 07:45:24,030 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 59 selfloop transitions, 16 changer transitions 0/75 dead transitions. [2022-12-06 07:45:24,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 75 transitions, 648 flow [2022-12-06 07:45:24,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:45:24,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:45:24,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-06 07:45:24,032 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3878787878787879 [2022-12-06 07:45:24,032 INFO L175 Difference]: Start difference. First operand has 68 places, 43 transitions, 317 flow. Second operand 5 states and 64 transitions. [2022-12-06 07:45:24,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 75 transitions, 648 flow [2022-12-06 07:45:24,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 75 transitions, 573 flow, removed 14 selfloop flow, removed 12 redundant places. [2022-12-06 07:45:24,046 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 362 flow [2022-12-06 07:45:24,046 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=362, PETRI_PLACES=62, PETRI_TRANSITIONS=47} [2022-12-06 07:45:24,046 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 32 predicate places. [2022-12-06 07:45:24,046 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:24,046 INFO L89 Accepts]: Start accepts. Operand has 62 places, 47 transitions, 362 flow [2022-12-06 07:45:24,047 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:24,047 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:24,047 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 47 transitions, 362 flow [2022-12-06 07:45:24,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 47 transitions, 362 flow [2022-12-06 07:45:24,062 INFO L130 PetriNetUnfolder]: 77/210 cut-off events. [2022-12-06 07:45:24,062 INFO L131 PetriNetUnfolder]: For 464/519 co-relation queries the response was YES. [2022-12-06 07:45:24,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 210 events. 77/210 cut-off events. For 464/519 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 904 event pairs, 9 based on Foata normal form. 1/197 useless extension candidates. Maximal degree in co-relation 655. Up to 105 conditions per place. [2022-12-06 07:45:24,064 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 47 transitions, 362 flow [2022-12-06 07:45:24,064 INFO L188 LiptonReduction]: Number of co-enabled transitions 358 [2022-12-06 07:45:24,065 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:24,066 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 07:45:24,066 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 362 flow [2022-12-06 07:45:24,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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) [2022-12-06 07:45:24,066 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:24,066 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:24,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 07:45:24,066 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:24,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:24,067 INFO L85 PathProgramCache]: Analyzing trace with hash 807789503, now seen corresponding path program 1 times [2022-12-06 07:45:24,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:24,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631294762] [2022-12-06 07:45:24,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:24,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:24,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:45:24,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:24,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631294762] [2022-12-06 07:45:24,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631294762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:24,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:24,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:45:24,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299113122] [2022-12-06 07:45:24,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:24,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:45:24,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:24,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:45:24,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:45:24,141 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 07:45:24,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 47 transitions, 362 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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) [2022-12-06 07:45:24,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:24,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 07:45:24,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:24,334 INFO L130 PetriNetUnfolder]: 866/1294 cut-off events. [2022-12-06 07:45:24,334 INFO L131 PetriNetUnfolder]: For 4088/4088 co-relation queries the response was YES. [2022-12-06 07:45:24,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6162 conditions, 1294 events. 866/1294 cut-off events. For 4088/4088 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4883 event pairs, 427 based on Foata normal form. 10/1303 useless extension candidates. Maximal degree in co-relation 3806. Up to 1184 conditions per place. [2022-12-06 07:45:24,340 INFO L137 encePairwiseOnDemand]: 27/33 looper letters, 62 selfloop transitions, 5 changer transitions 0/67 dead transitions. [2022-12-06 07:45:24,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 67 transitions, 575 flow [2022-12-06 07:45:24,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:45:24,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:45:24,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-12-06 07:45:24,342 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3393939393939394 [2022-12-06 07:45:24,342 INFO L175 Difference]: Start difference. First operand has 62 places, 47 transitions, 362 flow. Second operand 5 states and 56 transitions. [2022-12-06 07:45:24,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 67 transitions, 575 flow [2022-12-06 07:45:24,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 67 transitions, 570 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 07:45:24,349 INFO L231 Difference]: Finished difference. Result has 64 places, 46 transitions, 362 flow [2022-12-06 07:45:24,349 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=362, PETRI_PLACES=64, PETRI_TRANSITIONS=46} [2022-12-06 07:45:24,350 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 34 predicate places. [2022-12-06 07:45:24,350 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:24,350 INFO L89 Accepts]: Start accepts. Operand has 64 places, 46 transitions, 362 flow [2022-12-06 07:45:24,350 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:24,350 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:24,351 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 46 transitions, 362 flow [2022-12-06 07:45:24,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 46 transitions, 362 flow [2022-12-06 07:45:24,365 INFO L130 PetriNetUnfolder]: 77/204 cut-off events. [2022-12-06 07:45:24,365 INFO L131 PetriNetUnfolder]: For 469/528 co-relation queries the response was YES. [2022-12-06 07:45:24,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 204 events. 77/204 cut-off events. For 469/528 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 832 event pairs, 9 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 650. Up to 105 conditions per place. [2022-12-06 07:45:24,367 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 46 transitions, 362 flow [2022-12-06 07:45:24,368 INFO L188 LiptonReduction]: Number of co-enabled transitions 344 [2022-12-06 07:45:24,368 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:24,369 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 07:45:24,369 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 362 flow [2022-12-06 07:45:24,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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) [2022-12-06 07:45:24,369 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:24,370 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:24,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-06 07:45:24,370 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:24,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:24,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1572366623, now seen corresponding path program 1 times [2022-12-06 07:45:24,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:24,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646064894] [2022-12-06 07:45:24,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:24,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:24,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:45:24,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:24,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646064894] [2022-12-06 07:45:24,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646064894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:24,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:24,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:45:24,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503387372] [2022-12-06 07:45:24,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:24,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:45:24,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:24,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:45:24,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:45:24,449 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 07:45:24,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 46 transitions, 362 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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) [2022-12-06 07:45:24,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:24,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 07:45:24,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:24,644 INFO L130 PetriNetUnfolder]: 954/1428 cut-off events. [2022-12-06 07:45:24,644 INFO L131 PetriNetUnfolder]: For 4528/4528 co-relation queries the response was YES. [2022-12-06 07:45:24,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6753 conditions, 1428 events. 954/1428 cut-off events. For 4528/4528 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5573 event pairs, 469 based on Foata normal form. 12/1439 useless extension candidates. Maximal degree in co-relation 6250. Up to 1326 conditions per place. [2022-12-06 07:45:24,652 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 62 selfloop transitions, 7 changer transitions 0/69 dead transitions. [2022-12-06 07:45:24,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 69 transitions, 613 flow [2022-12-06 07:45:24,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:45:24,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:45:24,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-06 07:45:24,654 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-06 07:45:24,654 INFO L175 Difference]: Start difference. First operand has 64 places, 46 transitions, 362 flow. Second operand 5 states and 55 transitions. [2022-12-06 07:45:24,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 69 transitions, 613 flow [2022-12-06 07:45:24,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 69 transitions, 603 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 07:45:24,661 INFO L231 Difference]: Finished difference. Result has 66 places, 50 transitions, 413 flow [2022-12-06 07:45:24,661 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=413, PETRI_PLACES=66, PETRI_TRANSITIONS=50} [2022-12-06 07:45:24,662 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 36 predicate places. [2022-12-06 07:45:24,662 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:24,662 INFO L89 Accepts]: Start accepts. Operand has 66 places, 50 transitions, 413 flow [2022-12-06 07:45:24,662 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:24,663 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:24,663 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 50 transitions, 413 flow [2022-12-06 07:45:24,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 50 transitions, 413 flow [2022-12-06 07:45:24,679 INFO L130 PetriNetUnfolder]: 92/243 cut-off events. [2022-12-06 07:45:24,680 INFO L131 PetriNetUnfolder]: For 661/724 co-relation queries the response was YES. [2022-12-06 07:45:24,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 243 events. 92/243 cut-off events. For 661/724 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1081 event pairs, 10 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 867. Up to 122 conditions per place. [2022-12-06 07:45:24,682 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 50 transitions, 413 flow [2022-12-06 07:45:24,682 INFO L188 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-06 07:45:24,683 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:24,683 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 07:45:24,683 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 50 transitions, 413 flow [2022-12-06 07:45:24,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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) [2022-12-06 07:45:24,684 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:24,684 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:24,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-06 07:45:24,684 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:24,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:24,685 INFO L85 PathProgramCache]: Analyzing trace with hash 471555651, now seen corresponding path program 2 times [2022-12-06 07:45:24,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:24,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324197366] [2022-12-06 07:45:24,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:24,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:24,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:45:24,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:24,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324197366] [2022-12-06 07:45:24,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324197366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:24,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:24,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:45:24,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822342657] [2022-12-06 07:45:24,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:24,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:45:24,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:24,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:45:24,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:45:24,766 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 07:45:24,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 50 transitions, 413 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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) [2022-12-06 07:45:24,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:24,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 07:45:24,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:24,965 INFO L130 PetriNetUnfolder]: 940/1400 cut-off events. [2022-12-06 07:45:24,965 INFO L131 PetriNetUnfolder]: For 5434/5434 co-relation queries the response was YES. [2022-12-06 07:45:24,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7127 conditions, 1400 events. 940/1400 cut-off events. For 5434/5434 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5387 event pairs, 469 based on Foata normal form. 10/1409 useless extension candidates. Maximal degree in co-relation 5454. Up to 1326 conditions per place. [2022-12-06 07:45:24,974 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 60 selfloop transitions, 8 changer transitions 0/68 dead transitions. [2022-12-06 07:45:24,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 636 flow [2022-12-06 07:45:24,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:45:24,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:45:24,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-12-06 07:45:24,975 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3212121212121212 [2022-12-06 07:45:24,975 INFO L175 Difference]: Start difference. First operand has 66 places, 50 transitions, 413 flow. Second operand 5 states and 53 transitions. [2022-12-06 07:45:24,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 636 flow [2022-12-06 07:45:24,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 68 transitions, 621 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-06 07:45:24,984 INFO L231 Difference]: Finished difference. Result has 71 places, 52 transitions, 450 flow [2022-12-06 07:45:24,984 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=450, PETRI_PLACES=71, PETRI_TRANSITIONS=52} [2022-12-06 07:45:24,985 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 41 predicate places. [2022-12-06 07:45:24,985 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:24,985 INFO L89 Accepts]: Start accepts. Operand has 71 places, 52 transitions, 450 flow [2022-12-06 07:45:24,986 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:24,986 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:24,987 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 52 transitions, 450 flow [2022-12-06 07:45:24,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 52 transitions, 450 flow [2022-12-06 07:45:25,004 INFO L130 PetriNetUnfolder]: 91/235 cut-off events. [2022-12-06 07:45:25,004 INFO L131 PetriNetUnfolder]: For 835/908 co-relation queries the response was YES. [2022-12-06 07:45:25,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 235 events. 91/235 cut-off events. For 835/908 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1038 event pairs, 9 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 869. Up to 121 conditions per place. [2022-12-06 07:45:25,007 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 52 transitions, 450 flow [2022-12-06 07:45:25,007 INFO L188 LiptonReduction]: Number of co-enabled transitions 408 [2022-12-06 07:45:25,010 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [487] L56-5-->L56-5: Formula: (and (= (+ v_~sum2~0_38 (select (select |v_#memory_int_103| v_~A~0.base_50) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_40) v_~A~0.offset_50))) v_~sum2~0_37) (= (+ v_thread2Thread1of1ForFork2_~i~1_40 1) v_thread2Thread1of1ForFork2_~i~1_39) (< v_thread2Thread1of1ForFork2_~i~1_40 v_~M~0_37)) InVars {~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_40, ~A~0.offset=v_~A~0.offset_50, ~M~0=v_~M~0_37, #memory_int=|v_#memory_int_103|, ~sum2~0=v_~sum2~0_38} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_15|, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_39, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_23|, ~A~0.offset=v_~A~0.offset_50, ~M~0=v_~M~0_37, #memory_int=|v_#memory_int_103|, ~sum2~0=v_~sum2~0_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0] [2022-12-06 07:45:25,070 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:45:25,072 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 07:45:25,073 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 52 transitions, 467 flow [2022-12-06 07:45:25,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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) [2022-12-06 07:45:25,073 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:25,073 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:25,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-06 07:45:25,073 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:25,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:25,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1461012245, now seen corresponding path program 2 times [2022-12-06 07:45:25,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:25,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202748508] [2022-12-06 07:45:25,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:25,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:25,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:25,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:45:25,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:25,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202748508] [2022-12-06 07:45:25,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202748508] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:25,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:25,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:45:25,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120768695] [2022-12-06 07:45:25,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:25,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:45:25,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:25,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:45:25,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:45:25,148 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 07:45:25,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 52 transitions, 467 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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) [2022-12-06 07:45:25,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:25,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 07:45:25,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:25,370 INFO L130 PetriNetUnfolder]: 926/1372 cut-off events. [2022-12-06 07:45:25,370 INFO L131 PetriNetUnfolder]: For 5084/5084 co-relation queries the response was YES. [2022-12-06 07:45:25,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7280 conditions, 1372 events. 926/1372 cut-off events. For 5084/5084 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5352 event pairs, 83 based on Foata normal form. 10/1381 useless extension candidates. Maximal degree in co-relation 6178. Up to 752 conditions per place. [2022-12-06 07:45:25,379 INFO L137 encePairwiseOnDemand]: 21/34 looper letters, 77 selfloop transitions, 17 changer transitions 1/95 dead transitions. [2022-12-06 07:45:25,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 95 transitions, 879 flow [2022-12-06 07:45:25,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:45:25,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:45:25,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-12-06 07:45:25,380 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39215686274509803 [2022-12-06 07:45:25,381 INFO L175 Difference]: Start difference. First operand has 71 places, 52 transitions, 467 flow. Second operand 6 states and 80 transitions. [2022-12-06 07:45:25,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 95 transitions, 879 flow [2022-12-06 07:45:25,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 95 transitions, 849 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-06 07:45:25,391 INFO L231 Difference]: Finished difference. Result has 76 places, 54 transitions, 513 flow [2022-12-06 07:45:25,392 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=513, PETRI_PLACES=76, PETRI_TRANSITIONS=54} [2022-12-06 07:45:25,392 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 46 predicate places. [2022-12-06 07:45:25,393 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:25,393 INFO L89 Accepts]: Start accepts. Operand has 76 places, 54 transitions, 513 flow [2022-12-06 07:45:25,393 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:25,393 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:25,394 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 54 transitions, 513 flow [2022-12-06 07:45:25,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 54 transitions, 513 flow [2022-12-06 07:45:25,410 INFO L130 PetriNetUnfolder]: 97/238 cut-off events. [2022-12-06 07:45:25,411 INFO L131 PetriNetUnfolder]: For 1117/1189 co-relation queries the response was YES. [2022-12-06 07:45:25,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1041 conditions, 238 events. 97/238 cut-off events. For 1117/1189 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1031 event pairs, 10 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 951. Up to 128 conditions per place. [2022-12-06 07:45:25,413 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 54 transitions, 513 flow [2022-12-06 07:45:25,413 INFO L188 LiptonReduction]: Number of co-enabled transitions 424 [2022-12-06 07:45:25,414 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:25,415 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 07:45:25,415 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 54 transitions, 513 flow [2022-12-06 07:45:25,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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) [2022-12-06 07:45:25,415 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:25,415 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:25,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-06 07:45:25,415 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:25,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:25,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1616721691, now seen corresponding path program 1 times [2022-12-06 07:45:25,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:25,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792980479] [2022-12-06 07:45:25,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:25,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:26,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:26,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:26,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792980479] [2022-12-06 07:45:26,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792980479] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:45:26,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142830350] [2022-12-06 07:45:26,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:26,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:45:26,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:45:26,097 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) [2022-12-06 07:45:26,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 07:45:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:26,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-06 07:45:26,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:45:26,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:45:26,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-12-06 07:45:26,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:45:26,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-12-06 07:45:26,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:45:26,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2022-12-06 07:45:26,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:45:26,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2022-12-06 07:45:26,851 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:45:26,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 27 [2022-12-06 07:45:26,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:26,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:45:27,269 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_786))) (let ((.cse2 (+ |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4)) (.cse1 (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787))) (= (mod (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) c_~sum1~0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) .cse2)) 4294967296) (mod (let ((.cse3 (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (+ (select .cse3 |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) c_~sum3~0 c_~sum2~0 (select .cse3 .cse2))) 4294967296))))) is different from false [2022-12-06 07:45:27,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:27,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142830350] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:45:27,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:45:27,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 23 [2022-12-06 07:45:27,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462135698] [2022-12-06 07:45:27,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:45:27,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 07:45:27,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:27,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 07:45:27,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=449, Unknown=22, NotChecked=44, Total=600 [2022-12-06 07:45:27,273 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 07:45:27,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 54 transitions, 513 flow. Second operand has 25 states, 25 states have (on average 3.4) internal successors, (85), 25 states have internal predecessors, (85), 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) [2022-12-06 07:45:27,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:27,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 07:45:27,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:27,816 WARN L837 $PredicateComparison]: unable to prove that (and (<= c_~sum1~0 4294967294) (= c_~sum3~0 0) (= c_~sum1~0 c_~sum2~0) (<= 0 (+ c_~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787)) (.cse1 (+ c_~A~0.offset 4))) (= (mod (let ((.cse0 (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) c_~A~0.base))) (+ (select .cse0 .cse1) (select .cse0 c_~A~0.offset) c_~sum3~0 c_~sum2~0)) 4294967296) (mod (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~sum1~0 (select (select .cse2 c_~A~0.base) .cse1)) 4294967296))))) is different from false [2022-12-06 07:45:28,633 INFO L130 PetriNetUnfolder]: 1307/1944 cut-off events. [2022-12-06 07:45:28,633 INFO L131 PetriNetUnfolder]: For 10297/10547 co-relation queries the response was YES. [2022-12-06 07:45:28,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10627 conditions, 1944 events. 1307/1944 cut-off events. For 10297/10547 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8450 event pairs, 126 based on Foata normal form. 155/2077 useless extension candidates. Maximal degree in co-relation 9705. Up to 1450 conditions per place. [2022-12-06 07:45:28,647 INFO L137 encePairwiseOnDemand]: 11/34 looper letters, 100 selfloop transitions, 58 changer transitions 7/167 dead transitions. [2022-12-06 07:45:28,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 167 transitions, 1707 flow [2022-12-06 07:45:28,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 07:45:28,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 07:45:28,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2022-12-06 07:45:28,648 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34558823529411764 [2022-12-06 07:45:28,649 INFO L175 Difference]: Start difference. First operand has 75 places, 54 transitions, 513 flow. Second operand 12 states and 141 transitions. [2022-12-06 07:45:28,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 167 transitions, 1707 flow [2022-12-06 07:45:28,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 167 transitions, 1639 flow, removed 22 selfloop flow, removed 4 redundant places. [2022-12-06 07:45:28,668 INFO L231 Difference]: Finished difference. Result has 87 places, 104 transitions, 1161 flow [2022-12-06 07:45:28,668 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1161, PETRI_PLACES=87, PETRI_TRANSITIONS=104} [2022-12-06 07:45:28,668 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 57 predicate places. [2022-12-06 07:45:28,668 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:28,668 INFO L89 Accepts]: Start accepts. Operand has 87 places, 104 transitions, 1161 flow [2022-12-06 07:45:28,669 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:28,669 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:28,669 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 104 transitions, 1161 flow [2022-12-06 07:45:28,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 104 transitions, 1161 flow [2022-12-06 07:45:28,737 INFO L130 PetriNetUnfolder]: 301/665 cut-off events. [2022-12-06 07:45:28,737 INFO L131 PetriNetUnfolder]: For 3722/3931 co-relation queries the response was YES. [2022-12-06 07:45:28,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3247 conditions, 665 events. 301/665 cut-off events. For 3722/3931 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3799 event pairs, 79 based on Foata normal form. 2/613 useless extension candidates. Maximal degree in co-relation 3106. Up to 275 conditions per place. [2022-12-06 07:45:28,745 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 104 transitions, 1161 flow [2022-12-06 07:45:28,746 INFO L188 LiptonReduction]: Number of co-enabled transitions 664 [2022-12-06 07:45:31,755 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_13| 0) (= |v_thread2Thread1of1ForFork2_#res.base_13| 0) (= v_thread2Thread1of1ForFork2_~i~1_47 0) (not (< v_thread2Thread1of1ForFork2_~i~1_47 v_~M~0_69))) InVars {~M~0=v_~M~0_69} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_47, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_13|, ~M~0=v_~M~0_69, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [503] L48-5-->L48-5: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_36 v_~N~0_63) (= v_thread1Thread1of1ForFork1_~i~0_35 (+ v_thread1Thread1of1ForFork1_~i~0_36 1)) (= v_~sum1~0_53 (+ v_~sum1~0_54 (select (select |v_#memory_int_127| v_~A~0.base_64) (+ (* v_thread1Thread1of1ForFork1_~i~0_36 4) v_~A~0.offset_64))))) InVars {~A~0.base=v_~A~0.base_64, ~A~0.offset=v_~A~0.offset_64, ~sum1~0=v_~sum1~0_54, #memory_int=|v_#memory_int_127|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_36, ~N~0=v_~N~0_63} OutVars{~A~0.base=v_~A~0.base_64, ~A~0.offset=v_~A~0.offset_64, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_27|, ~sum1~0=v_~sum1~0_53, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, #memory_int=|v_#memory_int_127|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, ~N~0=v_~N~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] [2022-12-06 07:45:31,793 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_13| 0) (= |v_thread2Thread1of1ForFork2_#res.base_13| 0) (= v_thread2Thread1of1ForFork2_~i~1_47 0) (not (< v_thread2Thread1of1ForFork2_~i~1_47 v_~M~0_69))) InVars {~M~0=v_~M~0_69} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_47, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_13|, ~M~0=v_~M~0_69, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [505] L64-5-->L64-5: Formula: (and (= (+ v_thread3Thread1of1ForFork0_~i~2_38 1) v_thread3Thread1of1ForFork0_~i~2_37) (= (+ v_~sum3~0_36 (select (select |v_#memory_int_131| v_~A~0.base_68) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_38) v_~A~0.offset_68))) v_~sum3~0_35) (< v_thread3Thread1of1ForFork0_~i~2_38 v_~N~0_69)) InVars {~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_38, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_36, ~N~0=v_~N~0_69} OutVars{~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_37, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_35, ~N~0=v_~N~0_69, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_21|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5] [2022-12-06 07:45:31,833 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:45:31,834 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3166 [2022-12-06 07:45:31,834 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 104 transitions, 1201 flow [2022-12-06 07:45:31,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.4) internal successors, (85), 25 states have internal predecessors, (85), 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) [2022-12-06 07:45:31,834 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:31,835 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:31,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 07:45:32,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-12-06 07:45:32,040 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:32,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:32,040 INFO L85 PathProgramCache]: Analyzing trace with hash 2033705419, now seen corresponding path program 1 times [2022-12-06 07:45:32,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:32,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766176499] [2022-12-06 07:45:32,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:32,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:32,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:32,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:32,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766176499] [2022-12-06 07:45:32,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766176499] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:45:32,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637456269] [2022-12-06 07:45:32,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:32,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:45:32,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:45:32,774 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) [2022-12-06 07:45:32,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 07:45:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:32,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-06 07:45:32,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:45:33,059 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:45:33,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 16 [2022-12-06 07:45:33,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:33,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:45:33,206 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:45:33,206 INFO L350 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 34 treesize of output 14 [2022-12-06 07:45:33,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:33,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637456269] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:45:33,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:45:33,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 4] total 14 [2022-12-06 07:45:33,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467498429] [2022-12-06 07:45:33,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:45:33,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 07:45:33,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:33,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 07:45:33,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-12-06 07:45:33,261 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2022-12-06 07:45:33,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 104 transitions, 1201 flow. Second operand has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:33,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:33,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2022-12-06 07:45:33,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:34,010 INFO L130 PetriNetUnfolder]: 2073/3094 cut-off events. [2022-12-06 07:45:34,010 INFO L131 PetriNetUnfolder]: For 19080/19666 co-relation queries the response was YES. [2022-12-06 07:45:34,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18875 conditions, 3094 events. 2073/3094 cut-off events. For 19080/19666 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 14762 event pairs, 351 based on Foata normal form. 398/3470 useless extension candidates. Maximal degree in co-relation 17348. Up to 2218 conditions per place. [2022-12-06 07:45:34,025 INFO L137 encePairwiseOnDemand]: 16/38 looper letters, 183 selfloop transitions, 107 changer transitions 9/301 dead transitions. [2022-12-06 07:45:34,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 301 transitions, 3615 flow [2022-12-06 07:45:34,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 07:45:34,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 07:45:34,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 198 transitions. [2022-12-06 07:45:34,026 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37218045112781956 [2022-12-06 07:45:34,027 INFO L175 Difference]: Start difference. First operand has 87 places, 104 transitions, 1201 flow. Second operand 14 states and 198 transitions. [2022-12-06 07:45:34,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 301 transitions, 3615 flow [2022-12-06 07:45:34,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 301 transitions, 3419 flow, removed 91 selfloop flow, removed 1 redundant places. [2022-12-06 07:45:34,070 INFO L231 Difference]: Finished difference. Result has 103 places, 196 transitions, 2396 flow [2022-12-06 07:45:34,070 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1103, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2396, PETRI_PLACES=103, PETRI_TRANSITIONS=196} [2022-12-06 07:45:34,071 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 73 predicate places. [2022-12-06 07:45:34,071 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:34,071 INFO L89 Accepts]: Start accepts. Operand has 103 places, 196 transitions, 2396 flow [2022-12-06 07:45:34,072 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:34,072 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:34,072 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 196 transitions, 2396 flow [2022-12-06 07:45:34,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 196 transitions, 2396 flow [2022-12-06 07:45:34,143 INFO L130 PetriNetUnfolder]: 542/1178 cut-off events. [2022-12-06 07:45:34,143 INFO L131 PetriNetUnfolder]: For 5537/5735 co-relation queries the response was YES. [2022-12-06 07:45:34,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5982 conditions, 1178 events. 542/1178 cut-off events. For 5537/5735 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 7614 event pairs, 141 based on Foata normal form. 9/1118 useless extension candidates. Maximal degree in co-relation 5953. Up to 510 conditions per place. [2022-12-06 07:45:34,153 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 196 transitions, 2396 flow [2022-12-06 07:45:34,153 INFO L188 LiptonReduction]: Number of co-enabled transitions 1072 [2022-12-06 07:45:34,170 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [531] $Ultimate##0-->L48-5: Formula: (and (= v_~sum1~0_73 (+ (select (select |v_#memory_int_169| v_~A~0.base_98) (+ (* v_thread1Thread1of1ForFork1_~i~0_39 4) (- 4) v_~A~0.offset_98)) v_~sum1~0_74)) (< v_thread1Thread1of1ForFork1_~i~0_39 (+ 1 v_~N~0_91)) (= v_thread1Thread1of1ForFork1_~i~0_39 1)) InVars {~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, ~sum1~0=v_~sum1~0_74, #memory_int=|v_#memory_int_169|, ~N~0=v_~N~0_91} OutVars{~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_29|, ~sum1~0=v_~sum1~0_73, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_21|, #memory_int=|v_#memory_int_169|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_39, ~N~0=v_~N~0_91} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [555] $Ultimate##0-->L64-5: Formula: (and (= (+ v_thread3Thread1of1ForFork0_~i~2_116 1) v_thread3Thread1of1ForFork0_~i~2_115) (= v_~sum3~0_119 (+ v_~sum3~0_120 (select (select |v_#memory_int_240| v_~A~0.base_151) (+ v_~A~0.offset_151 (* v_thread3Thread1of1ForFork0_~i~2_116 4))))) (= v_thread2Thread1of1ForFork2_~i~1_80 0) (< v_thread3Thread1of1ForFork0_~i~2_116 v_~N~0_139) (= |v_thread2Thread1of1ForFork2_#res.base_27| 0) (= |v_thread2Thread1of1ForFork2_#res.offset_27| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_80 v_~M~0_113))) InVars {~A~0.base=v_~A~0.base_151, ~A~0.offset=v_~A~0.offset_151, ~M~0=v_~M~0_113, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_116, #memory_int=|v_#memory_int_240|, ~sum3~0=v_~sum3~0_120, ~N~0=v_~N~0_139} OutVars{~A~0.base=v_~A~0.base_151, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_80, ~A~0.offset=v_~A~0.offset_151, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_27|, ~M~0=v_~M~0_113, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_115, #memory_int=|v_#memory_int_240|, ~sum3~0=v_~sum3~0_119, ~N~0=v_~N~0_139, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_60|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_58|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5, thread2Thread1of1ForFork2_#res.offset] [2022-12-06 07:45:34,242 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [531] $Ultimate##0-->L48-5: Formula: (and (= v_~sum1~0_73 (+ (select (select |v_#memory_int_169| v_~A~0.base_98) (+ (* v_thread1Thread1of1ForFork1_~i~0_39 4) (- 4) v_~A~0.offset_98)) v_~sum1~0_74)) (< v_thread1Thread1of1ForFork1_~i~0_39 (+ 1 v_~N~0_91)) (= v_thread1Thread1of1ForFork1_~i~0_39 1)) InVars {~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, ~sum1~0=v_~sum1~0_74, #memory_int=|v_#memory_int_169|, ~N~0=v_~N~0_91} OutVars{~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_29|, ~sum1~0=v_~sum1~0_73, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_21|, #memory_int=|v_#memory_int_169|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_39, ~N~0=v_~N~0_91} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [505] L64-5-->L64-5: Formula: (and (= (+ v_thread3Thread1of1ForFork0_~i~2_38 1) v_thread3Thread1of1ForFork0_~i~2_37) (= (+ v_~sum3~0_36 (select (select |v_#memory_int_131| v_~A~0.base_68) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_38) v_~A~0.offset_68))) v_~sum3~0_35) (< v_thread3Thread1of1ForFork0_~i~2_38 v_~N~0_69)) InVars {~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_38, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_36, ~N~0=v_~N~0_69} OutVars{~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_37, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_35, ~N~0=v_~N~0_69, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_21|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5] [2022-12-06 07:45:34,281 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [531] $Ultimate##0-->L48-5: Formula: (and (= v_~sum1~0_73 (+ (select (select |v_#memory_int_169| v_~A~0.base_98) (+ (* v_thread1Thread1of1ForFork1_~i~0_39 4) (- 4) v_~A~0.offset_98)) v_~sum1~0_74)) (< v_thread1Thread1of1ForFork1_~i~0_39 (+ 1 v_~N~0_91)) (= v_thread1Thread1of1ForFork1_~i~0_39 1)) InVars {~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, ~sum1~0=v_~sum1~0_74, #memory_int=|v_#memory_int_169|, ~N~0=v_~N~0_91} OutVars{~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_29|, ~sum1~0=v_~sum1~0_73, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_21|, #memory_int=|v_#memory_int_169|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_39, ~N~0=v_~N~0_91} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [510] L83-4-->L84-3: Formula: (and (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= |v_ULTIMATE.start_main_#t~pre14#1_43| |v_#pthreadsForks_59|) (= (store |v_#memory_int_140| |v_ULTIMATE.start_main_~#t3~0#1.base_41| (store (select |v_#memory_int_140| |v_ULTIMATE.start_main_~#t3~0#1.base_41|) |v_ULTIMATE.start_main_~#t3~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre14#1_43|)) |v_#memory_int_139|)) InVars {#pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_41|, #memory_int=|v_#memory_int_140|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_41|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_31|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_43|, #pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_41|, #memory_int=|v_#memory_int_139|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 07:45:34,314 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [531] $Ultimate##0-->L48-5: Formula: (and (= v_~sum1~0_73 (+ (select (select |v_#memory_int_169| v_~A~0.base_98) (+ (* v_thread1Thread1of1ForFork1_~i~0_39 4) (- 4) v_~A~0.offset_98)) v_~sum1~0_74)) (< v_thread1Thread1of1ForFork1_~i~0_39 (+ 1 v_~N~0_91)) (= v_thread1Thread1of1ForFork1_~i~0_39 1)) InVars {~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, ~sum1~0=v_~sum1~0_74, #memory_int=|v_#memory_int_169|, ~N~0=v_~N~0_91} OutVars{~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_29|, ~sum1~0=v_~sum1~0_73, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_21|, #memory_int=|v_#memory_int_169|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_39, ~N~0=v_~N~0_91} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [482] L82-3-->L83-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_41|) (= (store |v_#memory_int_84| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_84| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre12#1_17|)) |v_#memory_int_83|) (= (+ |v_#pthreadsForks_41| 1) |v_#pthreadsForks_40|)) InVars {#pthreadsForks=|v_#pthreadsForks_41|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_84|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_9|, #pthreadsForks=|v_#pthreadsForks_40|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_23|, #memory_int=|v_#memory_int_83|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] [2022-12-06 07:45:34,378 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [531] $Ultimate##0-->L48-5: Formula: (and (= v_~sum1~0_73 (+ (select (select |v_#memory_int_169| v_~A~0.base_98) (+ (* v_thread1Thread1of1ForFork1_~i~0_39 4) (- 4) v_~A~0.offset_98)) v_~sum1~0_74)) (< v_thread1Thread1of1ForFork1_~i~0_39 (+ 1 v_~N~0_91)) (= v_thread1Thread1of1ForFork1_~i~0_39 1)) InVars {~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, ~sum1~0=v_~sum1~0_74, #memory_int=|v_#memory_int_169|, ~N~0=v_~N~0_91} OutVars{~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_29|, ~sum1~0=v_~sum1~0_73, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_21|, #memory_int=|v_#memory_int_169|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_39, ~N~0=v_~N~0_91} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [523] $Ultimate##0-->L56-5: Formula: (and (= (+ v_~sum2~0_64 (select (select |v_#memory_int_157| v_~A~0.base_86) v_~A~0.offset_86)) v_~sum2~0_63) (= v_thread2Thread1of1ForFork2_~i~1_43 1) (< 0 v_~M~0_67)) InVars {~A~0.base=v_~A~0.base_86, ~A~0.offset=v_~A~0.offset_86, ~M~0=v_~M~0_67, #memory_int=|v_#memory_int_157|, ~sum2~0=v_~sum2~0_64} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_86, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_43, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_25|, ~A~0.offset=v_~A~0.offset_86, ~M~0=v_~M~0_67, #memory_int=|v_#memory_int_157|, ~sum2~0=v_~sum2~0_63} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0] [2022-12-06 07:45:34,406 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [531] $Ultimate##0-->L48-5: Formula: (and (= v_~sum1~0_73 (+ (select (select |v_#memory_int_169| v_~A~0.base_98) (+ (* v_thread1Thread1of1ForFork1_~i~0_39 4) (- 4) v_~A~0.offset_98)) v_~sum1~0_74)) (< v_thread1Thread1of1ForFork1_~i~0_39 (+ 1 v_~N~0_91)) (= v_thread1Thread1of1ForFork1_~i~0_39 1)) InVars {~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, ~sum1~0=v_~sum1~0_74, #memory_int=|v_#memory_int_169|, ~N~0=v_~N~0_91} OutVars{~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_29|, ~sum1~0=v_~sum1~0_73, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_21|, #memory_int=|v_#memory_int_169|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_39, ~N~0=v_~N~0_91} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [526] $Ultimate##0-->L56-5: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_53 1) (= v_thread3Thread1of1ForFork0_~i~2_41 v_~M~0_73) (= (+ v_~sum2~0_72 (select (select |v_#memory_int_161| v_~A~0.base_90) v_~A~0.offset_90)) v_~sum2~0_71) (< 0 v_~M~0_73)) InVars {~A~0.base=v_~A~0.base_90, ~A~0.offset=v_~A~0.offset_90, ~M~0=v_~M~0_73, #memory_int=|v_#memory_int_161|, ~sum2~0=v_~sum2~0_72} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_21|, ~A~0.base=v_~A~0.base_90, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_53, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_29|, ~A~0.offset=v_~A~0.offset_90, ~M~0=v_~M~0_73, #memory_int=|v_#memory_int_161|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_41, ~sum2~0=v_~sum2~0_71} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, thread3Thread1of1ForFork0_~i~2, ~sum2~0] [2022-12-06 07:45:34,444 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [531] $Ultimate##0-->L48-5: Formula: (and (= v_~sum1~0_73 (+ (select (select |v_#memory_int_169| v_~A~0.base_98) (+ (* v_thread1Thread1of1ForFork1_~i~0_39 4) (- 4) v_~A~0.offset_98)) v_~sum1~0_74)) (< v_thread1Thread1of1ForFork1_~i~0_39 (+ 1 v_~N~0_91)) (= v_thread1Thread1of1ForFork1_~i~0_39 1)) InVars {~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, ~sum1~0=v_~sum1~0_74, #memory_int=|v_#memory_int_169|, ~N~0=v_~N~0_91} OutVars{~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_29|, ~sum1~0=v_~sum1~0_73, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_21|, #memory_int=|v_#memory_int_169|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_39, ~N~0=v_~N~0_91} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [523] $Ultimate##0-->L56-5: Formula: (and (= (+ v_~sum2~0_64 (select (select |v_#memory_int_157| v_~A~0.base_86) v_~A~0.offset_86)) v_~sum2~0_63) (= v_thread2Thread1of1ForFork2_~i~1_43 1) (< 0 v_~M~0_67)) InVars {~A~0.base=v_~A~0.base_86, ~A~0.offset=v_~A~0.offset_86, ~M~0=v_~M~0_67, #memory_int=|v_#memory_int_157|, ~sum2~0=v_~sum2~0_64} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_86, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_43, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_25|, ~A~0.offset=v_~A~0.offset_86, ~M~0=v_~M~0_67, #memory_int=|v_#memory_int_157|, ~sum2~0=v_~sum2~0_63} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0] [2022-12-06 07:45:34,473 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [531] $Ultimate##0-->L48-5: Formula: (and (= v_~sum1~0_73 (+ (select (select |v_#memory_int_169| v_~A~0.base_98) (+ (* v_thread1Thread1of1ForFork1_~i~0_39 4) (- 4) v_~A~0.offset_98)) v_~sum1~0_74)) (< v_thread1Thread1of1ForFork1_~i~0_39 (+ 1 v_~N~0_91)) (= v_thread1Thread1of1ForFork1_~i~0_39 1)) InVars {~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, ~sum1~0=v_~sum1~0_74, #memory_int=|v_#memory_int_169|, ~N~0=v_~N~0_91} OutVars{~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_29|, ~sum1~0=v_~sum1~0_73, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_21|, #memory_int=|v_#memory_int_169|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_39, ~N~0=v_~N~0_91} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [554] $Ultimate##0-->L48-5: Formula: (and (= v_~sum1~0_125 (+ v_~sum1~0_126 (select (select |v_#memory_int_238| v_~A~0.base_149) (+ v_~A~0.offset_149 (* v_thread1Thread1of1ForFork1_~i~0_71 4))))) (= v_thread2Thread1of1ForFork2_~i~1_78 0) (= |v_thread2Thread1of1ForFork2_#res.offset_25| 0) (= v_thread1Thread1of1ForFork1_~i~0_70 (+ v_thread1Thread1of1ForFork1_~i~0_71 1)) (not (< v_thread2Thread1of1ForFork2_~i~1_78 v_~M~0_111)) (< v_thread1Thread1of1ForFork1_~i~0_71 v_~N~0_137) (= |v_thread2Thread1of1ForFork2_#res.base_25| 0)) InVars {~A~0.base=v_~A~0.base_149, ~A~0.offset=v_~A~0.offset_149, ~sum1~0=v_~sum1~0_126, ~M~0=v_~M~0_111, #memory_int=|v_#memory_int_238|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71, ~N~0=v_~N~0_137} OutVars{~A~0.base=v_~A~0.base_149, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_78, ~A~0.offset=v_~A~0.offset_149, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_54|, ~sum1~0=v_~sum1~0_125, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_25|, ~M~0=v_~M~0_111, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_46|, #memory_int=|v_#memory_int_238|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_70, ~N~0=v_~N~0_137, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_25|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread2Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork2_#res.offset] [2022-12-06 07:45:34,542 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [531] $Ultimate##0-->L48-5: Formula: (and (= v_~sum1~0_73 (+ (select (select |v_#memory_int_169| v_~A~0.base_98) (+ (* v_thread1Thread1of1ForFork1_~i~0_39 4) (- 4) v_~A~0.offset_98)) v_~sum1~0_74)) (< v_thread1Thread1of1ForFork1_~i~0_39 (+ 1 v_~N~0_91)) (= v_thread1Thread1of1ForFork1_~i~0_39 1)) InVars {~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, ~sum1~0=v_~sum1~0_74, #memory_int=|v_#memory_int_169|, ~N~0=v_~N~0_91} OutVars{~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_29|, ~sum1~0=v_~sum1~0_73, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_21|, #memory_int=|v_#memory_int_169|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_39, ~N~0=v_~N~0_91} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [530] $Ultimate##0-->L64-5: Formula: (and (= v_~sum3~0_57 (+ (select (select |v_#memory_int_167| v_~A~0.base_96) (+ (- 4) v_~A~0.offset_96 (* 4 v_thread3Thread1of1ForFork0_~i~2_51))) v_~sum3~0_58)) (= (+ 1 v_~M~0_81) v_thread3Thread1of1ForFork0_~i~2_51) (< v_thread3Thread1of1ForFork0_~i~2_51 (+ 1 v_~N~0_89))) InVars {~A~0.base=v_~A~0.base_96, ~A~0.offset=v_~A~0.offset_96, ~M~0=v_~M~0_81, #memory_int=|v_#memory_int_167|, ~sum3~0=v_~sum3~0_58, ~N~0=v_~N~0_89} OutVars{~A~0.base=v_~A~0.base_96, ~A~0.offset=v_~A~0.offset_96, ~M~0=v_~M~0_81, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_51, #memory_int=|v_#memory_int_167|, ~sum3~0=v_~sum3~0_57, ~N~0=v_~N~0_89, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_25|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_23|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5] [2022-12-06 07:45:34,595 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [531] $Ultimate##0-->L48-5: Formula: (and (= v_~sum1~0_73 (+ (select (select |v_#memory_int_169| v_~A~0.base_98) (+ (* v_thread1Thread1of1ForFork1_~i~0_39 4) (- 4) v_~A~0.offset_98)) v_~sum1~0_74)) (< v_thread1Thread1of1ForFork1_~i~0_39 (+ 1 v_~N~0_91)) (= v_thread1Thread1of1ForFork1_~i~0_39 1)) InVars {~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, ~sum1~0=v_~sum1~0_74, #memory_int=|v_#memory_int_169|, ~N~0=v_~N~0_91} OutVars{~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_29|, ~sum1~0=v_~sum1~0_73, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_21|, #memory_int=|v_#memory_int_169|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_39, ~N~0=v_~N~0_91} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [555] $Ultimate##0-->L64-5: Formula: (and (= (+ v_thread3Thread1of1ForFork0_~i~2_116 1) v_thread3Thread1of1ForFork0_~i~2_115) (= v_~sum3~0_119 (+ v_~sum3~0_120 (select (select |v_#memory_int_240| v_~A~0.base_151) (+ v_~A~0.offset_151 (* v_thread3Thread1of1ForFork0_~i~2_116 4))))) (= v_thread2Thread1of1ForFork2_~i~1_80 0) (< v_thread3Thread1of1ForFork0_~i~2_116 v_~N~0_139) (= |v_thread2Thread1of1ForFork2_#res.base_27| 0) (= |v_thread2Thread1of1ForFork2_#res.offset_27| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_80 v_~M~0_113))) InVars {~A~0.base=v_~A~0.base_151, ~A~0.offset=v_~A~0.offset_151, ~M~0=v_~M~0_113, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_116, #memory_int=|v_#memory_int_240|, ~sum3~0=v_~sum3~0_120, ~N~0=v_~N~0_139} OutVars{~A~0.base=v_~A~0.base_151, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_80, ~A~0.offset=v_~A~0.offset_151, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_27|, ~M~0=v_~M~0_113, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_115, #memory_int=|v_#memory_int_240|, ~sum3~0=v_~sum3~0_119, ~N~0=v_~N~0_139, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_60|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_58|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5, thread2Thread1of1ForFork2_#res.offset] [2022-12-06 07:45:34,668 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [531] $Ultimate##0-->L48-5: Formula: (and (= v_~sum1~0_73 (+ (select (select |v_#memory_int_169| v_~A~0.base_98) (+ (* v_thread1Thread1of1ForFork1_~i~0_39 4) (- 4) v_~A~0.offset_98)) v_~sum1~0_74)) (< v_thread1Thread1of1ForFork1_~i~0_39 (+ 1 v_~N~0_91)) (= v_thread1Thread1of1ForFork1_~i~0_39 1)) InVars {~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, ~sum1~0=v_~sum1~0_74, #memory_int=|v_#memory_int_169|, ~N~0=v_~N~0_91} OutVars{~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_29|, ~sum1~0=v_~sum1~0_73, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_21|, #memory_int=|v_#memory_int_169|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_39, ~N~0=v_~N~0_91} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [510] L83-4-->L84-3: Formula: (and (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= |v_ULTIMATE.start_main_#t~pre14#1_43| |v_#pthreadsForks_59|) (= (store |v_#memory_int_140| |v_ULTIMATE.start_main_~#t3~0#1.base_41| (store (select |v_#memory_int_140| |v_ULTIMATE.start_main_~#t3~0#1.base_41|) |v_ULTIMATE.start_main_~#t3~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre14#1_43|)) |v_#memory_int_139|)) InVars {#pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_41|, #memory_int=|v_#memory_int_140|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_41|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_31|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_43|, #pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_41|, #memory_int=|v_#memory_int_139|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 07:45:34,697 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [531] $Ultimate##0-->L48-5: Formula: (and (= v_~sum1~0_73 (+ (select (select |v_#memory_int_169| v_~A~0.base_98) (+ (* v_thread1Thread1of1ForFork1_~i~0_39 4) (- 4) v_~A~0.offset_98)) v_~sum1~0_74)) (< v_thread1Thread1of1ForFork1_~i~0_39 (+ 1 v_~N~0_91)) (= v_thread1Thread1of1ForFork1_~i~0_39 1)) InVars {~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, ~sum1~0=v_~sum1~0_74, #memory_int=|v_#memory_int_169|, ~N~0=v_~N~0_91} OutVars{~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_29|, ~sum1~0=v_~sum1~0_73, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_21|, #memory_int=|v_#memory_int_169|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_39, ~N~0=v_~N~0_91} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [505] L64-5-->L64-5: Formula: (and (= (+ v_thread3Thread1of1ForFork0_~i~2_38 1) v_thread3Thread1of1ForFork0_~i~2_37) (= (+ v_~sum3~0_36 (select (select |v_#memory_int_131| v_~A~0.base_68) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_38) v_~A~0.offset_68))) v_~sum3~0_35) (< v_thread3Thread1of1ForFork0_~i~2_38 v_~N~0_69)) InVars {~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_38, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_36, ~N~0=v_~N~0_69} OutVars{~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_37, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_35, ~N~0=v_~N~0_69, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_21|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5] [2022-12-06 07:45:34,729 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [531] $Ultimate##0-->L48-5: Formula: (and (= v_~sum1~0_73 (+ (select (select |v_#memory_int_169| v_~A~0.base_98) (+ (* v_thread1Thread1of1ForFork1_~i~0_39 4) (- 4) v_~A~0.offset_98)) v_~sum1~0_74)) (< v_thread1Thread1of1ForFork1_~i~0_39 (+ 1 v_~N~0_91)) (= v_thread1Thread1of1ForFork1_~i~0_39 1)) InVars {~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, ~sum1~0=v_~sum1~0_74, #memory_int=|v_#memory_int_169|, ~N~0=v_~N~0_91} OutVars{~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_29|, ~sum1~0=v_~sum1~0_73, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_21|, #memory_int=|v_#memory_int_169|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_39, ~N~0=v_~N~0_91} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [482] L82-3-->L83-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_41|) (= (store |v_#memory_int_84| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_84| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre12#1_17|)) |v_#memory_int_83|) (= (+ |v_#pthreadsForks_41| 1) |v_#pthreadsForks_40|)) InVars {#pthreadsForks=|v_#pthreadsForks_41|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_84|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_9|, #pthreadsForks=|v_#pthreadsForks_40|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_23|, #memory_int=|v_#memory_int_83|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] [2022-12-06 07:45:34,793 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [531] $Ultimate##0-->L48-5: Formula: (and (= v_~sum1~0_73 (+ (select (select |v_#memory_int_169| v_~A~0.base_98) (+ (* v_thread1Thread1of1ForFork1_~i~0_39 4) (- 4) v_~A~0.offset_98)) v_~sum1~0_74)) (< v_thread1Thread1of1ForFork1_~i~0_39 (+ 1 v_~N~0_91)) (= v_thread1Thread1of1ForFork1_~i~0_39 1)) InVars {~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, ~sum1~0=v_~sum1~0_74, #memory_int=|v_#memory_int_169|, ~N~0=v_~N~0_91} OutVars{~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_29|, ~sum1~0=v_~sum1~0_73, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_21|, #memory_int=|v_#memory_int_169|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_39, ~N~0=v_~N~0_91} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [523] $Ultimate##0-->L56-5: Formula: (and (= (+ v_~sum2~0_64 (select (select |v_#memory_int_157| v_~A~0.base_86) v_~A~0.offset_86)) v_~sum2~0_63) (= v_thread2Thread1of1ForFork2_~i~1_43 1) (< 0 v_~M~0_67)) InVars {~A~0.base=v_~A~0.base_86, ~A~0.offset=v_~A~0.offset_86, ~M~0=v_~M~0_67, #memory_int=|v_#memory_int_157|, ~sum2~0=v_~sum2~0_64} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_86, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_43, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_25|, ~A~0.offset=v_~A~0.offset_86, ~M~0=v_~M~0_67, #memory_int=|v_#memory_int_157|, ~sum2~0=v_~sum2~0_63} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0] [2022-12-06 07:45:34,821 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [531] $Ultimate##0-->L48-5: Formula: (and (= v_~sum1~0_73 (+ (select (select |v_#memory_int_169| v_~A~0.base_98) (+ (* v_thread1Thread1of1ForFork1_~i~0_39 4) (- 4) v_~A~0.offset_98)) v_~sum1~0_74)) (< v_thread1Thread1of1ForFork1_~i~0_39 (+ 1 v_~N~0_91)) (= v_thread1Thread1of1ForFork1_~i~0_39 1)) InVars {~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, ~sum1~0=v_~sum1~0_74, #memory_int=|v_#memory_int_169|, ~N~0=v_~N~0_91} OutVars{~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_29|, ~sum1~0=v_~sum1~0_73, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_21|, #memory_int=|v_#memory_int_169|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_39, ~N~0=v_~N~0_91} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [526] $Ultimate##0-->L56-5: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_53 1) (= v_thread3Thread1of1ForFork0_~i~2_41 v_~M~0_73) (= (+ v_~sum2~0_72 (select (select |v_#memory_int_161| v_~A~0.base_90) v_~A~0.offset_90)) v_~sum2~0_71) (< 0 v_~M~0_73)) InVars {~A~0.base=v_~A~0.base_90, ~A~0.offset=v_~A~0.offset_90, ~M~0=v_~M~0_73, #memory_int=|v_#memory_int_161|, ~sum2~0=v_~sum2~0_72} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_21|, ~A~0.base=v_~A~0.base_90, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_53, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_29|, ~A~0.offset=v_~A~0.offset_90, ~M~0=v_~M~0_73, #memory_int=|v_#memory_int_161|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_41, ~sum2~0=v_~sum2~0_71} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, thread3Thread1of1ForFork0_~i~2, ~sum2~0] [2022-12-06 07:45:34,858 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [531] $Ultimate##0-->L48-5: Formula: (and (= v_~sum1~0_73 (+ (select (select |v_#memory_int_169| v_~A~0.base_98) (+ (* v_thread1Thread1of1ForFork1_~i~0_39 4) (- 4) v_~A~0.offset_98)) v_~sum1~0_74)) (< v_thread1Thread1of1ForFork1_~i~0_39 (+ 1 v_~N~0_91)) (= v_thread1Thread1of1ForFork1_~i~0_39 1)) InVars {~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, ~sum1~0=v_~sum1~0_74, #memory_int=|v_#memory_int_169|, ~N~0=v_~N~0_91} OutVars{~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_29|, ~sum1~0=v_~sum1~0_73, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_21|, #memory_int=|v_#memory_int_169|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_39, ~N~0=v_~N~0_91} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [523] $Ultimate##0-->L56-5: Formula: (and (= (+ v_~sum2~0_64 (select (select |v_#memory_int_157| v_~A~0.base_86) v_~A~0.offset_86)) v_~sum2~0_63) (= v_thread2Thread1of1ForFork2_~i~1_43 1) (< 0 v_~M~0_67)) InVars {~A~0.base=v_~A~0.base_86, ~A~0.offset=v_~A~0.offset_86, ~M~0=v_~M~0_67, #memory_int=|v_#memory_int_157|, ~sum2~0=v_~sum2~0_64} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_86, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_43, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_25|, ~A~0.offset=v_~A~0.offset_86, ~M~0=v_~M~0_67, #memory_int=|v_#memory_int_157|, ~sum2~0=v_~sum2~0_63} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0] [2022-12-06 07:45:34,886 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [531] $Ultimate##0-->L48-5: Formula: (and (= v_~sum1~0_73 (+ (select (select |v_#memory_int_169| v_~A~0.base_98) (+ (* v_thread1Thread1of1ForFork1_~i~0_39 4) (- 4) v_~A~0.offset_98)) v_~sum1~0_74)) (< v_thread1Thread1of1ForFork1_~i~0_39 (+ 1 v_~N~0_91)) (= v_thread1Thread1of1ForFork1_~i~0_39 1)) InVars {~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, ~sum1~0=v_~sum1~0_74, #memory_int=|v_#memory_int_169|, ~N~0=v_~N~0_91} OutVars{~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_29|, ~sum1~0=v_~sum1~0_73, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_21|, #memory_int=|v_#memory_int_169|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_39, ~N~0=v_~N~0_91} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [554] $Ultimate##0-->L48-5: Formula: (and (= v_~sum1~0_125 (+ v_~sum1~0_126 (select (select |v_#memory_int_238| v_~A~0.base_149) (+ v_~A~0.offset_149 (* v_thread1Thread1of1ForFork1_~i~0_71 4))))) (= v_thread2Thread1of1ForFork2_~i~1_78 0) (= |v_thread2Thread1of1ForFork2_#res.offset_25| 0) (= v_thread1Thread1of1ForFork1_~i~0_70 (+ v_thread1Thread1of1ForFork1_~i~0_71 1)) (not (< v_thread2Thread1of1ForFork2_~i~1_78 v_~M~0_111)) (< v_thread1Thread1of1ForFork1_~i~0_71 v_~N~0_137) (= |v_thread2Thread1of1ForFork2_#res.base_25| 0)) InVars {~A~0.base=v_~A~0.base_149, ~A~0.offset=v_~A~0.offset_149, ~sum1~0=v_~sum1~0_126, ~M~0=v_~M~0_111, #memory_int=|v_#memory_int_238|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71, ~N~0=v_~N~0_137} OutVars{~A~0.base=v_~A~0.base_149, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_78, ~A~0.offset=v_~A~0.offset_149, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_54|, ~sum1~0=v_~sum1~0_125, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_25|, ~M~0=v_~M~0_111, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_46|, #memory_int=|v_#memory_int_238|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_70, ~N~0=v_~N~0_137, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_25|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread2Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork2_#res.offset] [2022-12-06 07:45:34,958 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [531] $Ultimate##0-->L48-5: Formula: (and (= v_~sum1~0_73 (+ (select (select |v_#memory_int_169| v_~A~0.base_98) (+ (* v_thread1Thread1of1ForFork1_~i~0_39 4) (- 4) v_~A~0.offset_98)) v_~sum1~0_74)) (< v_thread1Thread1of1ForFork1_~i~0_39 (+ 1 v_~N~0_91)) (= v_thread1Thread1of1ForFork1_~i~0_39 1)) InVars {~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, ~sum1~0=v_~sum1~0_74, #memory_int=|v_#memory_int_169|, ~N~0=v_~N~0_91} OutVars{~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_29|, ~sum1~0=v_~sum1~0_73, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_21|, #memory_int=|v_#memory_int_169|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_39, ~N~0=v_~N~0_91} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [530] $Ultimate##0-->L64-5: Formula: (and (= v_~sum3~0_57 (+ (select (select |v_#memory_int_167| v_~A~0.base_96) (+ (- 4) v_~A~0.offset_96 (* 4 v_thread3Thread1of1ForFork0_~i~2_51))) v_~sum3~0_58)) (= (+ 1 v_~M~0_81) v_thread3Thread1of1ForFork0_~i~2_51) (< v_thread3Thread1of1ForFork0_~i~2_51 (+ 1 v_~N~0_89))) InVars {~A~0.base=v_~A~0.base_96, ~A~0.offset=v_~A~0.offset_96, ~M~0=v_~M~0_81, #memory_int=|v_#memory_int_167|, ~sum3~0=v_~sum3~0_58, ~N~0=v_~N~0_89} OutVars{~A~0.base=v_~A~0.base_96, ~A~0.offset=v_~A~0.offset_96, ~M~0=v_~M~0_81, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_51, #memory_int=|v_#memory_int_167|, ~sum3~0=v_~sum3~0_57, ~N~0=v_~N~0_89, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_25|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_23|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5] [2022-12-06 07:45:34,991 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:45:34,992 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 921 [2022-12-06 07:45:34,992 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 194 transitions, 2523 flow [2022-12-06 07:45:34,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:34,992 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:34,992 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:35,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 07:45:35,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-12-06 07:45:35,193 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:35,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:35,193 INFO L85 PathProgramCache]: Analyzing trace with hash 808041688, now seen corresponding path program 1 times [2022-12-06 07:45:35,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:35,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876129247] [2022-12-06 07:45:35,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:35,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:35,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:35,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:35,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876129247] [2022-12-06 07:45:35,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876129247] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:45:35,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666855127] [2022-12-06 07:45:35,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:35,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:45:35,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:45:35,820 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) [2022-12-06 07:45:35,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 07:45:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:35,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-06 07:45:35,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:45:36,037 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:45:36,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2022-12-06 07:45:36,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:36,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:45:36,128 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:45:36,128 INFO L350 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 34 treesize of output 14 [2022-12-06 07:45:36,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:36,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666855127] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:45:36,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:45:36,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 3] total 12 [2022-12-06 07:45:36,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351433154] [2022-12-06 07:45:36,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:45:36,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 07:45:36,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:36,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 07:45:36,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-06 07:45:36,173 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 56 [2022-12-06 07:45:36,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 194 transitions, 2523 flow. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:36,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:36,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 56 [2022-12-06 07:45:36,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:37,022 INFO L130 PetriNetUnfolder]: 2478/3666 cut-off events. [2022-12-06 07:45:37,022 INFO L131 PetriNetUnfolder]: For 27855/28607 co-relation queries the response was YES. [2022-12-06 07:45:37,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23804 conditions, 3666 events. 2478/3666 cut-off events. For 27855/28607 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 17940 event pairs, 502 based on Foata normal form. 521/4140 useless extension candidates. Maximal degree in co-relation 23773. Up to 3058 conditions per place. [2022-12-06 07:45:37,049 INFO L137 encePairwiseOnDemand]: 23/56 looper letters, 182 selfloop transitions, 98 changer transitions 4/286 dead transitions. [2022-12-06 07:45:37,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 286 transitions, 3899 flow [2022-12-06 07:45:37,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:45:37,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:45:37,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 160 transitions. [2022-12-06 07:45:37,050 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2597402597402597 [2022-12-06 07:45:37,050 INFO L175 Difference]: Start difference. First operand has 98 places, 194 transitions, 2523 flow. Second operand 11 states and 160 transitions. [2022-12-06 07:45:37,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 286 transitions, 3899 flow [2022-12-06 07:45:37,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 286 transitions, 3731 flow, removed 83 selfloop flow, removed 2 redundant places. [2022-12-06 07:45:37,137 INFO L231 Difference]: Finished difference. Result has 110 places, 214 transitions, 2863 flow [2022-12-06 07:45:37,137 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=2357, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2863, PETRI_PLACES=110, PETRI_TRANSITIONS=214} [2022-12-06 07:45:37,138 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 80 predicate places. [2022-12-06 07:45:37,138 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:37,138 INFO L89 Accepts]: Start accepts. Operand has 110 places, 214 transitions, 2863 flow [2022-12-06 07:45:37,139 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:37,139 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:37,139 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 214 transitions, 2863 flow [2022-12-06 07:45:37,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 214 transitions, 2863 flow [2022-12-06 07:45:37,241 INFO L130 PetriNetUnfolder]: 637/1403 cut-off events. [2022-12-06 07:45:37,242 INFO L131 PetriNetUnfolder]: For 8507/8816 co-relation queries the response was YES. [2022-12-06 07:45:37,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7349 conditions, 1403 events. 637/1403 cut-off events. For 8507/8816 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 9649 event pairs, 167 based on Foata normal form. 12/1330 useless extension candidates. Maximal degree in co-relation 7052. Up to 611 conditions per place. [2022-12-06 07:45:37,255 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 214 transitions, 2863 flow [2022-12-06 07:45:37,255 INFO L188 LiptonReduction]: Number of co-enabled transitions 1214 [2022-12-06 07:45:37,300 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [487] L56-5-->L56-5: Formula: (and (= (+ v_~sum2~0_38 (select (select |v_#memory_int_103| v_~A~0.base_50) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_40) v_~A~0.offset_50))) v_~sum2~0_37) (= (+ v_thread2Thread1of1ForFork2_~i~1_40 1) v_thread2Thread1of1ForFork2_~i~1_39) (< v_thread2Thread1of1ForFork2_~i~1_40 v_~M~0_37)) InVars {~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_40, ~A~0.offset=v_~A~0.offset_50, ~M~0=v_~M~0_37, #memory_int=|v_#memory_int_103|, ~sum2~0=v_~sum2~0_38} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_15|, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_39, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_23|, ~A~0.offset=v_~A~0.offset_50, ~M~0=v_~M~0_37, #memory_int=|v_#memory_int_103|, ~sum2~0=v_~sum2~0_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0] and [503] L48-5-->L48-5: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_36 v_~N~0_63) (= v_thread1Thread1of1ForFork1_~i~0_35 (+ v_thread1Thread1of1ForFork1_~i~0_36 1)) (= v_~sum1~0_53 (+ v_~sum1~0_54 (select (select |v_#memory_int_127| v_~A~0.base_64) (+ (* v_thread1Thread1of1ForFork1_~i~0_36 4) v_~A~0.offset_64))))) InVars {~A~0.base=v_~A~0.base_64, ~A~0.offset=v_~A~0.offset_64, ~sum1~0=v_~sum1~0_54, #memory_int=|v_#memory_int_127|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_36, ~N~0=v_~N~0_63} OutVars{~A~0.base=v_~A~0.base_64, ~A~0.offset=v_~A~0.offset_64, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_27|, ~sum1~0=v_~sum1~0_53, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, #memory_int=|v_#memory_int_127|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, ~N~0=v_~N~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] [2022-12-06 07:45:37,343 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:45:37,344 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 206 [2022-12-06 07:45:37,344 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 214 transitions, 2869 flow [2022-12-06 07:45:37,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:37,344 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:37,344 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:37,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 07:45:37,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:45:37,552 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:37,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:37,552 INFO L85 PathProgramCache]: Analyzing trace with hash 961216993, now seen corresponding path program 1 times [2022-12-06 07:45:37,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:37,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80965371] [2022-12-06 07:45:37,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:37,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:37,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:45:37,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:37,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80965371] [2022-12-06 07:45:37,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80965371] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:37,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:37,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:45:37,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319276042] [2022-12-06 07:45:37,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:37,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:45:37,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:37,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:45:37,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:45:37,640 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-06 07:45:37,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 214 transitions, 2869 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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) [2022-12-06 07:45:37,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:37,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-06 07:45:37,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:38,141 INFO L130 PetriNetUnfolder]: 2656/3943 cut-off events. [2022-12-06 07:45:38,141 INFO L131 PetriNetUnfolder]: For 30212/30212 co-relation queries the response was YES. [2022-12-06 07:45:38,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24524 conditions, 3943 events. 2656/3943 cut-off events. For 30212/30212 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 19273 event pairs, 521 based on Foata normal form. 12/3954 useless extension candidates. Maximal degree in co-relation 23202. Up to 1987 conditions per place. [2022-12-06 07:45:38,160 INFO L137 encePairwiseOnDemand]: 38/58 looper letters, 229 selfloop transitions, 67 changer transitions 0/296 dead transitions. [2022-12-06 07:45:38,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 296 transitions, 4184 flow [2022-12-06 07:45:38,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:45:38,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:45:38,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2022-12-06 07:45:38,164 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28448275862068967 [2022-12-06 07:45:38,164 INFO L175 Difference]: Start difference. First operand has 110 places, 214 transitions, 2869 flow. Second operand 6 states and 99 transitions. [2022-12-06 07:45:38,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 296 transitions, 4184 flow [2022-12-06 07:45:38,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 296 transitions, 3980 flow, removed 57 selfloop flow, removed 4 redundant places. [2022-12-06 07:45:38,223 INFO L231 Difference]: Finished difference. Result has 112 places, 215 transitions, 2874 flow [2022-12-06 07:45:38,224 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=2718, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2874, PETRI_PLACES=112, PETRI_TRANSITIONS=215} [2022-12-06 07:45:38,224 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 82 predicate places. [2022-12-06 07:45:38,224 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:38,224 INFO L89 Accepts]: Start accepts. Operand has 112 places, 215 transitions, 2874 flow [2022-12-06 07:45:38,225 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:38,225 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:38,225 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 215 transitions, 2874 flow [2022-12-06 07:45:38,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 215 transitions, 2874 flow [2022-12-06 07:45:38,310 INFO L130 PetriNetUnfolder]: 650/1423 cut-off events. [2022-12-06 07:45:38,311 INFO L131 PetriNetUnfolder]: For 9479/9754 co-relation queries the response was YES. [2022-12-06 07:45:38,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7525 conditions, 1423 events. 650/1423 cut-off events. For 9479/9754 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 9757 event pairs, 174 based on Foata normal form. 11/1347 useless extension candidates. Maximal degree in co-relation 7239. Up to 610 conditions per place. [2022-12-06 07:45:38,326 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 215 transitions, 2874 flow [2022-12-06 07:45:38,326 INFO L188 LiptonReduction]: Number of co-enabled transitions 1224 [2022-12-06 07:45:38,642 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:45:38,643 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 419 [2022-12-06 07:45:38,643 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 215 transitions, 2889 flow [2022-12-06 07:45:38,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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) [2022-12-06 07:45:38,643 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:38,643 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:38,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-06 07:45:38,644 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:38,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:38,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1201742910, now seen corresponding path program 1 times [2022-12-06 07:45:38,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:38,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677149259] [2022-12-06 07:45:38,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:38,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:38,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:38,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:38,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677149259] [2022-12-06 07:45:38,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677149259] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:45:38,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387053522] [2022-12-06 07:45:38,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:38,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:45:38,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:45:38,720 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) [2022-12-06 07:45:38,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 07:45:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:38,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 07:45:38,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:45:38,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:38,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:45:38,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:38,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387053522] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:45:38,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:45:38,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-06 07:45:38,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824795474] [2022-12-06 07:45:38,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:45:38,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:45:38,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:38,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:45:38,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:45:38,918 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-06 07:45:38,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 215 transitions, 2889 flow. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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) [2022-12-06 07:45:38,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:38,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-06 07:45:38,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:39,726 INFO L130 PetriNetUnfolder]: 2996/4445 cut-off events. [2022-12-06 07:45:39,727 INFO L131 PetriNetUnfolder]: For 38859/38859 co-relation queries the response was YES. [2022-12-06 07:45:39,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27660 conditions, 4445 events. 2996/4445 cut-off events. For 38859/38859 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 22449 event pairs, 347 based on Foata normal form. 10/4447 useless extension candidates. Maximal degree in co-relation 26381. Up to 2034 conditions per place. [2022-12-06 07:45:39,760 INFO L137 encePairwiseOnDemand]: 33/59 looper letters, 269 selfloop transitions, 82 changer transitions 0/351 dead transitions. [2022-12-06 07:45:39,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 351 transitions, 4736 flow [2022-12-06 07:45:39,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:45:39,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:45:39,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2022-12-06 07:45:39,761 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.288135593220339 [2022-12-06 07:45:39,761 INFO L175 Difference]: Start difference. First operand has 112 places, 215 transitions, 2889 flow. Second operand 7 states and 119 transitions. [2022-12-06 07:45:39,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 351 transitions, 4736 flow [2022-12-06 07:45:39,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 351 transitions, 4575 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-06 07:45:39,889 INFO L231 Difference]: Finished difference. Result has 116 places, 218 transitions, 2954 flow [2022-12-06 07:45:39,890 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2730, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2954, PETRI_PLACES=116, PETRI_TRANSITIONS=218} [2022-12-06 07:45:39,890 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 86 predicate places. [2022-12-06 07:45:39,890 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:39,891 INFO L89 Accepts]: Start accepts. Operand has 116 places, 218 transitions, 2954 flow [2022-12-06 07:45:39,894 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:39,894 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:39,894 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 218 transitions, 2954 flow [2022-12-06 07:45:39,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 218 transitions, 2954 flow [2022-12-06 07:45:40,018 INFO L130 PetriNetUnfolder]: 710/1596 cut-off events. [2022-12-06 07:45:40,018 INFO L131 PetriNetUnfolder]: For 10900/11242 co-relation queries the response was YES. [2022-12-06 07:45:40,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8667 conditions, 1596 events. 710/1596 cut-off events. For 10900/11242 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 11541 event pairs, 177 based on Foata normal form. 13/1502 useless extension candidates. Maximal degree in co-relation 8347. Up to 686 conditions per place. [2022-12-06 07:45:40,034 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 218 transitions, 2954 flow [2022-12-06 07:45:40,034 INFO L188 LiptonReduction]: Number of co-enabled transitions 1308 [2022-12-06 07:45:40,035 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:40,035 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-06 07:45:40,036 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 218 transitions, 2954 flow [2022-12-06 07:45:40,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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) [2022-12-06 07:45:40,036 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:40,036 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:40,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 07:45:40,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-06 07:45:40,239 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:40,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:40,239 INFO L85 PathProgramCache]: Analyzing trace with hash -616669900, now seen corresponding path program 1 times [2022-12-06 07:45:40,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:40,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678552102] [2022-12-06 07:45:40,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:40,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:41,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:41,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:41,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678552102] [2022-12-06 07:45:41,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678552102] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:45:41,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541354649] [2022-12-06 07:45:41,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:41,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:45:41,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:45:41,049 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) [2022-12-06 07:45:41,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 07:45:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:41,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 07:45:41,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:45:41,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:45:41,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 07:45:41,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:45:41,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:45:41,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:45:41,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:45:41,490 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:45:41,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 43 [2022-12-06 07:45:41,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:41,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:45:43,787 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1028 (Array Int Int)) (~M~0 Int)) (or (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1028) c_~A~0.base))) (= (mod (+ (select .cse0 (+ c_~A~0.offset 4)) c_~sum1~0 (select .cse0 c_~A~0.offset)) 4294967296) (mod (let ((.cse1 (* ~M~0 4))) (+ (select .cse0 (+ c_~A~0.offset .cse1 4)) c_~sum3~0 (select .cse0 (+ c_~A~0.offset .cse1)) c_~sum2~0)) 4294967296))) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0))) is different from false [2022-12-06 07:45:43,825 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1028 (Array Int Int)) (v_ArrVal_1027 (Array Int Int)) (~M~0 Int)) (or (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1027) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1028) c_~A~0.base))) (= (mod (+ c_~sum1~0 (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 c_~A~0.offset)) 4294967296) (mod (let ((.cse1 (* ~M~0 4))) (+ (select .cse0 (+ c_~A~0.offset .cse1)) c_~sum3~0 c_~sum2~0 (select .cse0 (+ c_~A~0.offset .cse1 4)))) 4294967296))) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0))) is different from false [2022-12-06 07:45:43,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:43,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541354649] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:45:43,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:45:43,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 19 [2022-12-06 07:45:43,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092557994] [2022-12-06 07:45:43,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:45:43,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 07:45:43,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:43,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 07:45:43,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=252, Unknown=2, NotChecked=70, Total=420 [2022-12-06 07:45:43,846 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-06 07:45:43,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 218 transitions, 2954 flow. Second operand has 21 states, 20 states have (on average 2.4) internal successors, (48), 20 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) [2022-12-06 07:45:43,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:43,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-06 07:45:43,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:45,774 INFO L130 PetriNetUnfolder]: 3357/5128 cut-off events. [2022-12-06 07:45:45,774 INFO L131 PetriNetUnfolder]: For 46299/46299 co-relation queries the response was YES. [2022-12-06 07:45:45,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31754 conditions, 5128 events. 3357/5128 cut-off events. For 46299/46299 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 27971 event pairs, 673 based on Foata normal form. 1/5121 useless extension candidates. Maximal degree in co-relation 29979. Up to 4128 conditions per place. [2022-12-06 07:45:45,814 INFO L137 encePairwiseOnDemand]: 17/59 looper letters, 195 selfloop transitions, 163 changer transitions 9/367 dead transitions. [2022-12-06 07:45:45,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 367 transitions, 5047 flow [2022-12-06 07:45:45,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 07:45:45,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 07:45:45,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 165 transitions. [2022-12-06 07:45:45,816 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16450648055832504 [2022-12-06 07:45:45,816 INFO L175 Difference]: Start difference. First operand has 116 places, 218 transitions, 2954 flow. Second operand 17 states and 165 transitions. [2022-12-06 07:45:45,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 367 transitions, 5047 flow [2022-12-06 07:45:45,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 367 transitions, 4988 flow, removed 13 selfloop flow, removed 3 redundant places. [2022-12-06 07:45:45,934 INFO L231 Difference]: Finished difference. Result has 137 places, 293 transitions, 4470 flow [2022-12-06 07:45:45,934 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2917, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=4470, PETRI_PLACES=137, PETRI_TRANSITIONS=293} [2022-12-06 07:45:45,934 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 107 predicate places. [2022-12-06 07:45:45,934 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:45,934 INFO L89 Accepts]: Start accepts. Operand has 137 places, 293 transitions, 4470 flow [2022-12-06 07:45:45,936 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:45,936 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:45,936 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 293 transitions, 4470 flow [2022-12-06 07:45:45,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 293 transitions, 4470 flow [2022-12-06 07:45:45,998 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][186], [408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1049#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), 101#L56-5true, Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 153#true, 462#true, 14#thread3EXITtrue, 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 622#true, 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 49#L85-1true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 691#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 669#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, Black: 1146#(and (<= ~sum1~0 ~sum3~0) (not (< 2 ~N~0)) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum2~0 0) (<= ~sum3~0 ~sum1~0) (< 1 ~N~0)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))]) [2022-12-06 07:45:45,998 INFO L382 tUnfolder$Statistics]: this new event has 10 ancestors and is cut-off event [2022-12-06 07:45:45,998 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:45:45,998 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:45,998 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:45:46,024 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][186], [408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1049#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 9#thread2EXITtrue, Black: 153#true, 462#true, 14#thread3EXITtrue, 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 622#true, 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 49#L85-1true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 691#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 669#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1146#(and (<= ~sum1~0 ~sum3~0) (not (< 2 ~N~0)) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum2~0 0) (<= ~sum3~0 ~sum1~0) (< 1 ~N~0)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2))]) [2022-12-06 07:45:46,024 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 07:45:46,024 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:46,024 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:46,025 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:46,045 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][186], [408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1049#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 9#thread2EXITtrue, Black: 153#true, 462#true, 14#thread3EXITtrue, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 622#true, 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 49#L85-1true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 691#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 669#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, Black: 1146#(and (<= ~sum1~0 ~sum3~0) (not (< 2 ~N~0)) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum2~0 0) (<= ~sum3~0 ~sum1~0) (< 1 ~N~0)), 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2))]) [2022-12-06 07:45:46,046 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:45:46,046 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:46,046 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:46,046 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:46,063 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][186], [408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1049#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 9#thread2EXITtrue, Black: 153#true, 462#true, 14#thread3EXITtrue, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 713#(= (mod ~sum1~0 4294967296) (mod (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum3~0 ~sum2~0) 4294967296)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 49#L85-1true, 752#true, 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 691#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 669#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1146#(and (<= ~sum1~0 ~sum3~0) (not (< 2 ~N~0)) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum2~0 0) (<= ~sum3~0 ~sum1~0) (< 1 ~N~0))]) [2022-12-06 07:45:46,064 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:45:46,064 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:46,064 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:46,064 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:46,095 INFO L130 PetriNetUnfolder]: 932/2050 cut-off events. [2022-12-06 07:45:46,095 INFO L131 PetriNetUnfolder]: For 17308/17684 co-relation queries the response was YES. [2022-12-06 07:45:46,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12219 conditions, 2050 events. 932/2050 cut-off events. For 17308/17684 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 15274 event pairs, 201 based on Foata normal form. 16/1923 useless extension candidates. Maximal degree in co-relation 12091. Up to 804 conditions per place. [2022-12-06 07:45:46,116 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 293 transitions, 4470 flow [2022-12-06 07:45:46,116 INFO L188 LiptonReduction]: Number of co-enabled transitions 1514 [2022-12-06 07:45:46,124 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_13| 0) (= |v_thread2Thread1of1ForFork2_#res.base_13| 0) (= v_thread2Thread1of1ForFork2_~i~1_47 0) (not (< v_thread2Thread1of1ForFork2_~i~1_47 v_~M~0_69))) InVars {~M~0=v_~M~0_69} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_47, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_13|, ~M~0=v_~M~0_69, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [568] $Ultimate##0-->L64-5: Formula: (let ((.cse0 (select |v_#memory_int_274| v_~A~0.base_177))) (and (= (+ v_thread3Thread1of1ForFork0_~i~2_138 1) v_thread3Thread1of1ForFork0_~i~2_137) (= v_~sum3~0_139 (+ (select .cse0 (+ v_~A~0.offset_177 (* v_thread3Thread1of1ForFork0_~i~2_138 4))) v_~sum3~0_140)) (< v_thread1Thread1of1ForFork1_~i~0_105 (+ v_~N~0_165 1)) (= v_~sum1~0_185 (+ (select .cse0 (+ v_~A~0.offset_177 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_105 4))) v_~sum1~0_186)) (< v_thread3Thread1of1ForFork0_~i~2_138 v_~N~0_165) (= v_thread1Thread1of1ForFork1_~i~0_105 1))) InVars {~A~0.base=v_~A~0.base_177, ~A~0.offset=v_~A~0.offset_177, ~sum1~0=v_~sum1~0_186, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_138, #memory_int=|v_#memory_int_274|, ~sum3~0=v_~sum3~0_140, ~N~0=v_~N~0_165} OutVars{~A~0.base=v_~A~0.base_177, ~A~0.offset=v_~A~0.offset_177, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_87|, ~sum1~0=v_~sum1~0_185, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_79|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_137, #memory_int=|v_#memory_int_274|, ~sum3~0=v_~sum3~0_139, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_105, ~N~0=v_~N~0_165, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_71|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_69|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5] [2022-12-06 07:45:46,201 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_13| 0) (= |v_thread2Thread1of1ForFork2_#res.base_13| 0) (= v_thread2Thread1of1ForFork2_~i~1_47 0) (not (< v_thread2Thread1of1ForFork2_~i~1_47 v_~M~0_69))) InVars {~M~0=v_~M~0_69} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_47, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_13|, ~M~0=v_~M~0_69, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [570] $Ultimate##0-->L48-5: Formula: (and (= (let ((.cse0 (select |v_#memory_int_280| v_~A~0.base_181)) (.cse1 (* v_thread1Thread1of1ForFork1_~i~0_109 4))) (+ v_~sum1~0_195 (select .cse0 (+ .cse1 v_~A~0.offset_181 (- 4))) (select .cse0 (+ .cse1 v_~A~0.offset_181 (- 8))))) v_~sum1~0_193) (= 2 v_thread1Thread1of1ForFork1_~i~0_109) (< v_thread1Thread1of1ForFork1_~i~0_109 (+ v_~N~0_169 1))) InVars {~A~0.base=v_~A~0.base_181, ~A~0.offset=v_~A~0.offset_181, ~sum1~0=v_~sum1~0_195, #memory_int=|v_#memory_int_280|, ~N~0=v_~N~0_169} OutVars{~A~0.base=v_~A~0.base_181, ~A~0.offset=v_~A~0.offset_181, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_91|, ~sum1~0=v_~sum1~0_193, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_83|, #memory_int=|v_#memory_int_280|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_109, ~N~0=v_~N~0_169} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] [2022-12-06 07:45:46,268 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [528] $Ultimate##0-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_45 v_~N~0_85)) (= 0 |v_thread3Thread1of1ForFork0_#res.base_13|) (= |v_thread3Thread1of1ForFork0_#res.offset_13| 0) (= v_thread3Thread1of1ForFork0_~i~2_45 v_~M~0_77)) InVars {~M~0=v_~M~0_77, ~N~0=v_~N~0_85} OutVars{~M~0=v_~M~0_77, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_13|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_45, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_13|, ~N~0=v_~N~0_85} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#res.base] and [560] $Ultimate##0-->L48-5: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_85 2) (< v_thread1Thread1of1ForFork1_~i~0_85 (+ v_~N~0_149 1)) (= v_~sum1~0_149 (let ((.cse0 (select |v_#memory_int_256| v_~A~0.base_161)) (.cse1 (* v_thread1Thread1of1ForFork1_~i~0_85 4))) (+ v_~sum1~0_151 (select .cse0 (+ .cse1 v_~A~0.offset_161 (- 8))) (select .cse0 (+ .cse1 v_~A~0.offset_161 (- 4))))))) InVars {~A~0.base=v_~A~0.base_161, ~A~0.offset=v_~A~0.offset_161, ~sum1~0=v_~sum1~0_151, #memory_int=|v_#memory_int_256|, ~N~0=v_~N~0_149} OutVars{~A~0.base=v_~A~0.base_161, ~A~0.offset=v_~A~0.offset_161, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_67|, ~sum1~0=v_~sum1~0_149, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_59|, #memory_int=|v_#memory_int_256|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_85, ~N~0=v_~N~0_149} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] [2022-12-06 07:45:46,322 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [528] $Ultimate##0-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_45 v_~N~0_85)) (= 0 |v_thread3Thread1of1ForFork0_#res.base_13|) (= |v_thread3Thread1of1ForFork0_#res.offset_13| 0) (= v_thread3Thread1of1ForFork0_~i~2_45 v_~M~0_77)) InVars {~M~0=v_~M~0_77, ~N~0=v_~N~0_85} OutVars{~M~0=v_~M~0_77, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_13|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_45, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_13|, ~N~0=v_~N~0_85} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#res.base] and [525] $Ultimate##0-->L56-5: Formula: (and (< v_thread2Thread1of1ForFork2_~i~1_49 (+ 1 v_~M~0_71)) (= (+ v_~sum2~0_68 (select (select |v_#memory_int_159| v_~A~0.base_88) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_49) (- 4) v_~A~0.offset_88))) v_~sum2~0_67) (= v_thread2Thread1of1ForFork2_~i~1_49 1)) InVars {~A~0.base=v_~A~0.base_88, ~A~0.offset=v_~A~0.offset_88, ~M~0=v_~M~0_71, #memory_int=|v_#memory_int_159|, ~sum2~0=v_~sum2~0_68} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_19|, ~A~0.base=v_~A~0.base_88, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_49, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_27|, ~A~0.offset=v_~A~0.offset_88, ~M~0=v_~M~0_71, #memory_int=|v_#memory_int_159|, ~sum2~0=v_~sum2~0_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0] [2022-12-06 07:45:46,369 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [528] $Ultimate##0-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_45 v_~N~0_85)) (= 0 |v_thread3Thread1of1ForFork0_#res.base_13|) (= |v_thread3Thread1of1ForFork0_#res.offset_13| 0) (= v_thread3Thread1of1ForFork0_~i~2_45 v_~M~0_77)) InVars {~M~0=v_~M~0_77, ~N~0=v_~N~0_85} OutVars{~M~0=v_~M~0_77, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_13|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_45, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_13|, ~N~0=v_~N~0_85} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#res.base] and [561] $Ultimate##0-->L56-5: Formula: (let ((.cse0 (select |v_#memory_int_258| v_~A~0.base_163))) (and (= v_~sum1~0_155 (+ v_~sum1~0_156 (select .cse0 (+ v_~A~0.offset_163 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_89 4))))) (= v_thread2Thread1of1ForFork2_~i~1_87 1) (= v_thread1Thread1of1ForFork1_~i~0_89 1) (< v_thread1Thread1of1ForFork1_~i~0_89 (+ v_~N~0_151 1)) (< 0 v_~M~0_117) (= (+ (select .cse0 v_~A~0.offset_163) v_~sum2~0_112) v_~sum2~0_111))) InVars {~A~0.base=v_~A~0.base_163, ~A~0.offset=v_~A~0.offset_163, ~M~0=v_~M~0_117, ~sum1~0=v_~sum1~0_156, #memory_int=|v_#memory_int_258|, ~sum2~0=v_~sum2~0_112, ~N~0=v_~N~0_151} OutVars{~A~0.base=v_~A~0.base_163, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_89, ~sum2~0=v_~sum2~0_111, ~N~0=v_~N~0_151, thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_39|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_87, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_47|, ~A~0.offset=v_~A~0.offset_163, ~M~0=v_~M~0_117, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_71|, ~sum1~0=v_~sum1~0_155, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_63|, #memory_int=|v_#memory_int_258|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~sum2~0] [2022-12-06 07:45:46,467 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [503] L48-5-->L48-5: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_36 v_~N~0_63) (= v_thread1Thread1of1ForFork1_~i~0_35 (+ v_thread1Thread1of1ForFork1_~i~0_36 1)) (= v_~sum1~0_53 (+ v_~sum1~0_54 (select (select |v_#memory_int_127| v_~A~0.base_64) (+ (* v_thread1Thread1of1ForFork1_~i~0_36 4) v_~A~0.offset_64))))) InVars {~A~0.base=v_~A~0.base_64, ~A~0.offset=v_~A~0.offset_64, ~sum1~0=v_~sum1~0_54, #memory_int=|v_#memory_int_127|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_36, ~N~0=v_~N~0_63} OutVars{~A~0.base=v_~A~0.base_64, ~A~0.offset=v_~A~0.offset_64, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_27|, ~sum1~0=v_~sum1~0_53, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, #memory_int=|v_#memory_int_127|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, ~N~0=v_~N~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] [2022-12-06 07:45:46,680 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] $Ultimate##0-->L64-5: Formula: (let ((.cse0 (select |v_#memory_int_300| v_~A~0.base_199))) (and (< v_thread1Thread1of1ForFork1_~i~0_134 (+ v_~N~0_185 1)) (< (+ v_thread3Thread1of1ForFork0_~i~2_155 1) v_~N~0_185) (= v_thread2Thread1of1ForFork2_~i~1_120 0) (= |v_thread2Thread1of1ForFork2_#res.offset_43| 0) (= |v_thread2Thread1of1ForFork2_#res.base_43| 0) (= v_~sum3~0_153 (let ((.cse1 (* v_thread3Thread1of1ForFork0_~i~2_155 4))) (+ (select .cse0 (+ v_~A~0.offset_199 4 .cse1)) (select .cse0 (+ v_~A~0.offset_199 .cse1)) v_~sum3~0_155))) (= v_thread1Thread1of1ForFork1_~i~0_134 1) (= (+ 2 v_thread3Thread1of1ForFork0_~i~2_155) v_thread3Thread1of1ForFork0_~i~2_153) (not (< v_thread2Thread1of1ForFork2_~i~1_120 v_~M~0_145)) (= v_~sum1~0_233 (+ (select .cse0 (+ v_~A~0.offset_199 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_134 4))) v_~sum1~0_234)))) InVars {~A~0.base=v_~A~0.base_199, ~A~0.offset=v_~A~0.offset_199, ~M~0=v_~M~0_145, ~sum1~0=v_~sum1~0_234, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_155, #memory_int=|v_#memory_int_300|, ~sum3~0=v_~sum3~0_155, ~N~0=v_~N~0_185} OutVars{~A~0.base=v_~A~0.base_199, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_153, ~sum3~0=v_~sum3~0_153, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_134, ~N~0=v_~N~0_185, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_80|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_120, ~A~0.offset=v_~A~0.offset_199, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_43|, ~M~0=v_~M~0_145, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_114|, ~sum1~0=v_~sum1~0_233, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_106|, #memory_int=|v_#memory_int_300|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_78|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5, thread2Thread1of1ForFork2_#res.offset] and [503] L48-5-->L48-5: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_36 v_~N~0_63) (= v_thread1Thread1of1ForFork1_~i~0_35 (+ v_thread1Thread1of1ForFork1_~i~0_36 1)) (= v_~sum1~0_53 (+ v_~sum1~0_54 (select (select |v_#memory_int_127| v_~A~0.base_64) (+ (* v_thread1Thread1of1ForFork1_~i~0_36 4) v_~A~0.offset_64))))) InVars {~A~0.base=v_~A~0.base_64, ~A~0.offset=v_~A~0.offset_64, ~sum1~0=v_~sum1~0_54, #memory_int=|v_#memory_int_127|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_36, ~N~0=v_~N~0_63} OutVars{~A~0.base=v_~A~0.base_64, ~A~0.offset=v_~A~0.offset_64, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_27|, ~sum1~0=v_~sum1~0_53, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, #memory_int=|v_#memory_int_127|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, ~N~0=v_~N~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] [2022-12-06 07:45:46,978 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:45:46,979 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1045 [2022-12-06 07:45:46,979 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 290 transitions, 4592 flow [2022-12-06 07:45:46,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 20 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) [2022-12-06 07:45:46,979 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:46,979 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:46,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 07:45:47,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-06 07:45:47,180 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:47,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:47,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1419503499, now seen corresponding path program 1 times [2022-12-06 07:45:47,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:47,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585776679] [2022-12-06 07:45:47,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:47,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:47,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:47,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:47,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585776679] [2022-12-06 07:45:47,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585776679] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:45:47,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854586027] [2022-12-06 07:45:47,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:47,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:45:47,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:45:47,639 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) [2022-12-06 07:45:47,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 07:45:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:47,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 07:45:47,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:45:47,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:45:47,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 07:45:47,982 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:45:47,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 16 [2022-12-06 07:45:48,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:48,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:45:48,141 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:45:48,141 INFO L350 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 98 treesize of output 70 [2022-12-06 07:45:48,147 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:45:48,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 41 treesize of output 29 [2022-12-06 07:45:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:48,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854586027] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:45:48,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:45:48,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 07:45:48,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208771901] [2022-12-06 07:45:48,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:45:48,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 07:45:48,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:48,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 07:45:48,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-12-06 07:45:48,214 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 65 [2022-12-06 07:45:48,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 290 transitions, 4592 flow. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 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) [2022-12-06 07:45:48,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:48,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 65 [2022-12-06 07:45:48,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:49,461 INFO L130 PetriNetUnfolder]: 3723/5665 cut-off events. [2022-12-06 07:45:49,461 INFO L131 PetriNetUnfolder]: For 64611/65786 co-relation queries the response was YES. [2022-12-06 07:45:49,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41235 conditions, 5665 events. 3723/5665 cut-off events. For 64611/65786 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 31822 event pairs, 715 based on Foata normal form. 704/6297 useless extension candidates. Maximal degree in co-relation 40884. Up to 4398 conditions per place. [2022-12-06 07:45:49,500 INFO L137 encePairwiseOnDemand]: 18/65 looper letters, 252 selfloop transitions, 171 changer transitions 6/433 dead transitions. [2022-12-06 07:45:49,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 433 transitions, 7015 flow [2022-12-06 07:45:49,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 07:45:49,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 07:45:49,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 198 transitions. [2022-12-06 07:45:49,501 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23431952662721894 [2022-12-06 07:45:49,501 INFO L175 Difference]: Start difference. First operand has 134 places, 290 transitions, 4592 flow. Second operand 13 states and 198 transitions. [2022-12-06 07:45:49,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 433 transitions, 7015 flow [2022-12-06 07:45:49,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 433 transitions, 6800 flow, removed 76 selfloop flow, removed 4 redundant places. [2022-12-06 07:45:49,643 INFO L231 Difference]: Finished difference. Result has 145 places, 338 transitions, 5637 flow [2022-12-06 07:45:49,644 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=4389, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5637, PETRI_PLACES=145, PETRI_TRANSITIONS=338} [2022-12-06 07:45:49,644 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 115 predicate places. [2022-12-06 07:45:49,644 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:49,644 INFO L89 Accepts]: Start accepts. Operand has 145 places, 338 transitions, 5637 flow [2022-12-06 07:45:49,646 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:49,646 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:49,646 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 338 transitions, 5637 flow [2022-12-06 07:45:49,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 338 transitions, 5637 flow [2022-12-06 07:45:49,731 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][195], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 1049#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), 101#L56-5true, Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 153#true, 462#true, 14#thread3EXITtrue, 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 622#true, 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 49#L85-1true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 691#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 669#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 1156#true, Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), Black: 1146#(and (<= ~sum1~0 ~sum3~0) (not (< 2 ~N~0)) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum2~0 0) (<= ~sum3~0 ~sum1~0) (< 1 ~N~0)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0))]) [2022-12-06 07:45:49,731 INFO L382 tUnfolder$Statistics]: this new event has 10 ancestors and is cut-off event [2022-12-06 07:45:49,731 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:45:49,731 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:49,731 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:45:49,768 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][195], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 1049#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 9#thread2EXITtrue, Black: 153#true, 462#true, 14#thread3EXITtrue, 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 622#true, 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 49#L85-1true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 691#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 669#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 1156#true, Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), Black: 1146#(and (<= ~sum1~0 ~sum3~0) (not (< 2 ~N~0)) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum2~0 0) (<= ~sum3~0 ~sum1~0) (< 1 ~N~0)), 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0))]) [2022-12-06 07:45:49,769 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 07:45:49,769 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:49,769 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:45:49,769 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:49,787 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][195], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 1049#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 9#thread2EXITtrue, Black: 153#true, 462#true, 14#thread3EXITtrue, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 622#true, 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 49#L85-1true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 691#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 669#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 1156#true, Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1146#(and (<= ~sum1~0 ~sum3~0) (not (< 2 ~N~0)) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum2~0 0) (<= ~sum3~0 ~sum1~0) (< 1 ~N~0)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2))]) [2022-12-06 07:45:49,787 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:45:49,787 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:49,787 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:49,787 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:49,794 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][195], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1049#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 9#thread2EXITtrue, Black: 153#true, 462#true, 14#thread3EXITtrue, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 713#(= (mod ~sum1~0 4294967296) (mod (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum3~0 ~sum2~0) 4294967296)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 49#L85-1true, 752#true, 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 691#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 669#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 1156#true, Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1146#(and (<= ~sum1~0 ~sum3~0) (not (< 2 ~N~0)) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum2~0 0) (<= ~sum3~0 ~sum1~0) (< 1 ~N~0)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2))]) [2022-12-06 07:45:49,794 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:45:49,794 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:49,794 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:49,794 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:49,829 INFO L130 PetriNetUnfolder]: 1118/2422 cut-off events. [2022-12-06 07:45:49,829 INFO L131 PetriNetUnfolder]: For 22252/22734 co-relation queries the response was YES. [2022-12-06 07:45:49,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15325 conditions, 2422 events. 1118/2422 cut-off events. For 22252/22734 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 18511 event pairs, 238 based on Foata normal form. 35/2283 useless extension candidates. Maximal degree in co-relation 15173. Up to 955 conditions per place. [2022-12-06 07:45:49,854 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 338 transitions, 5637 flow [2022-12-06 07:45:49,854 INFO L188 LiptonReduction]: Number of co-enabled transitions 1734 [2022-12-06 07:45:49,855 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [567] $Ultimate##0-->L84-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre14#1_65| |v_#pthreadsForks_92|) (= v_~sum1~0_181 (+ v_~sum1~0_182 (select (select |v_#memory_int_271| v_~A~0.base_175) (+ v_~A~0.offset_175 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_103 4))))) (= |v_#pthreadsForks_91| (+ |v_#pthreadsForks_92| 1)) (= (store |v_#memory_int_271| |v_ULTIMATE.start_main_~#t3~0#1.base_59| (store (select |v_#memory_int_271| |v_ULTIMATE.start_main_~#t3~0#1.base_59|) |v_ULTIMATE.start_main_~#t3~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre14#1_65|)) |v_#memory_int_270|) (= v_thread1Thread1of1ForFork1_~i~0_103 1) (< v_thread1Thread1of1ForFork1_~i~0_103 (+ v_~N~0_163 1))) InVars {~A~0.base=v_~A~0.base_175, ~A~0.offset=v_~A~0.offset_175, #pthreadsForks=|v_#pthreadsForks_92|, ~sum1~0=v_~sum1~0_182, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_59|, #memory_int=|v_#memory_int_271|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_59|, ~N~0=v_~N~0_163} OutVars{~A~0.base=v_~A~0.base_175, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_59|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_59|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_103, ~N~0=v_~N~0_163, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_55|, ~A~0.offset=v_~A~0.offset_175, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_65|, #pthreadsForks=|v_#pthreadsForks_91|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_85|, ~sum1~0=v_~sum1~0_181, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_77|, #memory_int=|v_#memory_int_270|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork1_~i~0] and [503] L48-5-->L48-5: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_36 v_~N~0_63) (= v_thread1Thread1of1ForFork1_~i~0_35 (+ v_thread1Thread1of1ForFork1_~i~0_36 1)) (= v_~sum1~0_53 (+ v_~sum1~0_54 (select (select |v_#memory_int_127| v_~A~0.base_64) (+ (* v_thread1Thread1of1ForFork1_~i~0_36 4) v_~A~0.offset_64))))) InVars {~A~0.base=v_~A~0.base_64, ~A~0.offset=v_~A~0.offset_64, ~sum1~0=v_~sum1~0_54, #memory_int=|v_#memory_int_127|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_36, ~N~0=v_~N~0_63} OutVars{~A~0.base=v_~A~0.base_64, ~A~0.offset=v_~A~0.offset_64, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_27|, ~sum1~0=v_~sum1~0_53, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, #memory_int=|v_#memory_int_127|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, ~N~0=v_~N~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] [2022-12-06 07:45:49,927 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:45:49,928 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 284 [2022-12-06 07:45:49,928 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 338 transitions, 5652 flow [2022-12-06 07:45:49,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 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) [2022-12-06 07:45:49,928 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:49,928 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:49,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 07:45:50,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-06 07:45:50,135 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:50,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:50,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1147053406, now seen corresponding path program 1 times [2022-12-06 07:45:50,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:50,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85007170] [2022-12-06 07:45:50,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:50,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:50,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:50,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:50,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85007170] [2022-12-06 07:45:50,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85007170] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:50,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:50,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:45:50,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160047537] [2022-12-06 07:45:50,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:50,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:45:50,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:50,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:45:50,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:45:50,797 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 65 [2022-12-06 07:45:50,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 338 transitions, 5652 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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) [2022-12-06 07:45:50,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:50,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 65 [2022-12-06 07:45:50,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:51,705 INFO L130 PetriNetUnfolder]: 3897/5945 cut-off events. [2022-12-06 07:45:51,706 INFO L131 PetriNetUnfolder]: For 68529/68529 co-relation queries the response was YES. [2022-12-06 07:45:51,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41581 conditions, 5945 events. 3897/5945 cut-off events. For 68529/68529 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 33297 event pairs, 1396 based on Foata normal form. 3/5943 useless extension candidates. Maximal degree in co-relation 41220. Up to 5893 conditions per place. [2022-12-06 07:45:51,744 INFO L137 encePairwiseOnDemand]: 28/65 looper letters, 310 selfloop transitions, 39 changer transitions 10/359 dead transitions. [2022-12-06 07:45:51,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 359 transitions, 6508 flow [2022-12-06 07:45:51,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:45:51,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:45:51,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2022-12-06 07:45:51,745 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24615384615384617 [2022-12-06 07:45:51,746 INFO L175 Difference]: Start difference. First operand has 144 places, 338 transitions, 5652 flow. Second operand 6 states and 96 transitions. [2022-12-06 07:45:51,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 359 transitions, 6508 flow [2022-12-06 07:45:51,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 359 transitions, 6184 flow, removed 110 selfloop flow, removed 5 redundant places. [2022-12-06 07:45:51,916 INFO L231 Difference]: Finished difference. Result has 145 places, 336 transitions, 5359 flow [2022-12-06 07:45:51,916 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=5322, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5359, PETRI_PLACES=145, PETRI_TRANSITIONS=336} [2022-12-06 07:45:51,917 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 115 predicate places. [2022-12-06 07:45:51,917 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:51,917 INFO L89 Accepts]: Start accepts. Operand has 145 places, 336 transitions, 5359 flow [2022-12-06 07:45:51,918 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:51,918 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:51,918 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 336 transitions, 5359 flow [2022-12-06 07:45:51,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 336 transitions, 5359 flow [2022-12-06 07:45:52,058 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][188], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1282#true, Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1049#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1288#(and (= ~sum2~0 0) (= 2 thread1Thread1of1ForFork1_~i~0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296))) (= 2 ~N~0)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 9#thread2EXITtrue, 462#true, Black: 153#true, 14#thread3EXITtrue, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 662#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 49#L85-1true, 752#true, 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 691#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 669#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 1156#true, 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), Black: 1146#(and (<= ~sum1~0 ~sum3~0) (not (< 2 ~N~0)) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum2~0 0) (<= ~sum3~0 ~sum1~0) (< 1 ~N~0)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))]) [2022-12-06 07:45:52,058 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:45:52,058 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:52,058 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:52,059 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:52,068 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][188], [1282#true, Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1049#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1288#(and (= ~sum2~0 0) (= 2 thread1Thread1of1ForFork1_~i~0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296))) (= 2 ~N~0)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 9#thread2EXITtrue, 462#true, Black: 153#true, 14#thread3EXITtrue, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 713#(= (mod ~sum1~0 4294967296) (mod (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum3~0 ~sum2~0) 4294967296)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 49#L85-1true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 691#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 669#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 1156#true, Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1146#(and (<= ~sum1~0 ~sum3~0) (not (< 2 ~N~0)) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum2~0 0) (<= ~sum3~0 ~sum1~0) (< 1 ~N~0)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2))]) [2022-12-06 07:45:52,068 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:45:52,068 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:52,068 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:52,068 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:52,101 INFO L130 PetriNetUnfolder]: 1115/2423 cut-off events. [2022-12-06 07:45:52,101 INFO L131 PetriNetUnfolder]: For 20781/21157 co-relation queries the response was YES. [2022-12-06 07:45:52,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14801 conditions, 2423 events. 1115/2423 cut-off events. For 20781/21157 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 18459 event pairs, 235 based on Foata normal form. 25/2279 useless extension candidates. Maximal degree in co-relation 14743. Up to 960 conditions per place. [2022-12-06 07:45:52,128 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 336 transitions, 5359 flow [2022-12-06 07:45:52,128 INFO L188 LiptonReduction]: Number of co-enabled transitions 1728 [2022-12-06 07:45:52,129 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:52,130 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 213 [2022-12-06 07:45:52,130 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 336 transitions, 5359 flow [2022-12-06 07:45:52,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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) [2022-12-06 07:45:52,130 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:52,130 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:52,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-06 07:45:52,131 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:52,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:52,131 INFO L85 PathProgramCache]: Analyzing trace with hash -835799711, now seen corresponding path program 1 times [2022-12-06 07:45:52,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:52,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160075244] [2022-12-06 07:45:52,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:52,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:52,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:52,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:52,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160075244] [2022-12-06 07:45:52,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160075244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:52,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:52,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:45:52,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545351108] [2022-12-06 07:45:52,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:52,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:45:52,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:52,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:45:52,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:45:52,675 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 64 [2022-12-06 07:45:52,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 336 transitions, 5359 flow. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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) [2022-12-06 07:45:52,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:52,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 64 [2022-12-06 07:45:52,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:53,743 INFO L130 PetriNetUnfolder]: 4570/6955 cut-off events. [2022-12-06 07:45:53,744 INFO L131 PetriNetUnfolder]: For 79927/81372 co-relation queries the response was YES. [2022-12-06 07:45:53,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50838 conditions, 6955 events. 4570/6955 cut-off events. For 79927/81372 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 40586 event pairs, 1235 based on Foata normal form. 778/7598 useless extension candidates. Maximal degree in co-relation 50765. Up to 5803 conditions per place. [2022-12-06 07:45:53,793 INFO L137 encePairwiseOnDemand]: 23/64 looper letters, 285 selfloop transitions, 142 changer transitions 4/435 dead transitions. [2022-12-06 07:45:53,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 435 transitions, 7303 flow [2022-12-06 07:45:53,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:45:53,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:45:53,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2022-12-06 07:45:53,795 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34375 [2022-12-06 07:45:53,795 INFO L175 Difference]: Start difference. First operand has 144 places, 336 transitions, 5359 flow. Second operand 6 states and 132 transitions. [2022-12-06 07:45:53,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 435 transitions, 7303 flow [2022-12-06 07:45:54,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 435 transitions, 7228 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-06 07:45:54,012 INFO L231 Difference]: Finished difference. Result has 148 places, 382 transitions, 6477 flow [2022-12-06 07:45:54,012 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=5286, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6477, PETRI_PLACES=148, PETRI_TRANSITIONS=382} [2022-12-06 07:45:54,013 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 118 predicate places. [2022-12-06 07:45:54,013 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:54,013 INFO L89 Accepts]: Start accepts. Operand has 148 places, 382 transitions, 6477 flow [2022-12-06 07:45:54,015 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:54,015 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:54,015 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 382 transitions, 6477 flow [2022-12-06 07:45:54,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 382 transitions, 6477 flow [2022-12-06 07:45:54,139 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][213], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 1049#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 9#thread2EXITtrue, 462#true, Black: 153#true, 14#thread3EXITtrue, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 622#true, Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 1293#true, 49#L85-1true, 752#true, 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 691#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 669#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 1156#true, Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), Black: 1146#(and (<= ~sum1~0 ~sum3~0) (not (< 2 ~N~0)) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum2~0 0) (<= ~sum3~0 ~sum1~0) (< 1 ~N~0)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0))]) [2022-12-06 07:45:54,139 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:45:54,139 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:54,139 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:54,139 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:54,175 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][213], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 1049#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 9#thread2EXITtrue, 462#true, Black: 153#true, 14#thread3EXITtrue, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 622#true, Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 49#L85-1true, 1293#true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 691#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 669#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 1156#true, Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, Black: 1146#(and (<= ~sum1~0 ~sum3~0) (not (< 2 ~N~0)) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum2~0 0) (<= ~sum3~0 ~sum1~0) (< 1 ~N~0)), 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0))]) [2022-12-06 07:45:54,176 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:45:54,176 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:54,176 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:54,176 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:54,176 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:54,181 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][213], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1049#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 9#thread2EXITtrue, 462#true, Black: 153#true, 14#thread3EXITtrue, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 662#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 1293#true, 49#L85-1true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 691#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 669#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 1156#true, 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, Black: 1146#(and (<= ~sum1~0 ~sum3~0) (not (< 2 ~N~0)) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum2~0 0) (<= ~sum3~0 ~sum1~0) (< 1 ~N~0)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))]) [2022-12-06 07:45:54,181 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:45:54,181 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:54,181 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:54,181 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:54,278 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][213], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1049#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 9#thread2EXITtrue, 462#true, Black: 153#true, 14#thread3EXITtrue, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 713#(= (mod ~sum1~0 4294967296) (mod (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum3~0 ~sum2~0) 4294967296)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 1293#true, 49#L85-1true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 691#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 669#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 1156#true, 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, Black: 1146#(and (<= ~sum1~0 ~sum3~0) (not (< 2 ~N~0)) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum2~0 0) (<= ~sum3~0 ~sum1~0) (< 1 ~N~0)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2))]) [2022-12-06 07:45:54,279 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:45:54,279 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:54,279 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:54,279 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:54,328 INFO L130 PetriNetUnfolder]: 1245/2775 cut-off events. [2022-12-06 07:45:54,328 INFO L131 PetriNetUnfolder]: For 25221/25725 co-relation queries the response was YES. [2022-12-06 07:45:54,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17235 conditions, 2775 events. 1245/2775 cut-off events. For 25221/25725 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 22213 event pairs, 273 based on Foata normal form. 39/2611 useless extension candidates. Maximal degree in co-relation 17080. Up to 1080 conditions per place. [2022-12-06 07:45:54,369 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 382 transitions, 6477 flow [2022-12-06 07:45:54,369 INFO L188 LiptonReduction]: Number of co-enabled transitions 2148 [2022-12-06 07:45:54,371 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:54,371 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 358 [2022-12-06 07:45:54,371 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 382 transitions, 6477 flow [2022-12-06 07:45:54,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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) [2022-12-06 07:45:54,372 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:54,372 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:54,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-06 07:45:54,372 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:54,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:54,372 INFO L85 PathProgramCache]: Analyzing trace with hash 594898099, now seen corresponding path program 1 times [2022-12-06 07:45:54,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:54,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757767891] [2022-12-06 07:45:54,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:54,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:55,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:55,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:55,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757767891] [2022-12-06 07:45:55,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757767891] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:45:55,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614869574] [2022-12-06 07:45:55,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:55,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:45:55,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:45:55,061 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:45:55,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 07:45:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:55,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 07:45:55,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:45:55,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:45:55,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 07:45:55,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:45:55,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 07:45:55,394 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:45:55,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 16 [2022-12-06 07:45:55,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:55,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:45:55,582 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:45:55,583 INFO L350 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 306 treesize of output 242 [2022-12-06 07:45:55,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 101 [2022-12-06 07:45:55,594 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:45:55,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 222 treesize of output 182 [2022-12-06 07:45:55,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:55,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614869574] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:45:55,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:45:55,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 07:45:55,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100355828] [2022-12-06 07:45:55,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:45:55,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 07:45:55,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:55,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 07:45:55,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=272, Unknown=3, NotChecked=0, Total=342 [2022-12-06 07:45:55,861 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 64 [2022-12-06 07:45:55,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 382 transitions, 6477 flow. Second operand has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 19 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) [2022-12-06 07:45:55,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:55,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 64 [2022-12-06 07:45:55,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:57,420 INFO L130 PetriNetUnfolder]: 5172/7867 cut-off events. [2022-12-06 07:45:57,420 INFO L131 PetriNetUnfolder]: For 101965/103577 co-relation queries the response was YES. [2022-12-06 07:45:57,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60133 conditions, 7867 events. 5172/7867 cut-off events. For 101965/103577 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 46688 event pairs, 1398 based on Foata normal form. 1015/8812 useless extension candidates. Maximal degree in co-relation 59732. Up to 5825 conditions per place. [2022-12-06 07:45:57,487 INFO L137 encePairwiseOnDemand]: 18/64 looper letters, 297 selfloop transitions, 224 changer transitions 5/530 dead transitions. [2022-12-06 07:45:57,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 530 transitions, 9272 flow [2022-12-06 07:45:57,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:45:57,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:45:57,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 192 transitions. [2022-12-06 07:45:57,492 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2727272727272727 [2022-12-06 07:45:57,492 INFO L175 Difference]: Start difference. First operand has 148 places, 382 transitions, 6477 flow. Second operand 11 states and 192 transitions. [2022-12-06 07:45:57,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 530 transitions, 9272 flow [2022-12-06 07:45:57,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 530 transitions, 9160 flow, removed 45 selfloop flow, removed 1 redundant places. [2022-12-06 07:45:57,925 INFO L231 Difference]: Finished difference. Result has 162 places, 437 transitions, 8106 flow [2022-12-06 07:45:57,926 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=6365, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8106, PETRI_PLACES=162, PETRI_TRANSITIONS=437} [2022-12-06 07:45:57,926 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 132 predicate places. [2022-12-06 07:45:57,926 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:57,926 INFO L89 Accepts]: Start accepts. Operand has 162 places, 437 transitions, 8106 flow [2022-12-06 07:45:57,928 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:57,928 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:57,928 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 437 transitions, 8106 flow [2022-12-06 07:45:57,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 437 transitions, 8106 flow [2022-12-06 07:45:58,163 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][226], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 1049#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 9#thread2EXITtrue, 462#true, Black: 153#true, 14#thread3EXITtrue, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 622#true, Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 1293#true, 49#L85-1true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 691#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 669#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 1156#true, 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 1146#(and (<= ~sum1~0 ~sum3~0) (not (< 2 ~N~0)) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum2~0 0) (<= ~sum3~0 ~sum1~0) (< 1 ~N~0)), 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2))]) [2022-12-06 07:45:58,164 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:45:58,164 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:58,164 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:58,164 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:45:58,193 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][226], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1049#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 9#thread2EXITtrue, Black: 153#true, 462#true, 14#thread3EXITtrue, 1392#(= (mod ~sum1~0 4294967296) (mod (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum3~0 ~sum2~0) 4294967296)), Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 713#(= (mod ~sum1~0 4294967296) (mod (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum3~0 ~sum2~0) 4294967296)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 1293#true, 49#L85-1true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 691#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 669#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 1156#true, Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, Black: 1146#(and (<= ~sum1~0 ~sum3~0) (not (< 2 ~N~0)) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum2~0 0) (<= ~sum3~0 ~sum1~0) (< 1 ~N~0)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2))]) [2022-12-06 07:45:58,194 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:45:58,194 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:58,194 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:58,194 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:45:58,249 INFO L130 PetriNetUnfolder]: 1420/3141 cut-off events. [2022-12-06 07:45:58,249 INFO L131 PetriNetUnfolder]: For 33563/34186 co-relation queries the response was YES. [2022-12-06 07:45:58,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20769 conditions, 3141 events. 1420/3141 cut-off events. For 33563/34186 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 25675 event pairs, 301 based on Foata normal form. 80/2993 useless extension candidates. Maximal degree in co-relation 20582. Up to 1214 conditions per place. [2022-12-06 07:45:58,342 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 437 transitions, 8106 flow [2022-12-06 07:45:58,342 INFO L188 LiptonReduction]: Number of co-enabled transitions 2452 [2022-12-06 07:45:58,344 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:58,344 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 418 [2022-12-06 07:45:58,345 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 437 transitions, 8106 flow [2022-12-06 07:45:58,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 19 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) [2022-12-06 07:45:58,345 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:58,345 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:58,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 07:45:58,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:45:58,548 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:45:58,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:58,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1122428828, now seen corresponding path program 1 times [2022-12-06 07:45:58,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:58,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162616531] [2022-12-06 07:45:58,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:58,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:58,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:58,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:58,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162616531] [2022-12-06 07:45:58,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162616531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:58,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:58,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:45:58,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077889505] [2022-12-06 07:45:58,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:58,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:45:58,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:58,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:45:58,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:45:58,604 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 64 [2022-12-06 07:45:58,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 437 transitions, 8106 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2022-12-06 07:45:58,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:58,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 64 [2022-12-06 07:45:58,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:00,455 INFO L130 PetriNetUnfolder]: 7028/10870 cut-off events. [2022-12-06 07:46:00,455 INFO L131 PetriNetUnfolder]: For 157913/160080 co-relation queries the response was YES. [2022-12-06 07:46:00,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84744 conditions, 10870 events. 7028/10870 cut-off events. For 157913/160080 co-relation queries the response was YES. Maximal size of possible extension queue 678. Compared 69966 event pairs, 2733 based on Foata normal form. 1383/12081 useless extension candidates. Maximal degree in co-relation 84112. Up to 5182 conditions per place. [2022-12-06 07:46:00,534 INFO L137 encePairwiseOnDemand]: 57/64 looper letters, 533 selfloop transitions, 7 changer transitions 1/545 dead transitions. [2022-12-06 07:46:00,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 545 transitions, 10649 flow [2022-12-06 07:46:00,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:46:00,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:46:00,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2022-12-06 07:46:00,535 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46875 [2022-12-06 07:46:00,535 INFO L175 Difference]: Start difference. First operand has 162 places, 437 transitions, 8106 flow. Second operand 4 states and 120 transitions. [2022-12-06 07:46:00,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 545 transitions, 10649 flow [2022-12-06 07:46:00,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 545 transitions, 10313 flow, removed 119 selfloop flow, removed 6 redundant places. [2022-12-06 07:46:00,949 INFO L231 Difference]: Finished difference. Result has 160 places, 420 transitions, 7589 flow [2022-12-06 07:46:00,950 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=7571, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=7589, PETRI_PLACES=160, PETRI_TRANSITIONS=420} [2022-12-06 07:46:00,950 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 130 predicate places. [2022-12-06 07:46:00,950 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:00,950 INFO L89 Accepts]: Start accepts. Operand has 160 places, 420 transitions, 7589 flow [2022-12-06 07:46:00,952 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:00,952 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:00,952 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 420 transitions, 7589 flow [2022-12-06 07:46:00,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 420 transitions, 7589 flow [2022-12-06 07:46:01,256 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][222], [408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 9#thread2EXITtrue, 462#true, Black: 153#true, 14#thread3EXITtrue, 1437#true, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 622#true, Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 49#L85-1true, 1293#true, 752#true, 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), 1303#true, Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 1156#true, 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, Black: 1146#(and (<= ~sum1~0 ~sum3~0) (not (< 2 ~N~0)) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum2~0 0) (<= ~sum3~0 ~sum1~0) (< 1 ~N~0)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2))]) [2022-12-06 07:46:01,256 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:46:01,256 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:01,256 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:01,256 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:01,276 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][222], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1439#(<= ~N~0 2), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 9#thread2EXITtrue, 462#true, Black: 153#true, 14#thread3EXITtrue, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 622#true, Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 49#L85-1true, 1293#true, 752#true, 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 1156#true, 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, Black: 1146#(and (<= ~sum1~0 ~sum3~0) (not (< 2 ~N~0)) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum2~0 0) (<= ~sum3~0 ~sum1~0) (< 1 ~N~0)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))]) [2022-12-06 07:46:01,276 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:46:01,276 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:01,276 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:01,276 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:01,285 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][222], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), 1439#(<= ~N~0 2), Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 9#thread2EXITtrue, 462#true, Black: 153#true, 14#thread3EXITtrue, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 662#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 49#L85-1true, 1293#true, 752#true, 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 1156#true, 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), Black: 1146#(and (<= ~sum1~0 ~sum3~0) (not (< 2 ~N~0)) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum2~0 0) (<= ~sum3~0 ~sum1~0) (< 1 ~N~0)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))]) [2022-12-06 07:46:01,285 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:46:01,285 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:01,285 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:01,285 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:01,310 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][222], [408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 9#thread2EXITtrue, Black: 153#true, 462#true, 14#thread3EXITtrue, 1437#true, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 622#true, 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 49#L85-1true, 1293#true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 1303#true, Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 1156#true, Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1146#(and (<= ~sum1~0 ~sum3~0) (not (< 2 ~N~0)) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum2~0 0) (<= ~sum3~0 ~sum1~0) (< 1 ~N~0)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2))]) [2022-12-06 07:46:01,310 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:46:01,310 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:01,310 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:01,310 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:01,310 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:01,312 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][222], [408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 9#thread2EXITtrue, 462#true, Black: 153#true, 1392#(= (mod ~sum1~0 4294967296) (mod (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum3~0 ~sum2~0) 4294967296)), 14#thread3EXITtrue, 1437#true, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 713#(= (mod ~sum1~0 4294967296) (mod (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum3~0 ~sum2~0) 4294967296)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 1293#true, 49#L85-1true, 752#true, 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 1156#true, 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), Black: 1146#(and (<= ~sum1~0 ~sum3~0) (not (< 2 ~N~0)) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum2~0 0) (<= ~sum3~0 ~sum1~0) (< 1 ~N~0)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))]) [2022-12-06 07:46:01,312 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:46:01,313 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:01,313 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:01,313 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:01,393 INFO L130 PetriNetUnfolder]: 1788/4211 cut-off events. [2022-12-06 07:46:01,393 INFO L131 PetriNetUnfolder]: For 40793/41468 co-relation queries the response was YES. [2022-12-06 07:46:01,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26455 conditions, 4211 events. 1788/4211 cut-off events. For 40793/41468 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 38212 event pairs, 448 based on Foata normal form. 61/3959 useless extension candidates. Maximal degree in co-relation 26243. Up to 1647 conditions per place. [2022-12-06 07:46:01,444 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 420 transitions, 7589 flow [2022-12-06 07:46:01,444 INFO L188 LiptonReduction]: Number of co-enabled transitions 2332 [2022-12-06 07:46:01,450 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [588] $Ultimate##0-->L48-5: Formula: (let ((.cse0 (select |v_#memory_int_325| v_~A~0.base_217))) (and (= v_thread2Thread1of1ForFork2_~i~1_138 0) (= (let ((.cse1 (* v_thread3Thread1of1ForFork0_~i~2_192 4))) (+ (select .cse0 (+ v_~A~0.offset_217 .cse1)) (select .cse0 (+ v_~A~0.offset_217 4 .cse1)) v_~sum3~0_179)) v_~sum3~0_178) (< (+ v_thread3Thread1of1ForFork0_~i~2_192 1) v_~N~0_203) (= 2 v_thread1Thread1of1ForFork1_~i~0_156) (not (< v_thread2Thread1of1ForFork2_~i~1_138 v_~M~0_161)) (= (+ 2 v_thread3Thread1of1ForFork0_~i~2_192) v_thread3Thread1of1ForFork0_~i~2_191) (= |v_thread2Thread1of1ForFork2_#res.base_57| 0) (< v_thread1Thread1of1ForFork1_~i~0_156 (+ v_~N~0_203 1)) (= |v_thread2Thread1of1ForFork2_#res.offset_57| 0) (= v_~sum1~0_267 (let ((.cse2 (* v_thread1Thread1of1ForFork1_~i~0_156 4))) (+ (select .cse0 (+ v_~A~0.offset_217 .cse2 (- 4))) v_~sum1~0_269 (select .cse0 (+ v_~A~0.offset_217 .cse2 (- 8)))))))) InVars {~A~0.base=v_~A~0.base_217, ~A~0.offset=v_~A~0.offset_217, ~sum1~0=v_~sum1~0_269, ~M~0=v_~M~0_161, #memory_int=|v_#memory_int_325|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_192, ~sum3~0=v_~sum3~0_179, ~N~0=v_~N~0_203} OutVars{~A~0.base=v_~A~0.base_217, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_191, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_156, ~sum3~0=v_~sum3~0_178, ~N~0=v_~N~0_203, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_98|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_138, ~A~0.offset=v_~A~0.offset_217, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_134|, ~sum1~0=v_~sum1~0_267, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_57|, ~M~0=v_~M~0_161, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_126|, #memory_int=|v_#memory_int_325|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_96|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_57|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread2Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_~i~2, thread1Thread1of1ForFork1_~i~0, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5, thread2Thread1of1ForFork2_#res.offset] and [505] L64-5-->L64-5: Formula: (and (= (+ v_thread3Thread1of1ForFork0_~i~2_38 1) v_thread3Thread1of1ForFork0_~i~2_37) (= (+ v_~sum3~0_36 (select (select |v_#memory_int_131| v_~A~0.base_68) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_38) v_~A~0.offset_68))) v_~sum3~0_35) (< v_thread3Thread1of1ForFork0_~i~2_38 v_~N~0_69)) InVars {~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_38, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_36, ~N~0=v_~N~0_69} OutVars{~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_37, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_35, ~N~0=v_~N~0_69, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_21|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5] [2022-12-06 07:46:01,572 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:46:01,573 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 623 [2022-12-06 07:46:01,573 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 419 transitions, 7587 flow [2022-12-06 07:46:01,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2022-12-06 07:46:01,573 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:01,573 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:46:01,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-06 07:46:01,573 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:46:01,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:01,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1777564259, now seen corresponding path program 2 times [2022-12-06 07:46:01,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:01,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254778276] [2022-12-06 07:46:01,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:01,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:02,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:02,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:02,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254778276] [2022-12-06 07:46:02,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254778276] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:46:02,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003995274] [2022-12-06 07:46:02,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:46:02,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:46:02,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:46:02,192 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:46:02,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 07:46:02,326 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:46:02,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:46:02,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-06 07:46:02,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:46:02,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:46:02,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 07:46:02,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:46:02,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 07:46:02,497 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:46:02,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 16 [2022-12-06 07:46:02,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:02,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:46:02,631 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1267 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1267) c_~A~0.base))) (= (mod (+ c_~sum3~0 (select .cse0 (+ c_~A~0.offset 4)) c_~sum2~0 (select .cse0 c_~A~0.offset)) 4294967296) (mod (+ (select .cse0 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4))) c_~sum1~0) 4294967296)))) is different from false [2022-12-06 07:46:02,643 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:46:02,644 INFO L350 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 306 treesize of output 242 [2022-12-06 07:46:02,648 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:46:02,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 242 treesize of output 202 [2022-12-06 07:46:02,652 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:46:02,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 202 treesize of output 182 [2022-12-06 07:46:03,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:03,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003995274] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:46:03,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:46:03,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 07:46:03,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799891970] [2022-12-06 07:46:03,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:46:03,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 07:46:03,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:03,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 07:46:03,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=244, Unknown=1, NotChecked=32, Total=342 [2022-12-06 07:46:03,250 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 64 [2022-12-06 07:46:03,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 419 transitions, 7587 flow. Second operand has 19 states, 19 states have (on average 3.789473684210526) internal successors, (72), 19 states have internal predecessors, (72), 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) [2022-12-06 07:46:03,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:03,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 64 [2022-12-06 07:46:03,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:05,608 INFO L130 PetriNetUnfolder]: 7358/11351 cut-off events. [2022-12-06 07:46:05,608 INFO L131 PetriNetUnfolder]: For 157622/160177 co-relation queries the response was YES. [2022-12-06 07:46:05,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88116 conditions, 11351 events. 7358/11351 cut-off events. For 157622/160177 co-relation queries the response was YES. Maximal size of possible extension queue 714. Compared 73386 event pairs, 2159 based on Foata normal form. 1482/12677 useless extension candidates. Maximal degree in co-relation 87570. Up to 9640 conditions per place. [2022-12-06 07:46:05,688 INFO L137 encePairwiseOnDemand]: 18/64 looper letters, 297 selfloop transitions, 215 changer transitions 5/521 dead transitions. [2022-12-06 07:46:05,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 521 transitions, 9645 flow [2022-12-06 07:46:05,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:46:05,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:46:05,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2022-12-06 07:46:05,689 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2585227272727273 [2022-12-06 07:46:05,689 INFO L175 Difference]: Start difference. First operand has 158 places, 419 transitions, 7587 flow. Second operand 11 states and 182 transitions. [2022-12-06 07:46:05,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 521 transitions, 9645 flow [2022-12-06 07:46:06,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 521 transitions, 9633 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 07:46:06,210 INFO L231 Difference]: Finished difference. Result has 167 places, 435 transitions, 8438 flow [2022-12-06 07:46:06,210 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=7577, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=202, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8438, PETRI_PLACES=167, PETRI_TRANSITIONS=435} [2022-12-06 07:46:06,211 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 137 predicate places. [2022-12-06 07:46:06,211 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:06,211 INFO L89 Accepts]: Start accepts. Operand has 167 places, 435 transitions, 8438 flow [2022-12-06 07:46:06,213 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:06,213 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:06,214 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 435 transitions, 8438 flow [2022-12-06 07:46:06,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 435 transitions, 8438 flow [2022-12-06 07:46:06,386 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][227], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), 101#L56-5true, Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), Black: 153#true, 462#true, Black: 1487#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1477#(and (= ~A~0.offset 0) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 14#thread3EXITtrue, 1442#true, 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 622#true, 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 49#L85-1true, 1293#true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 1303#true, Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 1156#true, Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0))]) [2022-12-06 07:46:06,386 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 07:46:06,386 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:06,386 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:06,386 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:06,449 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][227], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 9#thread2EXITtrue, 462#true, Black: 1487#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 153#true, Black: 1477#(and (= ~A~0.offset 0) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 1442#true, 14#thread3EXITtrue, 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 622#true, 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 49#L85-1true, 1293#true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), 1303#true, Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 1156#true, 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))]) [2022-12-06 07:46:06,449 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:46:06,450 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:06,450 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:06,450 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:06,490 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][227], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 9#thread2EXITtrue, Black: 1487#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 462#true, Black: 153#true, Black: 1477#(and (= ~A~0.offset 0) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 1442#true, 14#thread3EXITtrue, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 622#true, 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 49#L85-1true, 1293#true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), 1156#true, Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))]) [2022-12-06 07:46:06,491 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:46:06,491 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:06,491 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:06,491 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:06,503 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][227], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 9#thread2EXITtrue, 462#true, Black: 153#true, Black: 1487#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1477#(and (= ~A~0.offset 0) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 14#thread3EXITtrue, 1442#true, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 622#true, 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 49#L85-1true, 1293#true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), 1303#true, Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 1156#true, Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))]) [2022-12-06 07:46:06,504 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:46:06,504 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:06,504 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:06,504 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:06,505 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][227], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 9#thread2EXITtrue, Black: 1487#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 153#true, 462#true, Black: 1477#(and (= ~A~0.offset 0) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 14#thread3EXITtrue, 1442#true, 1392#(= (mod ~sum1~0 4294967296) (mod (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum3~0 ~sum2~0) 4294967296)), Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 713#(= (mod ~sum1~0 4294967296) (mod (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum3~0 ~sum2~0) 4294967296)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 1293#true, 49#L85-1true, 752#true, 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 1156#true, Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))]) [2022-12-06 07:46:06,505 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:46:06,505 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:06,505 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:06,505 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:06,588 INFO L130 PetriNetUnfolder]: 1499/3552 cut-off events. [2022-12-06 07:46:06,588 INFO L131 PetriNetUnfolder]: For 38499/39076 co-relation queries the response was YES. [2022-12-06 07:46:06,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23456 conditions, 3552 events. 1499/3552 cut-off events. For 38499/39076 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 31452 event pairs, 372 based on Foata normal form. 61/3344 useless extension candidates. Maximal degree in co-relation 23290. Up to 1401 conditions per place. [2022-12-06 07:46:06,638 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 435 transitions, 8438 flow [2022-12-06 07:46:06,638 INFO L188 LiptonReduction]: Number of co-enabled transitions 2444 [2022-12-06 07:46:06,640 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:46:06,640 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 429 [2022-12-06 07:46:06,640 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 435 transitions, 8438 flow [2022-12-06 07:46:06,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.789473684210526) internal successors, (72), 19 states have internal predecessors, (72), 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) [2022-12-06 07:46:06,641 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:06,641 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:46:06,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 07:46:06,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-12-06 07:46:06,845 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:46:06,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:06,845 INFO L85 PathProgramCache]: Analyzing trace with hash -2053398207, now seen corresponding path program 1 times [2022-12-06 07:46:06,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:06,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931567961] [2022-12-06 07:46:06,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:06,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:06,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:06,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:06,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931567961] [2022-12-06 07:46:06,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931567961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:46:06,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:46:06,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:46:06,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158189514] [2022-12-06 07:46:06,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:46:06,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:46:06,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:06,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:46:06,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:46:06,969 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-06 07:46:06,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 435 transitions, 8438 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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) [2022-12-06 07:46:06,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:06,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-06 07:46:06,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:08,856 INFO L130 PetriNetUnfolder]: 7656/11810 cut-off events. [2022-12-06 07:46:08,856 INFO L131 PetriNetUnfolder]: For 158293/158293 co-relation queries the response was YES. [2022-12-06 07:46:08,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87730 conditions, 11810 events. 7656/11810 cut-off events. For 158293/158293 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 75564 event pairs, 1412 based on Foata normal form. 4/11814 useless extension candidates. Maximal degree in co-relation 86831. Up to 6410 conditions per place. [2022-12-06 07:46:08,937 INFO L137 encePairwiseOnDemand]: 48/64 looper letters, 584 selfloop transitions, 38 changer transitions 1/623 dead transitions. [2022-12-06 07:46:08,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 623 transitions, 12309 flow [2022-12-06 07:46:08,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:46:08,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:46:08,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2022-12-06 07:46:08,938 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.384375 [2022-12-06 07:46:08,938 INFO L175 Difference]: Start difference. First operand has 167 places, 435 transitions, 8438 flow. Second operand 5 states and 123 transitions. [2022-12-06 07:46:08,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 623 transitions, 12309 flow [2022-12-06 07:46:09,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 623 transitions, 11988 flow, removed 58 selfloop flow, removed 6 redundant places. [2022-12-06 07:46:09,574 INFO L231 Difference]: Finished difference. Result has 167 places, 447 transitions, 8536 flow [2022-12-06 07:46:09,575 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=8101, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=8536, PETRI_PLACES=167, PETRI_TRANSITIONS=447} [2022-12-06 07:46:09,575 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 137 predicate places. [2022-12-06 07:46:09,575 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:09,575 INFO L89 Accepts]: Start accepts. Operand has 167 places, 447 transitions, 8536 flow [2022-12-06 07:46:09,576 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:09,577 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:09,577 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 447 transitions, 8536 flow [2022-12-06 07:46:09,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 447 transitions, 8536 flow [2022-12-06 07:46:09,862 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][237], [408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), 1577#(<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 9#thread2EXITtrue, Black: 153#true, 462#true, Black: 1487#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1477#(and (= ~A~0.offset 0) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 14#thread3EXITtrue, 1442#true, Black: 1576#(<= ~N~0 (+ 2 ~M~0)), Black: 1574#true, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 622#true, Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 49#L85-1true, 1293#true, 752#true, 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), 1303#true, Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 1156#true, Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))]) [2022-12-06 07:46:09,863 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:46:09,863 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:09,863 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:09,863 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:09,905 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][238], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 9#thread2EXITtrue, Black: 1487#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 153#true, 462#true, Black: 1477#(and (= ~A~0.offset 0) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 14#thread3EXITtrue, 1442#true, Black: 1576#(<= ~N~0 (+ 2 ~M~0)), Black: 1574#true, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, 1579#(and (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= ~N~0 (+ 2 ~M~0))), Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 662#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 49#L85-1true, 1293#true, 752#true, 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 1156#true, Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0))]) [2022-12-06 07:46:09,905 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:46:09,905 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:09,905 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:09,905 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:09,931 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][237], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), 1577#(<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 9#thread2EXITtrue, Black: 1487#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 462#true, Black: 153#true, Black: 1477#(and (= ~A~0.offset 0) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 1442#true, 14#thread3EXITtrue, Black: 1576#(<= ~N~0 (+ 2 ~M~0)), Black: 1574#true, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 622#true, 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 49#L85-1true, 1293#true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), 1303#true, Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 1156#true, 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))]) [2022-12-06 07:46:09,931 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:46:09,931 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:09,931 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:09,931 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:09,931 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:09,936 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][237], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), 1577#(<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 9#thread2EXITtrue, Black: 153#true, Black: 1487#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 462#true, Black: 1477#(and (= ~A~0.offset 0) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 14#thread3EXITtrue, 1442#true, 1392#(= (mod ~sum1~0 4294967296) (mod (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum3~0 ~sum2~0) 4294967296)), Black: 1576#(<= ~N~0 (+ 2 ~M~0)), Black: 1574#true, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 713#(= (mod ~sum1~0 4294967296) (mod (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum3~0 ~sum2~0) 4294967296)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 1293#true, 49#L85-1true, 752#true, 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 1156#true, Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2))]) [2022-12-06 07:46:09,936 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:46:09,936 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:09,936 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:09,936 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:10,122 INFO L130 PetriNetUnfolder]: 1813/4282 cut-off events. [2022-12-06 07:46:10,122 INFO L131 PetriNetUnfolder]: For 48500/49161 co-relation queries the response was YES. [2022-12-06 07:46:10,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28610 conditions, 4282 events. 1813/4282 cut-off events. For 48500/49161 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 39005 event pairs, 466 based on Foata normal form. 66/4029 useless extension candidates. Maximal degree in co-relation 28391. Up to 1682 conditions per place. [2022-12-06 07:46:10,171 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 447 transitions, 8536 flow [2022-12-06 07:46:10,171 INFO L188 LiptonReduction]: Number of co-enabled transitions 2592 [2022-12-06 07:46:10,172 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:46:10,173 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 598 [2022-12-06 07:46:10,173 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 447 transitions, 8536 flow [2022-12-06 07:46:10,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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) [2022-12-06 07:46:10,173 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:10,173 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:46:10,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-06 07:46:10,174 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:46:10,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:10,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1365416901, now seen corresponding path program 1 times [2022-12-06 07:46:10,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:10,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377792518] [2022-12-06 07:46:10,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:10,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:10,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:10,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:10,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377792518] [2022-12-06 07:46:10,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377792518] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:46:10,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:46:10,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:46:10,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803788901] [2022-12-06 07:46:10,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:46:10,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:46:10,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:10,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:46:10,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:46:10,239 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-06 07:46:10,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 447 transitions, 8536 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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) [2022-12-06 07:46:10,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:10,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-06 07:46:10,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:12,787 INFO L130 PetriNetUnfolder]: 9865/15229 cut-off events. [2022-12-06 07:46:12,787 INFO L131 PetriNetUnfolder]: For 232763/232763 co-relation queries the response was YES. [2022-12-06 07:46:12,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117380 conditions, 15229 events. 9865/15229 cut-off events. For 232763/232763 co-relation queries the response was YES. Maximal size of possible extension queue 859. Compared 102011 event pairs, 2031 based on Foata normal form. 130/15359 useless extension candidates. Maximal degree in co-relation 116407. Up to 6926 conditions per place. [2022-12-06 07:46:12,896 INFO L137 encePairwiseOnDemand]: 27/62 looper letters, 418 selfloop transitions, 190 changer transitions 10/618 dead transitions. [2022-12-06 07:46:12,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 618 transitions, 12475 flow [2022-12-06 07:46:12,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:46:12,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:46:12,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2022-12-06 07:46:12,898 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2880184331797235 [2022-12-06 07:46:12,898 INFO L175 Difference]: Start difference. First operand has 167 places, 447 transitions, 8536 flow. Second operand 7 states and 125 transitions. [2022-12-06 07:46:12,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 618 transitions, 12475 flow [2022-12-06 07:46:13,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 618 transitions, 12473 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-06 07:46:13,595 INFO L231 Difference]: Finished difference. Result has 177 places, 474 transitions, 9901 flow [2022-12-06 07:46:13,595 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=8489, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9901, PETRI_PLACES=177, PETRI_TRANSITIONS=474} [2022-12-06 07:46:13,595 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 147 predicate places. [2022-12-06 07:46:13,595 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:13,595 INFO L89 Accepts]: Start accepts. Operand has 177 places, 474 transitions, 9901 flow [2022-12-06 07:46:13,597 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:13,597 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:13,597 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 474 transitions, 9901 flow [2022-12-06 07:46:13,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 474 transitions, 9901 flow [2022-12-06 07:46:13,751 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([505] L64-5-->L64-5: Formula: (and (= (+ v_thread3Thread1of1ForFork0_~i~2_38 1) v_thread3Thread1of1ForFork0_~i~2_37) (= (+ v_~sum3~0_36 (select (select |v_#memory_int_131| v_~A~0.base_68) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_38) v_~A~0.offset_68))) v_~sum3~0_35) (< v_thread3Thread1of1ForFork0_~i~2_38 v_~N~0_69)) InVars {~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_38, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_36, ~N~0=v_~N~0_69} OutVars{~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_37, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_35, ~N~0=v_~N~0_69, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_21|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5][247], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), 60#L84-4true, Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), 101#L56-5true, Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 1006#true, Black: 1487#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 462#true, Black: 1477#(and (= ~A~0.offset 0) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 1442#true, 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 53#L64-5true, Black: 1576#(<= ~N~0 (+ 2 ~M~0)), Black: 1574#true, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1584#(<= 2 ~N~0), 12#L48-5true, Black: 1585#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 1591#(and (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1579#(and (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= ~N~0 (+ 2 ~M~0))), Black: 1593#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 622#true, Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 1293#true, 890#(<= 2 ~N~0), 752#true, Black: 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 403#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), 1303#true, Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 1156#true, Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2))]) [2022-12-06 07:46:13,751 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 07:46:13,751 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:46:13,751 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:46:13,751 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:13,751 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][245], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 60#L84-4true, Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), 101#L56-5true, Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), Black: 1487#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 462#true, Black: 153#true, Black: 1477#(and (= ~A~0.offset 0) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 14#thread3EXITtrue, 1442#true, 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1576#(<= ~N~0 (+ 2 ~M~0)), Black: 1574#true, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1584#(<= 2 ~N~0), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 1585#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 1591#(and (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), 1579#(and (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= ~N~0 (+ 2 ~M~0))), Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1593#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 622#true, 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 1293#true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), 1303#true, Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 1156#true, Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2))]) [2022-12-06 07:46:13,752 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 07:46:13,752 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:13,752 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:46:13,752 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:46:13,752 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([487] L56-5-->L56-5: Formula: (and (= (+ v_~sum2~0_38 (select (select |v_#memory_int_103| v_~A~0.base_50) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_40) v_~A~0.offset_50))) v_~sum2~0_37) (= (+ v_thread2Thread1of1ForFork2_~i~1_40 1) v_thread2Thread1of1ForFork2_~i~1_39) (< v_thread2Thread1of1ForFork2_~i~1_40 v_~M~0_37)) InVars {~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_40, ~A~0.offset=v_~A~0.offset_50, ~M~0=v_~M~0_37, #memory_int=|v_#memory_int_103|, ~sum2~0=v_~sum2~0_38} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_15|, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_39, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_23|, ~A~0.offset=v_~A~0.offset_50, ~M~0=v_~M~0_37, #memory_int=|v_#memory_int_103|, ~sum2~0=v_~sum2~0_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][38], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 60#L84-4true, Black: 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), 101#L56-5true, Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 1006#true, Black: 1487#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 462#true, Black: 1477#(and (= ~A~0.offset 0) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 1442#true, 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 53#L64-5true, Black: 1576#(<= ~N~0 (+ 2 ~M~0)), Black: 1574#true, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1584#(<= 2 ~N~0), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 1585#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 1591#(and (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 1593#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1579#(and (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= ~N~0 (+ 2 ~M~0))), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 622#true, Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 1293#true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 1303#true, Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 1156#true, Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2))]) [2022-12-06 07:46:13,752 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 07:46:13,752 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:13,752 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:46:13,752 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:46:13,787 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([505] L64-5-->L64-5: Formula: (and (= (+ v_thread3Thread1of1ForFork0_~i~2_38 1) v_thread3Thread1of1ForFork0_~i~2_37) (= (+ v_~sum3~0_36 (select (select |v_#memory_int_131| v_~A~0.base_68) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_38) v_~A~0.offset_68))) v_~sum3~0_35) (< v_thread3Thread1of1ForFork0_~i~2_38 v_~N~0_69)) InVars {~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_38, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_36, ~N~0=v_~N~0_69} OutVars{~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_37, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_35, ~N~0=v_~N~0_69, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_21|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5][247], [60#L84-4true, Black: 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), 101#L56-5true, Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 1006#true, 462#true, Black: 1487#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1477#(and (= ~A~0.offset 0) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 1442#true, 53#L64-5true, Black: 1576#(<= ~N~0 (+ 2 ~M~0)), Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1584#(<= 2 ~N~0), 12#L48-5true, Black: 1585#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 1591#(and (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1593#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 622#true, Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 1293#true, 890#(<= 2 ~N~0), 752#true, Black: 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 403#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), 1303#true, Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), 1574#true, Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 1156#true, Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0))]) [2022-12-06 07:46:13,787 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 07:46:13,787 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:13,787 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:13,787 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:13,787 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][324], [60#L84-4true, 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), 101#L56-5true, Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), 1577#(<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 462#true, Black: 153#true, Black: 1487#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1477#(and (= ~A~0.offset 0) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 14#thread3EXITtrue, 1442#true, Black: 1576#(<= ~N~0 (+ 2 ~M~0)), Black: 1574#true, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1584#(<= 2 ~N~0), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 1585#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 1591#(and (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1593#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 622#true, Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 1293#true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), 1303#true, Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 1156#true, Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))]) [2022-12-06 07:46:13,788 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 07:46:13,788 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:13,788 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:13,788 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:13,788 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([487] L56-5-->L56-5: Formula: (and (= (+ v_~sum2~0_38 (select (select |v_#memory_int_103| v_~A~0.base_50) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_40) v_~A~0.offset_50))) v_~sum2~0_37) (= (+ v_thread2Thread1of1ForFork2_~i~1_40 1) v_thread2Thread1of1ForFork2_~i~1_39) (< v_thread2Thread1of1ForFork2_~i~1_40 v_~M~0_37)) InVars {~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_40, ~A~0.offset=v_~A~0.offset_50, ~M~0=v_~M~0_37, #memory_int=|v_#memory_int_103|, ~sum2~0=v_~sum2~0_38} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_15|, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_39, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_23|, ~A~0.offset=v_~A~0.offset_50, ~M~0=v_~M~0_37, #memory_int=|v_#memory_int_103|, ~sum2~0=v_~sum2~0_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][38], [60#L84-4true, 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), 101#L56-5true, Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 1006#true, Black: 1487#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 462#true, Black: 1477#(and (= ~A~0.offset 0) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 1442#true, 53#L64-5true, Black: 1576#(<= ~N~0 (+ 2 ~M~0)), Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1584#(<= 2 ~N~0), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 1585#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 1591#(and (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 1593#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 622#true, Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 1293#true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), 1303#true, Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), 1574#true, Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 1156#true, Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2))]) [2022-12-06 07:46:13,788 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 07:46:13,788 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:13,788 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:13,788 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:13,853 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][245], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), 101#L56-5true, Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), Black: 1487#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 462#true, Black: 153#true, Black: 1477#(and (= ~A~0.offset 0) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 1442#true, 14#thread3EXITtrue, 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1576#(<= ~N~0 (+ 2 ~M~0)), Black: 1574#true, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1584#(<= 2 ~N~0), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 1585#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 1591#(and (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), 1579#(and (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= ~N~0 (+ 2 ~M~0))), Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1593#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 622#true, 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 1293#true, 49#L85-1true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), 1303#true, Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), 1156#true, Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))]) [2022-12-06 07:46:13,853 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 07:46:13,853 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:13,853 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:13,853 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:13,855 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([505] L64-5-->L64-5: Formula: (and (= (+ v_thread3Thread1of1ForFork0_~i~2_38 1) v_thread3Thread1of1ForFork0_~i~2_37) (= (+ v_~sum3~0_36 (select (select |v_#memory_int_131| v_~A~0.base_68) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_38) v_~A~0.offset_68))) v_~sum3~0_35) (< v_thread3Thread1of1ForFork0_~i~2_38 v_~N~0_69)) InVars {~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_38, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_36, ~N~0=v_~N~0_69} OutVars{~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_37, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_35, ~N~0=v_~N~0_69, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_21|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5][247], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), 60#L84-4true, Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), 101#L56-5true, Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 1006#true, Black: 1487#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 462#true, Black: 1477#(and (= ~A~0.offset 0) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 1442#true, 53#L64-5true, Black: 1576#(<= ~N~0 (+ 2 ~M~0)), Black: 1574#true, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1584#(<= 2 ~N~0), 12#L48-5true, Black: 1585#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 1591#(and (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1579#(and (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= ~N~0 (+ 2 ~M~0))), Black: 1593#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 622#true, Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 1293#true, 890#(<= 2 ~N~0), 752#true, Black: 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 403#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 1303#true, Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 1156#true, Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2))]) [2022-12-06 07:46:13,856 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:46:13,856 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:13,856 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:13,856 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:13,856 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][245], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 60#L84-4true, Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), 101#L56-5true, Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), Black: 1487#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 462#true, Black: 153#true, Black: 1477#(and (= ~A~0.offset 0) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 1442#true, 14#thread3EXITtrue, Black: 1576#(<= ~N~0 (+ 2 ~M~0)), Black: 1574#true, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 1584#(<= 2 ~N~0), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 1585#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 1591#(and (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1593#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), 1579#(and (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= ~N~0 (+ 2 ~M~0))), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 622#true, Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 1293#true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), 1303#true, Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 1156#true, Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2))]) [2022-12-06 07:46:13,856 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:46:13,856 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:13,856 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:13,856 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:13,856 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][245], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), 101#L56-5true, Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), Black: 153#true, Black: 1487#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 462#true, Black: 1477#(and (= ~A~0.offset 0) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 14#thread3EXITtrue, 1442#true, Black: 1576#(<= ~N~0 (+ 2 ~M~0)), Black: 1574#true, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 1584#(<= 2 ~N~0), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 1585#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 1591#(and (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1593#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), 1579#(and (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= ~N~0 (+ 2 ~M~0))), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 622#true, Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 1293#true, 49#L85-1true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), 1303#true, Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 1156#true, Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2))]) [2022-12-06 07:46:13,856 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:46:13,856 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:13,856 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:13,856 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:13,857 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([487] L56-5-->L56-5: Formula: (and (= (+ v_~sum2~0_38 (select (select |v_#memory_int_103| v_~A~0.base_50) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_40) v_~A~0.offset_50))) v_~sum2~0_37) (= (+ v_thread2Thread1of1ForFork2_~i~1_40 1) v_thread2Thread1of1ForFork2_~i~1_39) (< v_thread2Thread1of1ForFork2_~i~1_40 v_~M~0_37)) InVars {~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_40, ~A~0.offset=v_~A~0.offset_50, ~M~0=v_~M~0_37, #memory_int=|v_#memory_int_103|, ~sum2~0=v_~sum2~0_38} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_15|, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_39, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_23|, ~A~0.offset=v_~A~0.offset_50, ~M~0=v_~M~0_37, #memory_int=|v_#memory_int_103|, ~sum2~0=v_~sum2~0_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][38], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 60#L84-4true, Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), 101#L56-5true, Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 1006#true, Black: 1487#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 462#true, Black: 1477#(and (= ~A~0.offset 0) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 1442#true, 53#L64-5true, Black: 1576#(<= ~N~0 (+ 2 ~M~0)), Black: 1574#true, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1584#(<= 2 ~N~0), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 1585#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 1591#(and (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 1593#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1579#(and (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= ~N~0 (+ 2 ~M~0))), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 622#true, Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 1293#true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), 1303#true, Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), 1156#true, Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0))]) [2022-12-06 07:46:13,857 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:46:13,857 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:13,857 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:13,857 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:46:13,886 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][324], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), 101#L56-5true, Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), 1577#(<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 462#true, Black: 153#true, Black: 1487#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1477#(and (= ~A~0.offset 0) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 1442#true, 14#thread3EXITtrue, Black: 1576#(<= ~N~0 (+ 2 ~M~0)), Black: 1574#true, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1584#(<= 2 ~N~0), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 1585#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 1591#(and (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1593#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 622#true, Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 1293#true, 49#L85-1true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), 1303#true, Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 1156#true, 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))]) [2022-12-06 07:46:13,886 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:46:13,886 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:13,886 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:13,886 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:13,895 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][324], [408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), 101#L56-5true, Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), 1577#(<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 462#true, Black: 1487#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 153#true, Black: 1477#(and (= ~A~0.offset 0) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 1442#true, 14#thread3EXITtrue, Black: 1576#(<= ~N~0 (+ 2 ~M~0)), Black: 1574#true, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1584#(<= 2 ~N~0), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 1585#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 1591#(and (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1593#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 622#true, Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 49#L85-1true, 1293#true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), 1303#true, Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 1156#true, 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))]) [2022-12-06 07:46:13,895 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:46:13,895 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:13,895 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:13,895 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:13,895 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:13,927 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][245], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), 101#L56-5true, Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), Black: 1487#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 153#true, 462#true, Black: 1477#(and (= ~A~0.offset 0) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 14#thread3EXITtrue, 1442#true, 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1576#(<= ~N~0 (+ 2 ~M~0)), Black: 1574#true, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 1584#(<= 2 ~N~0), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 1585#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 1591#(and (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1593#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), 1579#(and (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= ~N~0 (+ 2 ~M~0))), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 622#true, 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 1293#true, 49#L85-1true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 1303#true, Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 1156#true, Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0))]) [2022-12-06 07:46:13,927 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is not cut-off event [2022-12-06 07:46:13,927 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2022-12-06 07:46:13,927 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2022-12-06 07:46:13,927 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2022-12-06 07:46:13,927 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2022-12-06 07:46:13,950 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][245], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 9#thread2EXITtrue, Black: 1487#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 153#true, 462#true, Black: 1477#(and (= ~A~0.offset 0) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 1442#true, 14#thread3EXITtrue, 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1576#(<= ~N~0 (+ 2 ~M~0)), Black: 1574#true, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1584#(<= 2 ~N~0), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 1585#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 1591#(and (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1593#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), 1579#(and (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= ~N~0 (+ 2 ~M~0))), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 622#true, 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 1293#true, 49#L85-1true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 1303#true, Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), 1156#true, Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2))]) [2022-12-06 07:46:13,950 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:46:13,950 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:13,950 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:13,950 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:13,954 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][245], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), 101#L56-5true, Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), Black: 1487#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 153#true, 462#true, Black: 1477#(and (= ~A~0.offset 0) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 1442#true, 14#thread3EXITtrue, Black: 1576#(<= ~N~0 (+ 2 ~M~0)), Black: 1574#true, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1584#(<= 2 ~N~0), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 1585#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 1591#(and (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1593#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), 1579#(and (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= ~N~0 (+ 2 ~M~0))), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 622#true, Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 1293#true, 49#L85-1true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), 1303#true, Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 1156#true, Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0))]) [2022-12-06 07:46:13,954 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:46:13,954 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:13,954 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:13,954 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:13,955 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:13,986 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][324], [408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), 1577#(<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 9#thread2EXITtrue, 462#true, Black: 153#true, Black: 1487#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1477#(and (= ~A~0.offset 0) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 14#thread3EXITtrue, 1442#true, Black: 1576#(<= ~N~0 (+ 2 ~M~0)), Black: 1574#true, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1584#(<= 2 ~N~0), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 1585#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 1591#(and (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1593#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 622#true, Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 49#L85-1true, 1293#true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), 1303#true, Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 1156#true, Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2))]) [2022-12-06 07:46:13,987 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:46:13,987 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:46:13,987 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:46:13,987 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:46:14,013 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][245], [Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 9#thread2EXITtrue, Black: 1487#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 462#true, Black: 153#true, Black: 1477#(and (= ~A~0.offset 0) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 1442#true, 14#thread3EXITtrue, Black: 1576#(<= ~N~0 (+ 2 ~M~0)), Black: 1574#true, Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1584#(<= 2 ~N~0), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 915#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0)), 12#L48-5true, Black: 1585#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 1591#(and (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), 1579#(and (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= ~N~0 (+ 2 ~M~0))), Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1593#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 189#(and (<= (+ ~M~0 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 622#true, Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 1293#true, 49#L85-1true, 752#true, Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), 1303#true, Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), 1156#true, Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))]) [2022-12-06 07:46:14,013 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:46:14,013 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:14,013 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:46:14,013 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:46:14,153 INFO L130 PetriNetUnfolder]: 2467/5648 cut-off events. [2022-12-06 07:46:14,153 INFO L131 PetriNetUnfolder]: For 76535/77633 co-relation queries the response was YES. [2022-12-06 07:46:14,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41517 conditions, 5648 events. 2467/5648 cut-off events. For 76535/77633 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 53055 event pairs, 696 based on Foata normal form. 84/5268 useless extension candidates. Maximal degree in co-relation 41304. Up to 2279 conditions per place. [2022-12-06 07:46:14,368 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 474 transitions, 9901 flow [2022-12-06 07:46:14,368 INFO L188 LiptonReduction]: Number of co-enabled transitions 2870 [2022-12-06 07:46:14,371 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:46:14,372 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 777 [2022-12-06 07:46:14,372 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 474 transitions, 9901 flow [2022-12-06 07:46:14,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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) [2022-12-06 07:46:14,372 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:14,372 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:46:14,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-06 07:46:14,372 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:46:14,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:14,373 INFO L85 PathProgramCache]: Analyzing trace with hash -2113293061, now seen corresponding path program 2 times [2022-12-06 07:46:14,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:14,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68307378] [2022-12-06 07:46:14,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:14,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:14,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:14,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:14,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68307378] [2022-12-06 07:46:14,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68307378] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:46:14,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:46:14,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:46:14,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8946798] [2022-12-06 07:46:14,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:46:14,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:46:14,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:14,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:46:14,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:46:14,451 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-06 07:46:14,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 474 transitions, 9901 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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) [2022-12-06 07:46:14,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:14,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-06 07:46:14,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:17,232 INFO L130 PetriNetUnfolder]: 9641/14929 cut-off events. [2022-12-06 07:46:17,232 INFO L131 PetriNetUnfolder]: For 278572/278572 co-relation queries the response was YES. [2022-12-06 07:46:17,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124364 conditions, 14929 events. 9641/14929 cut-off events. For 278572/278572 co-relation queries the response was YES. Maximal size of possible extension queue 864. Compared 99975 event pairs, 2716 based on Foata normal form. 132/15061 useless extension candidates. Maximal degree in co-relation 123376. Up to 9660 conditions per place. [2022-12-06 07:46:17,368 INFO L137 encePairwiseOnDemand]: 41/62 looper letters, 331 selfloop transitions, 259 changer transitions 0/590 dead transitions. [2022-12-06 07:46:17,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 590 transitions, 12878 flow [2022-12-06 07:46:17,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:46:17,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:46:17,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2022-12-06 07:46:17,369 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28763440860215056 [2022-12-06 07:46:17,370 INFO L175 Difference]: Start difference. First operand has 177 places, 474 transitions, 9901 flow. Second operand 6 states and 107 transitions. [2022-12-06 07:46:17,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 590 transitions, 12878 flow [2022-12-06 07:46:18,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 590 transitions, 12556 flow, removed 160 selfloop flow, removed 1 redundant places. [2022-12-06 07:46:18,348 INFO L231 Difference]: Finished difference. Result has 184 places, 511 transitions, 11297 flow [2022-12-06 07:46:18,348 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=9625, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=222, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=11297, PETRI_PLACES=184, PETRI_TRANSITIONS=511} [2022-12-06 07:46:18,349 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 154 predicate places. [2022-12-06 07:46:18,349 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:18,349 INFO L89 Accepts]: Start accepts. Operand has 184 places, 511 transitions, 11297 flow [2022-12-06 07:46:18,350 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:18,350 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:18,351 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 511 transitions, 11297 flow [2022-12-06 07:46:18,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 511 transitions, 11297 flow [2022-12-06 07:46:18,980 INFO L130 PetriNetUnfolder]: 2338/5517 cut-off events. [2022-12-06 07:46:18,981 INFO L131 PetriNetUnfolder]: For 84345/85004 co-relation queries the response was YES. [2022-12-06 07:46:19,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41250 conditions, 5517 events. 2338/5517 cut-off events. For 84345/85004 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 52660 event pairs, 695 based on Foata normal form. 76/5204 useless extension candidates. Maximal degree in co-relation 40970. Up to 2163 conditions per place. [2022-12-06 07:46:19,054 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 511 transitions, 11297 flow [2022-12-06 07:46:19,054 INFO L188 LiptonReduction]: Number of co-enabled transitions 3006 [2022-12-06 07:46:19,068 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [487] L56-5-->L56-5: Formula: (and (= (+ v_~sum2~0_38 (select (select |v_#memory_int_103| v_~A~0.base_50) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_40) v_~A~0.offset_50))) v_~sum2~0_37) (= (+ v_thread2Thread1of1ForFork2_~i~1_40 1) v_thread2Thread1of1ForFork2_~i~1_39) (< v_thread2Thread1of1ForFork2_~i~1_40 v_~M~0_37)) InVars {~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_40, ~A~0.offset=v_~A~0.offset_50, ~M~0=v_~M~0_37, #memory_int=|v_#memory_int_103|, ~sum2~0=v_~sum2~0_38} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_15|, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_39, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_23|, ~A~0.offset=v_~A~0.offset_50, ~M~0=v_~M~0_37, #memory_int=|v_#memory_int_103|, ~sum2~0=v_~sum2~0_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0] and [505] L64-5-->L64-5: Formula: (and (= (+ v_thread3Thread1of1ForFork0_~i~2_38 1) v_thread3Thread1of1ForFork0_~i~2_37) (= (+ v_~sum3~0_36 (select (select |v_#memory_int_131| v_~A~0.base_68) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_38) v_~A~0.offset_68))) v_~sum3~0_35) (< v_thread3Thread1of1ForFork0_~i~2_38 v_~N~0_69)) InVars {~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_38, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_36, ~N~0=v_~N~0_69} OutVars{~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_37, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_35, ~N~0=v_~N~0_69, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_21|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5] [2022-12-06 07:46:19,108 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:46:19,108 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 759 [2022-12-06 07:46:19,108 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 511 transitions, 11309 flow [2022-12-06 07:46:19,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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) [2022-12-06 07:46:19,109 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:19,109 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:46:19,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-06 07:46:19,109 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:46:19,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:19,109 INFO L85 PathProgramCache]: Analyzing trace with hash -2087893831, now seen corresponding path program 3 times [2022-12-06 07:46:19,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:19,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838126951] [2022-12-06 07:46:19,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:19,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:19,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:19,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:19,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838126951] [2022-12-06 07:46:19,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838126951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:46:19,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:46:19,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:46:19,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993514539] [2022-12-06 07:46:19,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:46:19,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:46:19,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:19,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:46:19,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:46:19,171 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-06 07:46:19,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 511 transitions, 11309 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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) [2022-12-06 07:46:19,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:19,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-06 07:46:19,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:21,795 INFO L130 PetriNetUnfolder]: 9470/14544 cut-off events. [2022-12-06 07:46:21,795 INFO L131 PetriNetUnfolder]: For 308323/308323 co-relation queries the response was YES. [2022-12-06 07:46:21,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125926 conditions, 14544 events. 9470/14544 cut-off events. For 308323/308323 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 95029 event pairs, 2655 based on Foata normal form. 126/14670 useless extension candidates. Maximal degree in co-relation 124933. Up to 9660 conditions per place. [2022-12-06 07:46:21,917 INFO L137 encePairwiseOnDemand]: 41/63 looper letters, 339 selfloop transitions, 268 changer transitions 0/607 dead transitions. [2022-12-06 07:46:21,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 607 transitions, 13959 flow [2022-12-06 07:46:21,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:46:21,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:46:21,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-12-06 07:46:21,918 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2751322751322751 [2022-12-06 07:46:21,918 INFO L175 Difference]: Start difference. First operand has 184 places, 511 transitions, 11309 flow. Second operand 6 states and 104 transitions. [2022-12-06 07:46:21,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 607 transitions, 13959 flow [2022-12-06 07:46:23,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 607 transitions, 13586 flow, removed 96 selfloop flow, removed 3 redundant places. [2022-12-06 07:46:23,049 INFO L231 Difference]: Finished difference. Result has 188 places, 523 transitions, 12048 flow [2022-12-06 07:46:23,049 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=10923, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=252, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12048, PETRI_PLACES=188, PETRI_TRANSITIONS=523} [2022-12-06 07:46:23,050 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 158 predicate places. [2022-12-06 07:46:23,050 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:23,050 INFO L89 Accepts]: Start accepts. Operand has 188 places, 523 transitions, 12048 flow [2022-12-06 07:46:23,052 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:23,052 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:23,052 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 188 places, 523 transitions, 12048 flow [2022-12-06 07:46:23,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 188 places, 523 transitions, 12048 flow [2022-12-06 07:46:23,446 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([505] L64-5-->L64-5: Formula: (and (= (+ v_thread3Thread1of1ForFork0_~i~2_38 1) v_thread3Thread1of1ForFork0_~i~2_37) (= (+ v_~sum3~0_36 (select (select |v_#memory_int_131| v_~A~0.base_68) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_38) v_~A~0.offset_68))) v_~sum3~0_35) (< v_thread3Thread1of1ForFork0_~i~2_38 v_~N~0_69)) InVars {~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_38, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_36, ~N~0=v_~N~0_69} OutVars{~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_37, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_35, ~N~0=v_~N~0_69, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_21|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5][361], [Black: 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 60#L84-4true, Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 9#thread2EXITtrue, 1006#true, Black: 1487#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 462#true, Black: 1477#(and (= ~A~0.offset 0) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 1442#true, 53#L64-5true, Black: 1576#(<= ~N~0 (+ 2 ~M~0)), Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 12#L48-5true, Black: 1584#(<= 2 ~N~0), Black: 1585#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 1593#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1605#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 ~N~0)), Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1607#(and (<= 2 ~M~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 ~N~0)), 622#true, Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 1620#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 ~N~0)), Black: 1618#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 ~N~0)), 1591#(and (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), 1293#true, 890#(<= 2 ~N~0), 752#true, Black: 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), 1601#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 403#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 1303#true, Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), 1614#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), 1574#true, Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), Black: 1134#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (< 1 ~N~0) (or (<= (+ ~M~0 1) 0) (< 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)))), 1156#true, Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2))]) [2022-12-06 07:46:23,446 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:46:23,446 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:23,446 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:23,446 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:23,709 INFO L130 PetriNetUnfolder]: 2314/5298 cut-off events. [2022-12-06 07:46:23,709 INFO L131 PetriNetUnfolder]: For 82092/82827 co-relation queries the response was YES. [2022-12-06 07:46:23,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40134 conditions, 5298 events. 2314/5298 cut-off events. For 82092/82827 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 49079 event pairs, 655 based on Foata normal form. 99/5015 useless extension candidates. Maximal degree in co-relation 39857. Up to 2045 conditions per place. [2022-12-06 07:46:23,798 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 188 places, 523 transitions, 12048 flow [2022-12-06 07:46:23,798 INFO L188 LiptonReduction]: Number of co-enabled transitions 3072 [2022-12-06 07:46:23,801 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:46:23,802 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 752 [2022-12-06 07:46:23,802 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 523 transitions, 12048 flow [2022-12-06 07:46:23,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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) [2022-12-06 07:46:23,802 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:23,802 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:46:23,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-06 07:46:23,802 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:46:23,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:23,803 INFO L85 PathProgramCache]: Analyzing trace with hash -599884874, now seen corresponding path program 1 times [2022-12-06 07:46:23,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:23,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249425792] [2022-12-06 07:46:23,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:23,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:24,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:24,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:24,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249425792] [2022-12-06 07:46:24,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249425792] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:46:24,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460721234] [2022-12-06 07:46:24,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:24,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:46:24,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:46:24,320 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:46:24,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 07:46:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:24,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-06 07:46:24,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:46:24,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:46:24,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 07:46:24,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:46:24,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:46:24,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:46:24,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-06 07:46:24,702 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 07:46:24,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:46:24,706 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:46:24,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 15 [2022-12-06 07:46:24,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:24,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:46:25,112 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_1428 (Array Int Int)) (v_thread3Thread1of1ForFork0_~i~2_216 Int) (v_ArrVal_1429 (Array Int Int))) (or (not (< v_thread3Thread1of1ForFork0_~i~2_216 c_~N~0)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1428))) (let ((.cse4 (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1429) c_~A~0.base))) (let ((.cse2 (select .cse4 c_~A~0.offset)) (.cse3 (select .cse4 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_216 4)))) (.cse0 (select (select .cse6 c_~A~0.base) c_~A~0.offset)) (.cse1 (select .cse4 .cse5))) (<= (+ .cse0 c_~sum1~0 .cse1 (* (div (+ .cse2 c_~sum3~0 c_~sum2~0 .cse3) 4294967296) 4294967296)) (+ .cse2 c_~sum3~0 c_~sum2~0 .cse3 (* 4294967296 (div (+ .cse0 c_~sum1~0 .cse1) 4294967296))))))) (< v_thread3Thread1of1ForFork0_~i~2_216 1))) (forall ((v_ArrVal_1428 (Array Int Int)) (v_thread3Thread1of1ForFork0_~i~2_216 Int) (v_ArrVal_1429 (Array Int Int))) (or (not (< v_thread3Thread1of1ForFork0_~i~2_216 c_~N~0)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1428))) (let ((.cse11 (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1429) c_~A~0.base))) (let ((.cse9 (select (select .cse12 c_~A~0.base) c_~A~0.offset)) (.cse10 (select .cse11 .cse5)) (.cse7 (select .cse11 c_~A~0.offset)) (.cse8 (select .cse11 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_216 4))))) (< (+ .cse7 c_~sum3~0 c_~sum2~0 .cse8 (* 4294967296 (div (+ .cse9 c_~sum1~0 .cse10) 4294967296))) (+ .cse9 c_~sum1~0 .cse10 (* (div (+ .cse7 c_~sum3~0 c_~sum2~0 .cse8) 4294967296) 4294967296) 1))))) (< v_thread3Thread1of1ForFork0_~i~2_216 1))))) is different from false [2022-12-06 07:46:25,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:25,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460721234] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:46:25,142 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:46:25,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 07:46:25,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549652523] [2022-12-06 07:46:25,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:46:25,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 07:46:25,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:25,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 07:46:25,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=166, Unknown=1, NotChecked=26, Total=240 [2022-12-06 07:46:25,143 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-06 07:46:25,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 523 transitions, 12048 flow. Second operand has 16 states, 15 states have (on average 3.2) internal successors, (48), 15 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) [2022-12-06 07:46:25,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:25,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-06 07:46:25,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:31,237 INFO L130 PetriNetUnfolder]: 9679/14874 cut-off events. [2022-12-06 07:46:31,237 INFO L131 PetriNetUnfolder]: For 313284/313284 co-relation queries the response was YES. [2022-12-06 07:46:31,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129314 conditions, 14874 events. 9679/14874 cut-off events. For 313284/313284 co-relation queries the response was YES. Maximal size of possible extension queue 861. Compared 98034 event pairs, 2276 based on Foata normal form. 2/14876 useless extension candidates. Maximal degree in co-relation 128220. Up to 12070 conditions per place. [2022-12-06 07:46:31,363 INFO L137 encePairwiseOnDemand]: 19/63 looper letters, 409 selfloop transitions, 243 changer transitions 9/661 dead transitions. [2022-12-06 07:46:31,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 661 transitions, 14969 flow [2022-12-06 07:46:31,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 07:46:31,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 07:46:31,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 196 transitions. [2022-12-06 07:46:31,365 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19444444444444445 [2022-12-06 07:46:31,365 INFO L175 Difference]: Start difference. First operand has 188 places, 523 transitions, 12048 flow. Second operand 16 states and 196 transitions. [2022-12-06 07:46:31,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 661 transitions, 14969 flow [2022-12-06 07:46:32,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 661 transitions, 14556 flow, removed 26 selfloop flow, removed 3 redundant places. [2022-12-06 07:46:32,332 INFO L231 Difference]: Finished difference. Result has 205 places, 553 transitions, 12967 flow [2022-12-06 07:46:32,333 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=11677, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=523, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=216, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=12967, PETRI_PLACES=205, PETRI_TRANSITIONS=553} [2022-12-06 07:46:32,333 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 175 predicate places. [2022-12-06 07:46:32,333 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:32,333 INFO L89 Accepts]: Start accepts. Operand has 205 places, 553 transitions, 12967 flow [2022-12-06 07:46:32,336 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:32,336 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:32,336 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 553 transitions, 12967 flow [2022-12-06 07:46:32,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 553 transitions, 12967 flow [2022-12-06 07:46:33,049 INFO L130 PetriNetUnfolder]: 2306/5324 cut-off events. [2022-12-06 07:46:33,049 INFO L131 PetriNetUnfolder]: For 89059/89723 co-relation queries the response was YES. [2022-12-06 07:46:33,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41332 conditions, 5324 events. 2306/5324 cut-off events. For 89059/89723 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 49778 event pairs, 677 based on Foata normal form. 73/5023 useless extension candidates. Maximal degree in co-relation 41025. Up to 2079 conditions per place. [2022-12-06 07:46:33,125 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 553 transitions, 12967 flow [2022-12-06 07:46:33,126 INFO L188 LiptonReduction]: Number of co-enabled transitions 3272 [2022-12-06 07:46:33,190 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] $Ultimate##0-->L56-5: Formula: (let ((.cse0 (select |v_#memory_int_282| v_~A~0.base_183))) (and (< v_thread1Thread1of1ForFork1_~i~0_113 (+ v_~N~0_171 1)) (< 0 v_~M~0_129) (= v_~sum1~0_199 (+ v_~sum1~0_200 (select .cse0 (+ (* v_thread1Thread1of1ForFork1_~i~0_113 4) v_~A~0.offset_183 (- 4))))) (= (+ (select .cse0 v_~A~0.offset_183) v_~sum2~0_124) v_~sum2~0_123) (= v_thread2Thread1of1ForFork2_~i~1_97 1) (= v_thread1Thread1of1ForFork1_~i~0_113 1))) InVars {~A~0.base=v_~A~0.base_183, ~A~0.offset=v_~A~0.offset_183, ~M~0=v_~M~0_129, ~sum1~0=v_~sum1~0_200, #memory_int=|v_#memory_int_282|, ~sum2~0=v_~sum2~0_124, ~N~0=v_~N~0_171} OutVars{~A~0.base=v_~A~0.base_183, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_113, ~sum2~0=v_~sum2~0_123, ~N~0=v_~N~0_171, thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_45|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_97, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_53|, ~A~0.offset=v_~A~0.offset_183, ~M~0=v_~M~0_129, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_95|, ~sum1~0=v_~sum1~0_199, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_87|, #memory_int=|v_#memory_int_282|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~sum2~0] and [503] L48-5-->L48-5: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_36 v_~N~0_63) (= v_thread1Thread1of1ForFork1_~i~0_35 (+ v_thread1Thread1of1ForFork1_~i~0_36 1)) (= v_~sum1~0_53 (+ v_~sum1~0_54 (select (select |v_#memory_int_127| v_~A~0.base_64) (+ (* v_thread1Thread1of1ForFork1_~i~0_36 4) v_~A~0.offset_64))))) InVars {~A~0.base=v_~A~0.base_64, ~A~0.offset=v_~A~0.offset_64, ~sum1~0=v_~sum1~0_54, #memory_int=|v_#memory_int_127|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_36, ~N~0=v_~N~0_63} OutVars{~A~0.base=v_~A~0.base_64, ~A~0.offset=v_~A~0.offset_64, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_27|, ~sum1~0=v_~sum1~0_53, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, #memory_int=|v_#memory_int_127|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, ~N~0=v_~N~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] [2022-12-06 07:46:33,280 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [528] $Ultimate##0-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_45 v_~N~0_85)) (= 0 |v_thread3Thread1of1ForFork0_#res.base_13|) (= |v_thread3Thread1of1ForFork0_#res.offset_13| 0) (= v_thread3Thread1of1ForFork0_~i~2_45 v_~M~0_77)) InVars {~M~0=v_~M~0_77, ~N~0=v_~N~0_85} OutVars{~M~0=v_~M~0_77, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_13|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_45, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_13|, ~N~0=v_~N~0_85} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#res.base] and [570] $Ultimate##0-->L48-5: Formula: (and (= (let ((.cse0 (select |v_#memory_int_280| v_~A~0.base_181)) (.cse1 (* v_thread1Thread1of1ForFork1_~i~0_109 4))) (+ v_~sum1~0_195 (select .cse0 (+ .cse1 v_~A~0.offset_181 (- 4))) (select .cse0 (+ .cse1 v_~A~0.offset_181 (- 8))))) v_~sum1~0_193) (= 2 v_thread1Thread1of1ForFork1_~i~0_109) (< v_thread1Thread1of1ForFork1_~i~0_109 (+ v_~N~0_169 1))) InVars {~A~0.base=v_~A~0.base_181, ~A~0.offset=v_~A~0.offset_181, ~sum1~0=v_~sum1~0_195, #memory_int=|v_#memory_int_280|, ~N~0=v_~N~0_169} OutVars{~A~0.base=v_~A~0.base_181, ~A~0.offset=v_~A~0.offset_181, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_91|, ~sum1~0=v_~sum1~0_193, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_83|, #memory_int=|v_#memory_int_280|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_109, ~N~0=v_~N~0_169} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] [2022-12-06 07:46:33,331 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [528] $Ultimate##0-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_45 v_~N~0_85)) (= 0 |v_thread3Thread1of1ForFork0_#res.base_13|) (= |v_thread3Thread1of1ForFork0_#res.offset_13| 0) (= v_thread3Thread1of1ForFork0_~i~2_45 v_~M~0_77)) InVars {~M~0=v_~M~0_77, ~N~0=v_~N~0_85} OutVars{~M~0=v_~M~0_77, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_13|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_45, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_13|, ~N~0=v_~N~0_85} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#res.base] and [571] $Ultimate##0-->L56-5: Formula: (let ((.cse0 (select |v_#memory_int_282| v_~A~0.base_183))) (and (< v_thread1Thread1of1ForFork1_~i~0_113 (+ v_~N~0_171 1)) (< 0 v_~M~0_129) (= v_~sum1~0_199 (+ v_~sum1~0_200 (select .cse0 (+ (* v_thread1Thread1of1ForFork1_~i~0_113 4) v_~A~0.offset_183 (- 4))))) (= (+ (select .cse0 v_~A~0.offset_183) v_~sum2~0_124) v_~sum2~0_123) (= v_thread2Thread1of1ForFork2_~i~1_97 1) (= v_thread1Thread1of1ForFork1_~i~0_113 1))) InVars {~A~0.base=v_~A~0.base_183, ~A~0.offset=v_~A~0.offset_183, ~M~0=v_~M~0_129, ~sum1~0=v_~sum1~0_200, #memory_int=|v_#memory_int_282|, ~sum2~0=v_~sum2~0_124, ~N~0=v_~N~0_171} OutVars{~A~0.base=v_~A~0.base_183, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_113, ~sum2~0=v_~sum2~0_123, ~N~0=v_~N~0_171, thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_45|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_97, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_53|, ~A~0.offset=v_~A~0.offset_183, ~M~0=v_~M~0_129, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_95|, ~sum1~0=v_~sum1~0_199, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_87|, #memory_int=|v_#memory_int_282|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~sum2~0] [2022-12-06 07:46:33,407 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [528] $Ultimate##0-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_45 v_~N~0_85)) (= 0 |v_thread3Thread1of1ForFork0_#res.base_13|) (= |v_thread3Thread1of1ForFork0_#res.offset_13| 0) (= v_thread3Thread1of1ForFork0_~i~2_45 v_~M~0_77)) InVars {~M~0=v_~M~0_77, ~N~0=v_~N~0_85} OutVars{~M~0=v_~M~0_77, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_13|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_45, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_13|, ~N~0=v_~N~0_85} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#res.base] and [525] $Ultimate##0-->L56-5: Formula: (and (< v_thread2Thread1of1ForFork2_~i~1_49 (+ 1 v_~M~0_71)) (= (+ v_~sum2~0_68 (select (select |v_#memory_int_159| v_~A~0.base_88) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_49) (- 4) v_~A~0.offset_88))) v_~sum2~0_67) (= v_thread2Thread1of1ForFork2_~i~1_49 1)) InVars {~A~0.base=v_~A~0.base_88, ~A~0.offset=v_~A~0.offset_88, ~M~0=v_~M~0_71, #memory_int=|v_#memory_int_159|, ~sum2~0=v_~sum2~0_68} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_19|, ~A~0.base=v_~A~0.base_88, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_49, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_27|, ~A~0.offset=v_~A~0.offset_88, ~M~0=v_~M~0_71, #memory_int=|v_#memory_int_159|, ~sum2~0=v_~sum2~0_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0] [2022-12-06 07:46:33,444 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [528] $Ultimate##0-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_45 v_~N~0_85)) (= 0 |v_thread3Thread1of1ForFork0_#res.base_13|) (= |v_thread3Thread1of1ForFork0_#res.offset_13| 0) (= v_thread3Thread1of1ForFork0_~i~2_45 v_~M~0_77)) InVars {~M~0=v_~M~0_77, ~N~0=v_~N~0_85} OutVars{~M~0=v_~M~0_77, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_13|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_45, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_13|, ~N~0=v_~N~0_85} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#res.base] and [593] $Ultimate##0-->L56-5: Formula: (let ((.cse0 (select |v_#memory_int_353| v_~A~0.base_227))) (and (= v_thread2Thread1of1ForFork2_~i~1_159 2) (= (+ (select .cse0 (+ (* v_thread2Thread1of1ForFork2_~i~1_159 4) v_~A~0.offset_227 (- 4))) v_~sum2~0_177 (select .cse0 v_~A~0.offset_227)) v_~sum2~0_175) (= v_thread1Thread1of1ForFork1_~i~0_181 1) (< v_thread1Thread1of1ForFork1_~i~0_181 (+ v_~N~0_213 1)) (= (+ v_~sum1~0_304 (select .cse0 (+ (* v_thread1Thread1of1ForFork1_~i~0_181 4) v_~A~0.offset_227 (- 4)))) v_~sum1~0_303) (< v_thread2Thread1of1ForFork2_~i~1_159 (+ v_~M~0_169 1)))) InVars {~A~0.base=v_~A~0.base_227, ~A~0.offset=v_~A~0.offset_227, ~M~0=v_~M~0_169, ~sum1~0=v_~sum1~0_304, #memory_int=|v_#memory_int_353|, ~sum2~0=v_~sum2~0_177, ~N~0=v_~N~0_213} OutVars{~A~0.base=v_~A~0.base_227, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_181, ~sum2~0=v_~sum2~0_175, ~N~0=v_~N~0_213, thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_79|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_159, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_87|, ~A~0.offset=v_~A~0.offset_227, ~M~0=v_~M~0_169, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_159|, ~sum1~0=v_~sum1~0_303, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_151|, #memory_int=|v_#memory_int_353|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~sum2~0] [2022-12-06 07:46:33,527 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [528] $Ultimate##0-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_45 v_~N~0_85)) (= 0 |v_thread3Thread1of1ForFork0_#res.base_13|) (= |v_thread3Thread1of1ForFork0_#res.offset_13| 0) (= v_thread3Thread1of1ForFork0_~i~2_45 v_~M~0_77)) InVars {~M~0=v_~M~0_77, ~N~0=v_~N~0_85} OutVars{~M~0=v_~M~0_77, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_13|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_45, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_13|, ~N~0=v_~N~0_85} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#res.base] and [594] $Ultimate##0-->L48-5: Formula: (let ((.cse0 (select |v_#memory_int_355| v_~A~0.base_229))) (and (= (+ (select .cse0 v_~A~0.offset_229) v_~sum2~0_182) v_~sum2~0_181) (= v_~sum1~0_307 (let ((.cse1 (* v_thread1Thread1of1ForFork1_~i~0_183 4))) (+ v_~sum1~0_309 (select .cse0 (+ v_~A~0.offset_229 .cse1 (- 8))) (select .cse0 (+ v_~A~0.offset_229 (- 4) .cse1))))) (< v_thread1Thread1of1ForFork1_~i~0_183 (+ v_~N~0_215 1)) (= v_thread2Thread1of1ForFork2_~i~1_163 1) (< 0 v_~M~0_171) (= 2 v_thread1Thread1of1ForFork1_~i~0_183))) InVars {~A~0.base=v_~A~0.base_229, ~A~0.offset=v_~A~0.offset_229, ~sum1~0=v_~sum1~0_309, ~M~0=v_~M~0_171, #memory_int=|v_#memory_int_355|, ~sum2~0=v_~sum2~0_182, ~N~0=v_~N~0_215} OutVars{~A~0.base=v_~A~0.base_229, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_183, ~sum2~0=v_~sum2~0_181, ~N~0=v_~N~0_215, thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_83|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_163, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_91|, ~A~0.offset=v_~A~0.offset_229, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_161|, ~sum1~0=v_~sum1~0_307, ~M~0=v_~M~0_171, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_153|, #memory_int=|v_#memory_int_355|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~sum2~0] [2022-12-06 07:46:33,755 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [528] $Ultimate##0-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_45 v_~N~0_85)) (= 0 |v_thread3Thread1of1ForFork0_#res.base_13|) (= |v_thread3Thread1of1ForFork0_#res.offset_13| 0) (= v_thread3Thread1of1ForFork0_~i~2_45 v_~M~0_77)) InVars {~M~0=v_~M~0_77, ~N~0=v_~N~0_85} OutVars{~M~0=v_~M~0_77, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_13|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_45, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_13|, ~N~0=v_~N~0_85} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#res.base] and [523] $Ultimate##0-->L56-5: Formula: (and (= (+ v_~sum2~0_64 (select (select |v_#memory_int_157| v_~A~0.base_86) v_~A~0.offset_86)) v_~sum2~0_63) (= v_thread2Thread1of1ForFork2_~i~1_43 1) (< 0 v_~M~0_67)) InVars {~A~0.base=v_~A~0.base_86, ~A~0.offset=v_~A~0.offset_86, ~M~0=v_~M~0_67, #memory_int=|v_#memory_int_157|, ~sum2~0=v_~sum2~0_64} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_86, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_43, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_25|, ~A~0.offset=v_~A~0.offset_86, ~M~0=v_~M~0_67, #memory_int=|v_#memory_int_157|, ~sum2~0=v_~sum2~0_63} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0] [2022-12-06 07:46:33,802 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [526] $Ultimate##0-->L56-5: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_53 1) (= v_thread3Thread1of1ForFork0_~i~2_41 v_~M~0_73) (= (+ v_~sum2~0_72 (select (select |v_#memory_int_161| v_~A~0.base_90) v_~A~0.offset_90)) v_~sum2~0_71) (< 0 v_~M~0_73)) InVars {~A~0.base=v_~A~0.base_90, ~A~0.offset=v_~A~0.offset_90, ~M~0=v_~M~0_73, #memory_int=|v_#memory_int_161|, ~sum2~0=v_~sum2~0_72} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_21|, ~A~0.base=v_~A~0.base_90, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_53, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_29|, ~A~0.offset=v_~A~0.offset_90, ~M~0=v_~M~0_73, #memory_int=|v_#memory_int_161|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_41, ~sum2~0=v_~sum2~0_71} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, thread3Thread1of1ForFork0_~i~2, ~sum2~0] and [600] L64-5-->L56-5: Formula: (and (= v_~sum2~0_201 (let ((.cse0 (select |v_#memory_int_367| v_~A~0.base_241))) (+ (select .cse0 (+ v_~A~0.offset_241 (* v_thread2Thread1of1ForFork2_~i~1_175 4))) (select .cse0 (+ (* v_thread2Thread1of1ForFork2_~i~1_173 4) v_~A~0.offset_241 (- 4))) v_~sum2~0_203))) (not (< v_thread3Thread1of1ForFork0_~i~2_228 v_~N~0_227)) (= v_thread2Thread1of1ForFork2_~i~1_173 (+ v_thread2Thread1of1ForFork2_~i~1_175 2)) (= 0 |v_thread3Thread1of1ForFork0_#res.base_65|) (< v_thread2Thread1of1ForFork2_~i~1_173 (+ v_~M~0_183 1)) (= |v_thread3Thread1of1ForFork0_#res.offset_65| 0)) InVars {~A~0.base=v_~A~0.base_241, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_175, ~A~0.offset=v_~A~0.offset_241, ~M~0=v_~M~0_183, #memory_int=|v_#memory_int_367|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_228, ~sum2~0=v_~sum2~0_203, ~N~0=v_~N~0_227} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_93|, ~A~0.base=v_~A~0.base_241, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_173, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_101|, ~A~0.offset=v_~A~0.offset_241, ~M~0=v_~M~0_183, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_65|, #memory_int=|v_#memory_int_367|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_228, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_65|, ~sum2~0=v_~sum2~0_201, ~N~0=v_~N~0_227} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base, ~sum2~0] [2022-12-06 07:46:33,904 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [526] $Ultimate##0-->L56-5: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_53 1) (= v_thread3Thread1of1ForFork0_~i~2_41 v_~M~0_73) (= (+ v_~sum2~0_72 (select (select |v_#memory_int_161| v_~A~0.base_90) v_~A~0.offset_90)) v_~sum2~0_71) (< 0 v_~M~0_73)) InVars {~A~0.base=v_~A~0.base_90, ~A~0.offset=v_~A~0.offset_90, ~M~0=v_~M~0_73, #memory_int=|v_#memory_int_161|, ~sum2~0=v_~sum2~0_72} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_21|, ~A~0.base=v_~A~0.base_90, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_53, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_29|, ~A~0.offset=v_~A~0.offset_90, ~M~0=v_~M~0_73, #memory_int=|v_#memory_int_161|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_41, ~sum2~0=v_~sum2~0_71} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, thread3Thread1of1ForFork0_~i~2, ~sum2~0] and [505] L64-5-->L64-5: Formula: (and (= (+ v_thread3Thread1of1ForFork0_~i~2_38 1) v_thread3Thread1of1ForFork0_~i~2_37) (= (+ v_~sum3~0_36 (select (select |v_#memory_int_131| v_~A~0.base_68) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_38) v_~A~0.offset_68))) v_~sum3~0_35) (< v_thread3Thread1of1ForFork0_~i~2_38 v_~N~0_69)) InVars {~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_38, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_36, ~N~0=v_~N~0_69} OutVars{~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_37, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_35, ~N~0=v_~N~0_69, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_21|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5] [2022-12-06 07:46:34,047 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [505] L64-5-->L64-5: Formula: (and (= (+ v_thread3Thread1of1ForFork0_~i~2_38 1) v_thread3Thread1of1ForFork0_~i~2_37) (= (+ v_~sum3~0_36 (select (select |v_#memory_int_131| v_~A~0.base_68) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_38) v_~A~0.offset_68))) v_~sum3~0_35) (< v_thread3Thread1of1ForFork0_~i~2_38 v_~N~0_69)) InVars {~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_38, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_36, ~N~0=v_~N~0_69} OutVars{~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_37, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_35, ~N~0=v_~N~0_69, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_21|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5] and [487] L56-5-->L56-5: Formula: (and (= (+ v_~sum2~0_38 (select (select |v_#memory_int_103| v_~A~0.base_50) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_40) v_~A~0.offset_50))) v_~sum2~0_37) (= (+ v_thread2Thread1of1ForFork2_~i~1_40 1) v_thread2Thread1of1ForFork2_~i~1_39) (< v_thread2Thread1of1ForFork2_~i~1_40 v_~M~0_37)) InVars {~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_40, ~A~0.offset=v_~A~0.offset_50, ~M~0=v_~M~0_37, #memory_int=|v_#memory_int_103|, ~sum2~0=v_~sum2~0_38} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_15|, ~A~0.base=v_~A~0.base_50, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_39, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_23|, ~A~0.offset=v_~A~0.offset_50, ~M~0=v_~M~0_37, #memory_int=|v_#memory_int_103|, ~sum2~0=v_~sum2~0_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0] [2022-12-06 07:46:34,121 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 07:46:34,122 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1789 [2022-12-06 07:46:34,122 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 550 transitions, 13175 flow [2022-12-06 07:46:34,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 15 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) [2022-12-06 07:46:34,122 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:34,122 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:46:34,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 07:46:34,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-12-06 07:46:34,323 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:46:34,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:34,324 INFO L85 PathProgramCache]: Analyzing trace with hash -155997382, now seen corresponding path program 1 times [2022-12-06 07:46:34,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:34,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856754240] [2022-12-06 07:46:34,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:34,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:34,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:34,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:34,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856754240] [2022-12-06 07:46:34,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856754240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:46:34,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:46:34,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:46:34,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266502648] [2022-12-06 07:46:34,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:46:34,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:46:34,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:34,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:46:34,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:46:34,388 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 74 [2022-12-06 07:46:34,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 550 transitions, 13175 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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) [2022-12-06 07:46:34,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:34,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 74 [2022-12-06 07:46:34,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:37,162 INFO L130 PetriNetUnfolder]: 9728/14964 cut-off events. [2022-12-06 07:46:37,162 INFO L131 PetriNetUnfolder]: For 339816/339816 co-relation queries the response was YES. [2022-12-06 07:46:37,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132352 conditions, 14964 events. 9728/14964 cut-off events. For 339816/339816 co-relation queries the response was YES. Maximal size of possible extension queue 850. Compared 98300 event pairs, 4268 based on Foata normal form. 6/14970 useless extension candidates. Maximal degree in co-relation 131063. Up to 10449 conditions per place. [2022-12-06 07:46:37,287 INFO L137 encePairwiseOnDemand]: 66/74 looper letters, 626 selfloop transitions, 9 changer transitions 1/636 dead transitions. [2022-12-06 07:46:37,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 636 transitions, 15946 flow [2022-12-06 07:46:37,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:46:37,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:46:37,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2022-12-06 07:46:37,288 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4774774774774775 [2022-12-06 07:46:37,289 INFO L175 Difference]: Start difference. First operand has 202 places, 550 transitions, 13175 flow. Second operand 3 states and 106 transitions. [2022-12-06 07:46:37,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 636 transitions, 15946 flow [2022-12-06 07:46:38,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 636 transitions, 15630 flow, removed 112 selfloop flow, removed 2 redundant places. [2022-12-06 07:46:38,417 INFO L231 Difference]: Finished difference. Result has 203 places, 551 transitions, 12870 flow [2022-12-06 07:46:38,418 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=12817, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=12870, PETRI_PLACES=203, PETRI_TRANSITIONS=551} [2022-12-06 07:46:38,418 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 173 predicate places. [2022-12-06 07:46:38,418 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:38,418 INFO L89 Accepts]: Start accepts. Operand has 203 places, 551 transitions, 12870 flow [2022-12-06 07:46:38,420 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:38,420 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:38,421 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 551 transitions, 12870 flow [2022-12-06 07:46:38,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 202 places, 551 transitions, 12870 flow [2022-12-06 07:46:39,026 INFO L130 PetriNetUnfolder]: 2331/5427 cut-off events. [2022-12-06 07:46:39,027 INFO L131 PetriNetUnfolder]: For 90028/90895 co-relation queries the response was YES. [2022-12-06 07:46:39,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41676 conditions, 5427 events. 2331/5427 cut-off events. For 90028/90895 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 51101 event pairs, 667 based on Foata normal form. 83/5119 useless extension candidates. Maximal degree in co-relation 41467. Up to 2062 conditions per place. [2022-12-06 07:46:39,107 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 202 places, 551 transitions, 12870 flow [2022-12-06 07:46:39,107 INFO L188 LiptonReduction]: Number of co-enabled transitions 3278 [2022-12-06 07:46:39,129 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [369] $Ultimate##0-->L64-5: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2] and [574] $Ultimate##0-->L48-5: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_103 0) (< 1 v_~N~0_177) (= |v_thread2Thread1of1ForFork2_#res.offset_37| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_103 v_~M~0_135)) (= |v_thread2Thread1of1ForFork2_#res.base_37| 0) (= v_~sum1~0_211 (let ((.cse0 (select |v_#memory_int_288| v_~A~0.base_189))) (+ v_~sum1~0_213 (select .cse0 v_~A~0.offset_189) (select .cse0 (+ v_~A~0.offset_189 4))))) (= 2 v_thread1Thread1of1ForFork1_~i~0_119)) InVars {~A~0.base=v_~A~0.base_189, ~A~0.offset=v_~A~0.offset_189, ~sum1~0=v_~sum1~0_213, ~M~0=v_~M~0_135, #memory_int=|v_#memory_int_288|, ~N~0=v_~N~0_177} OutVars{~A~0.base=v_~A~0.base_189, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_103, ~A~0.offset=v_~A~0.offset_189, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_101|, ~sum1~0=v_~sum1~0_211, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_37|, ~M~0=v_~M~0_135, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_93|, #memory_int=|v_#memory_int_288|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_119, ~N~0=v_~N~0_177, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread2Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork2_#res.offset] [2022-12-06 07:46:39,305 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [369] $Ultimate##0-->L64-5: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2] and [582] $Ultimate##0-->L48-5: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_53| 0) (< v_thread1Thread1of1ForFork1_~i~0_144 (+ v_~N~0_191 1)) (= (let ((.cse0 (select |v_#memory_int_313| v_~A~0.base_205)) (.cse1 (* v_thread1Thread1of1ForFork1_~i~0_144 4))) (+ (select .cse0 (+ .cse1 v_~A~0.offset_205 (- 4))) v_~sum1~0_248 (select .cse0 (+ .cse1 v_~A~0.offset_205 (- 8))))) v_~sum1~0_247) (= v_thread2Thread1of1ForFork2_~i~1_130 0) (not (< v_thread2Thread1of1ForFork2_~i~1_130 v_~M~0_151)) (= |v_thread2Thread1of1ForFork2_#res.base_53| 0) (= 2 v_thread1Thread1of1ForFork1_~i~0_144)) InVars {~A~0.base=v_~A~0.base_205, ~A~0.offset=v_~A~0.offset_205, ~sum1~0=v_~sum1~0_248, ~M~0=v_~M~0_151, #memory_int=|v_#memory_int_313|, ~N~0=v_~N~0_191} OutVars{~A~0.base=v_~A~0.base_205, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_130, ~A~0.offset=v_~A~0.offset_205, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_124|, ~sum1~0=v_~sum1~0_247, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_53|, ~M~0=v_~M~0_151, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_116|, #memory_int=|v_#memory_int_313|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_144, ~N~0=v_~N~0_191, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_53|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread2Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork2_#res.offset] [2022-12-06 07:46:39,357 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [369] $Ultimate##0-->L64-5: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2] and [570] $Ultimate##0-->L48-5: Formula: (and (= (let ((.cse0 (select |v_#memory_int_280| v_~A~0.base_181)) (.cse1 (* v_thread1Thread1of1ForFork1_~i~0_109 4))) (+ v_~sum1~0_195 (select .cse0 (+ .cse1 v_~A~0.offset_181 (- 4))) (select .cse0 (+ .cse1 v_~A~0.offset_181 (- 8))))) v_~sum1~0_193) (= 2 v_thread1Thread1of1ForFork1_~i~0_109) (< v_thread1Thread1of1ForFork1_~i~0_109 (+ v_~N~0_169 1))) InVars {~A~0.base=v_~A~0.base_181, ~A~0.offset=v_~A~0.offset_181, ~sum1~0=v_~sum1~0_195, #memory_int=|v_#memory_int_280|, ~N~0=v_~N~0_169} OutVars{~A~0.base=v_~A~0.base_181, ~A~0.offset=v_~A~0.offset_181, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_91|, ~sum1~0=v_~sum1~0_193, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_83|, #memory_int=|v_#memory_int_280|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_109, ~N~0=v_~N~0_169} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] [2022-12-06 07:46:39,378 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [369] $Ultimate##0-->L64-5: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2] and [581] $Ultimate##0-->L64-5: Formula: (let ((.cse0 (select |v_#memory_int_311| v_~A~0.base_203))) (and (= |v_thread2Thread1of1ForFork2_#res.offset_51| 0) (= (+ v_~sum1~0_244 (select .cse0 (+ (* v_thread1Thread1of1ForFork1_~i~0_142 4) v_~A~0.offset_203 (- 4)))) v_~sum1~0_243) (= v_thread1Thread1of1ForFork1_~i~0_142 1) (= (+ v_thread3Thread1of1ForFork0_~i~2_174 1) v_thread3Thread1of1ForFork0_~i~2_173) (not (< v_thread2Thread1of1ForFork2_~i~1_128 v_~M~0_149)) (< v_thread1Thread1of1ForFork1_~i~0_142 (+ v_~N~0_189 1)) (< v_thread3Thread1of1ForFork0_~i~2_174 v_~N~0_189) (= v_thread2Thread1of1ForFork2_~i~1_128 0) (= (+ (select .cse0 (+ v_~A~0.offset_203 (* v_thread3Thread1of1ForFork0_~i~2_174 4))) v_~sum3~0_169) v_~sum3~0_168) (= |v_thread2Thread1of1ForFork2_#res.base_51| 0))) InVars {~A~0.base=v_~A~0.base_203, ~A~0.offset=v_~A~0.offset_203, ~sum1~0=v_~sum1~0_244, ~M~0=v_~M~0_149, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_174, #memory_int=|v_#memory_int_311|, ~sum3~0=v_~sum3~0_169, ~N~0=v_~N~0_189} OutVars{~A~0.base=v_~A~0.base_203, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_173, ~sum3~0=v_~sum3~0_168, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_142, ~N~0=v_~N~0_189, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_92|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_128, ~A~0.offset=v_~A~0.offset_203, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_122|, ~sum1~0=v_~sum1~0_243, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_51|, ~M~0=v_~M~0_149, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_114|, #memory_int=|v_#memory_int_311|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_90|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_51|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread2Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5, thread2Thread1of1ForFork2_#res.offset] [2022-12-06 07:46:39,470 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [369] $Ultimate##0-->L64-5: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2] and [533] $Ultimate##0-->L64-5: Formula: (and (= (+ (select (select |v_#memory_int_173| v_~A~0.base_102) (+ v_~A~0.offset_102 (* 4 v_thread3Thread1of1ForFork0_~i~2_56))) v_~sum3~0_62) v_~sum3~0_61) (= |v_thread2Thread1of1ForFork2_#res.base_15| 0) (< v_thread3Thread1of1ForFork0_~i~2_56 v_~N~0_95) (not (< v_thread2Thread1of1ForFork2_~i~1_57 v_~M~0_83)) (= v_thread2Thread1of1ForFork2_~i~1_57 0) (= (+ v_thread3Thread1of1ForFork0_~i~2_56 1) v_thread3Thread1of1ForFork0_~i~2_55) (= |v_thread2Thread1of1ForFork2_#res.offset_15| 0)) InVars {~A~0.base=v_~A~0.base_102, ~A~0.offset=v_~A~0.offset_102, ~M~0=v_~M~0_83, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_56, #memory_int=|v_#memory_int_173|, ~sum3~0=v_~sum3~0_62, ~N~0=v_~N~0_95} OutVars{~A~0.base=v_~A~0.base_102, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_57, ~A~0.offset=v_~A~0.offset_102, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_15|, ~M~0=v_~M~0_83, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_55, #memory_int=|v_#memory_int_173|, ~sum3~0=v_~sum3~0_61, ~N~0=v_~N~0_95, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_27|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_25|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5, thread2Thread1of1ForFork2_#res.offset] [2022-12-06 07:46:39,516 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:46:39,516 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1098 [2022-12-06 07:46:39,516 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 551 transitions, 12932 flow [2022-12-06 07:46:39,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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) [2022-12-06 07:46:39,516 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:39,517 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:46:39,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-06 07:46:39,517 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:46:39,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:39,517 INFO L85 PathProgramCache]: Analyzing trace with hash -26958809, now seen corresponding path program 1 times [2022-12-06 07:46:39,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:39,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566820092] [2022-12-06 07:46:39,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:39,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:39,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:39,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:39,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566820092] [2022-12-06 07:46:39,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566820092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:46:39,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:46:39,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:46:39,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653342669] [2022-12-06 07:46:39,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:46:39,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:46:39,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:39,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:46:39,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:46:39,566 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 74 [2022-12-06 07:46:39,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 551 transitions, 12932 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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) [2022-12-06 07:46:39,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:39,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 74 [2022-12-06 07:46:39,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:42,446 INFO L130 PetriNetUnfolder]: 9783/15061 cut-off events. [2022-12-06 07:46:42,446 INFO L131 PetriNetUnfolder]: For 326455/326455 co-relation queries the response was YES. [2022-12-06 07:46:42,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132383 conditions, 15061 events. 9783/15061 cut-off events. For 326455/326455 co-relation queries the response was YES. Maximal size of possible extension queue 852. Compared 99144 event pairs, 2409 based on Foata normal form. 76/15137 useless extension candidates. Maximal degree in co-relation 131451. Up to 6159 conditions per place. [2022-12-06 07:46:42,566 INFO L137 encePairwiseOnDemand]: 55/74 looper letters, 674 selfloop transitions, 46 changer transitions 3/723 dead transitions. [2022-12-06 07:46:42,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 723 transitions, 17029 flow [2022-12-06 07:46:42,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:46:42,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:46:42,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2022-12-06 07:46:42,567 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36486486486486486 [2022-12-06 07:46:42,567 INFO L175 Difference]: Start difference. First operand has 202 places, 551 transitions, 12932 flow. Second operand 5 states and 135 transitions. [2022-12-06 07:46:42,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 723 transitions, 17029 flow [2022-12-06 07:46:43,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 723 transitions, 16960 flow, removed 24 selfloop flow, removed 1 redundant places. [2022-12-06 07:46:43,601 INFO L231 Difference]: Finished difference. Result has 207 places, 548 transitions, 12957 flow [2022-12-06 07:46:43,602 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=12811, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=503, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=12957, PETRI_PLACES=207, PETRI_TRANSITIONS=548} [2022-12-06 07:46:43,602 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 177 predicate places. [2022-12-06 07:46:43,602 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:43,602 INFO L89 Accepts]: Start accepts. Operand has 207 places, 548 transitions, 12957 flow [2022-12-06 07:46:43,605 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:43,605 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:43,605 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 207 places, 548 transitions, 12957 flow [2022-12-06 07:46:43,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 548 transitions, 12957 flow [2022-12-06 07:46:44,453 INFO L130 PetriNetUnfolder]: 2334/5455 cut-off events. [2022-12-06 07:46:44,453 INFO L131 PetriNetUnfolder]: For 97561/98420 co-relation queries the response was YES. [2022-12-06 07:46:44,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42711 conditions, 5455 events. 2334/5455 cut-off events. For 97561/98420 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 51583 event pairs, 668 based on Foata normal form. 84/5150 useless extension candidates. Maximal degree in co-relation 42552. Up to 2076 conditions per place. [2022-12-06 07:46:44,546 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 548 transitions, 12957 flow [2022-12-06 07:46:44,547 INFO L188 LiptonReduction]: Number of co-enabled transitions 3258 [2022-12-06 07:46:44,549 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:46:44,550 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 948 [2022-12-06 07:46:44,550 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 548 transitions, 12957 flow [2022-12-06 07:46:44,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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) [2022-12-06 07:46:44,550 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:44,550 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:46:44,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-06 07:46:44,550 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:46:44,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:44,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1742058660, now seen corresponding path program 1 times [2022-12-06 07:46:44,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:44,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816603720] [2022-12-06 07:46:44,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:44,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:44,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:44,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:44,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816603720] [2022-12-06 07:46:44,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816603720] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:46:44,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:46:44,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:46:44,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35498966] [2022-12-06 07:46:44,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:46:44,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:46:44,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:44,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:46:44,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:46:44,978 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-06 07:46:44,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 548 transitions, 12957 flow. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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) [2022-12-06 07:46:44,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:44,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-06 07:46:44,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:48,332 INFO L130 PetriNetUnfolder]: 9899/15264 cut-off events. [2022-12-06 07:46:48,332 INFO L131 PetriNetUnfolder]: For 354243/354243 co-relation queries the response was YES. [2022-12-06 07:46:48,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136001 conditions, 15264 events. 9899/15264 cut-off events. For 354243/354243 co-relation queries the response was YES. Maximal size of possible extension queue 857. Compared 100910 event pairs, 3536 based on Foata normal form. 1/15265 useless extension candidates. Maximal degree in co-relation 135204. Up to 14648 conditions per place. [2022-12-06 07:46:48,487 INFO L137 encePairwiseOnDemand]: 22/72 looper letters, 487 selfloop transitions, 153 changer transitions 4/644 dead transitions. [2022-12-06 07:46:48,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 644 transitions, 15357 flow [2022-12-06 07:46:48,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:46:48,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:46:48,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2022-12-06 07:46:48,488 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23765432098765432 [2022-12-06 07:46:48,488 INFO L175 Difference]: Start difference. First operand has 204 places, 548 transitions, 12957 flow. Second operand 9 states and 154 transitions. [2022-12-06 07:46:48,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 644 transitions, 15357 flow [2022-12-06 07:46:49,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 644 transitions, 15314 flow, removed 13 selfloop flow, removed 3 redundant places. [2022-12-06 07:46:49,733 INFO L231 Difference]: Finished difference. Result has 212 places, 571 transitions, 13769 flow [2022-12-06 07:46:49,734 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=12922, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13769, PETRI_PLACES=212, PETRI_TRANSITIONS=571} [2022-12-06 07:46:49,734 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 182 predicate places. [2022-12-06 07:46:49,734 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:49,734 INFO L89 Accepts]: Start accepts. Operand has 212 places, 571 transitions, 13769 flow [2022-12-06 07:46:49,737 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:49,737 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:49,738 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 571 transitions, 13769 flow [2022-12-06 07:46:49,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 212 places, 571 transitions, 13769 flow [2022-12-06 07:46:50,404 INFO L130 PetriNetUnfolder]: 2346/5454 cut-off events. [2022-12-06 07:46:50,405 INFO L131 PetriNetUnfolder]: For 98813/99588 co-relation queries the response was YES. [2022-12-06 07:46:50,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43511 conditions, 5454 events. 2346/5454 cut-off events. For 98813/99588 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 51338 event pairs, 685 based on Foata normal form. 71/5149 useless extension candidates. Maximal degree in co-relation 43152. Up to 2109 conditions per place. [2022-12-06 07:46:50,487 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 212 places, 571 transitions, 13769 flow [2022-12-06 07:46:50,488 INFO L188 LiptonReduction]: Number of co-enabled transitions 3380 [2022-12-06 07:46:50,489 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [567] $Ultimate##0-->L84-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre14#1_65| |v_#pthreadsForks_92|) (= v_~sum1~0_181 (+ v_~sum1~0_182 (select (select |v_#memory_int_271| v_~A~0.base_175) (+ v_~A~0.offset_175 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_103 4))))) (= |v_#pthreadsForks_91| (+ |v_#pthreadsForks_92| 1)) (= (store |v_#memory_int_271| |v_ULTIMATE.start_main_~#t3~0#1.base_59| (store (select |v_#memory_int_271| |v_ULTIMATE.start_main_~#t3~0#1.base_59|) |v_ULTIMATE.start_main_~#t3~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre14#1_65|)) |v_#memory_int_270|) (= v_thread1Thread1of1ForFork1_~i~0_103 1) (< v_thread1Thread1of1ForFork1_~i~0_103 (+ v_~N~0_163 1))) InVars {~A~0.base=v_~A~0.base_175, ~A~0.offset=v_~A~0.offset_175, #pthreadsForks=|v_#pthreadsForks_92|, ~sum1~0=v_~sum1~0_182, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_59|, #memory_int=|v_#memory_int_271|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_59|, ~N~0=v_~N~0_163} OutVars{~A~0.base=v_~A~0.base_175, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_59|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_59|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_103, ~N~0=v_~N~0_163, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_55|, ~A~0.offset=v_~A~0.offset_175, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_65|, #pthreadsForks=|v_#pthreadsForks_91|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_85|, ~sum1~0=v_~sum1~0_181, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_77|, #memory_int=|v_#memory_int_270|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork1_~i~0] and [523] $Ultimate##0-->L56-5: Formula: (and (= (+ v_~sum2~0_64 (select (select |v_#memory_int_157| v_~A~0.base_86) v_~A~0.offset_86)) v_~sum2~0_63) (= v_thread2Thread1of1ForFork2_~i~1_43 1) (< 0 v_~M~0_67)) InVars {~A~0.base=v_~A~0.base_86, ~A~0.offset=v_~A~0.offset_86, ~M~0=v_~M~0_67, #memory_int=|v_#memory_int_157|, ~sum2~0=v_~sum2~0_64} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_86, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_43, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_25|, ~A~0.offset=v_~A~0.offset_86, ~M~0=v_~M~0_67, #memory_int=|v_#memory_int_157|, ~sum2~0=v_~sum2~0_63} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0] [2022-12-06 07:46:50,546 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:46:50,546 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 812 [2022-12-06 07:46:50,546 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 571 transitions, 13788 flow [2022-12-06 07:46:50,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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) [2022-12-06 07:46:50,546 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:50,546 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:46:50,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-06 07:46:50,547 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:46:50,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:50,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1895205200, now seen corresponding path program 1 times [2022-12-06 07:46:50,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:50,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693230512] [2022-12-06 07:46:50,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:50,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:50,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:50,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:50,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693230512] [2022-12-06 07:46:50,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693230512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:46:50,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:46:50,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:46:50,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550971101] [2022-12-06 07:46:50,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:46:50,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:46:50,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:50,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:46:50,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:46:50,626 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 73 [2022-12-06 07:46:50,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 571 transitions, 13788 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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) [2022-12-06 07:46:50,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:50,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 73 [2022-12-06 07:46:50,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:53,475 INFO L130 PetriNetUnfolder]: 9871/15233 cut-off events. [2022-12-06 07:46:53,475 INFO L131 PetriNetUnfolder]: For 360453/360453 co-relation queries the response was YES. [2022-12-06 07:46:53,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137317 conditions, 15233 events. 9871/15233 cut-off events. For 360453/360453 co-relation queries the response was YES. Maximal size of possible extension queue 890. Compared 103061 event pairs, 1912 based on Foata normal form. 26/15259 useless extension candidates. Maximal degree in co-relation 135916. Up to 5350 conditions per place. [2022-12-06 07:46:53,611 INFO L137 encePairwiseOnDemand]: 58/73 looper letters, 743 selfloop transitions, 35 changer transitions 3/781 dead transitions. [2022-12-06 07:46:53,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 781 transitions, 18895 flow [2022-12-06 07:46:53,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:46:53,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:46:53,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-12-06 07:46:53,612 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35342465753424657 [2022-12-06 07:46:53,612 INFO L175 Difference]: Start difference. First operand has 212 places, 571 transitions, 13788 flow. Second operand 5 states and 129 transitions. [2022-12-06 07:46:53,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 781 transitions, 18895 flow [2022-12-06 07:46:54,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 781 transitions, 18797 flow, removed 38 selfloop flow, removed 1 redundant places. [2022-12-06 07:46:54,698 INFO L231 Difference]: Finished difference. Result has 216 places, 576 transitions, 13835 flow [2022-12-06 07:46:54,699 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=13659, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=13835, PETRI_PLACES=216, PETRI_TRANSITIONS=576} [2022-12-06 07:46:54,699 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 186 predicate places. [2022-12-06 07:46:54,699 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:54,699 INFO L89 Accepts]: Start accepts. Operand has 216 places, 576 transitions, 13835 flow [2022-12-06 07:46:54,701 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:54,701 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:54,701 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 216 places, 576 transitions, 13835 flow [2022-12-06 07:46:54,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 216 places, 576 transitions, 13835 flow [2022-12-06 07:46:55,073 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([505] L64-5-->L64-5: Formula: (and (= (+ v_thread3Thread1of1ForFork0_~i~2_38 1) v_thread3Thread1of1ForFork0_~i~2_37) (= (+ v_~sum3~0_36 (select (select |v_#memory_int_131| v_~A~0.base_68) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_38) v_~A~0.offset_68))) v_~sum3~0_35) (< v_thread3Thread1of1ForFork0_~i~2_38 v_~N~0_69)) InVars {~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_38, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_36, ~N~0=v_~N~0_69} OutVars{~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_37, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_35, ~N~0=v_~N~0_69, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_21|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5][464], [Black: 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), 60#L84-4true, Black: 1196#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1798#(and (<= 0 ~M~0) (<= ~M~0 2) (<= ~M~0 ~N~0) (<= ~M~0 thread2Thread1of1ForFork2_~i~1)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 9#thread2EXITtrue, 1006#true, Black: 1487#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 462#true, Black: 1477#(and (= ~A~0.offset 0) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 1442#true, 53#L64-5true, 1777#true, Black: 1576#(<= ~N~0 (+ 2 ~M~0)), Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1796#(<= ~M~0 thread2Thread1of1ForFork2_~i~1), 12#L48-5true, Black: 1584#(<= 2 ~N~0), Black: 1585#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1593#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 1605#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 ~N~0)), Black: 1607#(and (<= 2 ~M~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 ~N~0)), Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 622#true, Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 1620#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 ~N~0)), Black: 1618#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 ~N~0)), 1591#(and (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), 1293#true, 1623#true, 1764#true, 890#(<= 2 ~N~0), 752#true, Black: 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 1707#(or (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (and (<= (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) 4294967296) 4294967296)) (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (* (div ~sum1~0 4294967296) 4294967296))) (< (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) 4294967296) 4294967296) 1)))), Black: 1743#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= 2 thread1Thread1of1ForFork1_~i~0) (= ~sum3~0 0) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= ~N~0 2)), Black: 1751#(and (or (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (and (<= (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) 4294967296) 4294967296)) (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (* (div ~sum1~0 4294967296) 4294967296))) (< (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) 4294967296) 4294967296) 1)))) (= ~sum1~0 (+ ~sum3~0 ~sum2~0))), Black: 1666#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= 1 thread3Thread1of1ForFork0_~i~2) (= ~sum3~0 0) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= ~N~0 2)), Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 403#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 1303#true, Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), Black: 1771#(<= ~N~0 2), Black: 1774#(and (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (<= ~N~0 2)), 1614#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), 1574#true, Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), 1156#true, Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1784#(and (<= ~sum1~0 (+ ~sum3~0 ~sum2~0)) (not (<= (+ ~sum1~0 1 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)) (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)))) (<= (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)) (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)))), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1783#(or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (<= ~sum1~0 (+ ~sum3~0 ~sum2~0)) (not (<= (+ ~sum1~0 1 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)) (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)))) (<= (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)) (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296))))), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), Black: 1782#(and (= ~A~0.offset 0) (or (<= (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1) (* ~N~0 4)) (and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~sum2~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0) ~sum1~0)))), Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2))]) [2022-12-06 07:46:55,073 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:46:55,073 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:55,073 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:55,073 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:46:55,420 INFO L130 PetriNetUnfolder]: 2381/5577 cut-off events. [2022-12-06 07:46:55,420 INFO L131 PetriNetUnfolder]: For 106274/107110 co-relation queries the response was YES. [2022-12-06 07:46:55,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45066 conditions, 5577 events. 2381/5577 cut-off events. For 106274/107110 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 53295 event pairs, 657 based on Foata normal form. 100/5282 useless extension candidates. Maximal degree in co-relation 44740. Up to 2099 conditions per place. [2022-12-06 07:46:55,509 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 216 places, 576 transitions, 13835 flow [2022-12-06 07:46:55,509 INFO L188 LiptonReduction]: Number of co-enabled transitions 3448 [2022-12-06 07:46:55,513 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:46:55,514 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 815 [2022-12-06 07:46:55,514 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 576 transitions, 13835 flow [2022-12-06 07:46:55,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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) [2022-12-06 07:46:55,514 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:55,514 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:46:55,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-06 07:46:55,514 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:46:55,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:55,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1057227424, now seen corresponding path program 2 times [2022-12-06 07:46:55,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:55,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726930965] [2022-12-06 07:46:55,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:55,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:56,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:56,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:56,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726930965] [2022-12-06 07:46:56,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726930965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:46:56,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:46:56,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:46:56,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855500628] [2022-12-06 07:46:56,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:46:56,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:46:56,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:56,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:46:56,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:46:56,072 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-06 07:46:56,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 576 transitions, 13835 flow. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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) [2022-12-06 07:46:56,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:56,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-06 07:46:56,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:59,195 INFO L130 PetriNetUnfolder]: 9932/15325 cut-off events. [2022-12-06 07:46:59,195 INFO L131 PetriNetUnfolder]: For 378394/378394 co-relation queries the response was YES. [2022-12-06 07:46:59,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140360 conditions, 15325 events. 9932/15325 cut-off events. For 378394/378394 co-relation queries the response was YES. Maximal size of possible extension queue 899. Compared 101948 event pairs, 3004 based on Foata normal form. 1/15326 useless extension candidates. Maximal degree in co-relation 139185. Up to 14876 conditions per place. [2022-12-06 07:46:59,335 INFO L137 encePairwiseOnDemand]: 21/72 looper letters, 490 selfloop transitions, 180 changer transitions 4/674 dead transitions. [2022-12-06 07:46:59,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 674 transitions, 16528 flow [2022-12-06 07:46:59,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:46:59,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:46:59,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2022-12-06 07:46:59,336 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2586805555555556 [2022-12-06 07:46:59,337 INFO L175 Difference]: Start difference. First operand has 216 places, 576 transitions, 13835 flow. Second operand 8 states and 149 transitions. [2022-12-06 07:46:59,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 674 transitions, 16528 flow [2022-12-06 07:47:00,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 674 transitions, 16492 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-06 07:47:00,774 INFO L231 Difference]: Finished difference. Result has 224 places, 598 transitions, 14844 flow [2022-12-06 07:47:00,775 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=13805, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=14844, PETRI_PLACES=224, PETRI_TRANSITIONS=598} [2022-12-06 07:47:00,775 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 194 predicate places. [2022-12-06 07:47:00,775 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:47:00,775 INFO L89 Accepts]: Start accepts. Operand has 224 places, 598 transitions, 14844 flow [2022-12-06 07:47:00,777 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:47:00,777 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:47:00,777 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 224 places, 598 transitions, 14844 flow [2022-12-06 07:47:00,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 224 places, 598 transitions, 14844 flow [2022-12-06 07:47:01,405 INFO L130 PetriNetUnfolder]: 2404/5614 cut-off events. [2022-12-06 07:47:01,405 INFO L131 PetriNetUnfolder]: For 111515/112321 co-relation queries the response was YES. [2022-12-06 07:47:01,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46122 conditions, 5614 events. 2404/5614 cut-off events. For 111515/112321 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 53470 event pairs, 659 based on Foata normal form. 92/5308 useless extension candidates. Maximal degree in co-relation 45770. Up to 2122 conditions per place. [2022-12-06 07:47:01,643 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 224 places, 598 transitions, 14844 flow [2022-12-06 07:47:01,643 INFO L188 LiptonReduction]: Number of co-enabled transitions 3544 [2022-12-06 07:47:01,647 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:47:01,648 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 873 [2022-12-06 07:47:01,648 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 598 transitions, 14844 flow [2022-12-06 07:47:01,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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) [2022-12-06 07:47:01,648 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:47:01,648 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:47:01,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-06 07:47:01,648 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:47:01,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:47:01,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1657327671, now seen corresponding path program 1 times [2022-12-06 07:47:01,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:47:01,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160191669] [2022-12-06 07:47:01,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:47:01,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:47:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:47:01,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:47:01,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:47:01,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160191669] [2022-12-06 07:47:01,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160191669] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:47:01,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:47:01,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:47:01,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437831673] [2022-12-06 07:47:01,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:47:01,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:47:01,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:47:01,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:47:01,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:47:01,695 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-06 07:47:01,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 598 transitions, 14844 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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) [2022-12-06 07:47:01,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:47:01,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-06 07:47:01,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:47:04,552 INFO L130 PetriNetUnfolder]: 9894/15273 cut-off events. [2022-12-06 07:47:04,552 INFO L131 PetriNetUnfolder]: For 386948/386948 co-relation queries the response was YES. [2022-12-06 07:47:04,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140802 conditions, 15273 events. 9894/15273 cut-off events. For 386948/386948 co-relation queries the response was YES. Maximal size of possible extension queue 844. Compared 100741 event pairs, 4213 based on Foata normal form. 12/15285 useless extension candidates. Maximal degree in co-relation 139632. Up to 10447 conditions per place. [2022-12-06 07:47:04,859 INFO L137 encePairwiseOnDemand]: 69/72 looper letters, 672 selfloop transitions, 1 changer transitions 10/683 dead transitions. [2022-12-06 07:47:04,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 683 transitions, 17575 flow [2022-12-06 07:47:04,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:47:04,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:47:04,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2022-12-06 07:47:04,860 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3923611111111111 [2022-12-06 07:47:04,860 INFO L175 Difference]: Start difference. First operand has 224 places, 598 transitions, 14844 flow. Second operand 4 states and 113 transitions. [2022-12-06 07:47:04,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 683 transitions, 17575 flow [2022-12-06 07:47:06,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 683 transitions, 17348 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-06 07:47:06,139 INFO L231 Difference]: Finished difference. Result has 223 places, 593 transitions, 14471 flow [2022-12-06 07:47:06,139 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=14525, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=594, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=14471, PETRI_PLACES=223, PETRI_TRANSITIONS=593} [2022-12-06 07:47:06,139 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 193 predicate places. [2022-12-06 07:47:06,139 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:47:06,139 INFO L89 Accepts]: Start accepts. Operand has 223 places, 593 transitions, 14471 flow [2022-12-06 07:47:06,141 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:47:06,141 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:47:06,142 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 593 transitions, 14471 flow [2022-12-06 07:47:06,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 593 transitions, 14471 flow [2022-12-06 07:47:06,849 INFO L130 PetriNetUnfolder]: 2371/5531 cut-off events. [2022-12-06 07:47:06,849 INFO L131 PetriNetUnfolder]: For 107601/108229 co-relation queries the response was YES. [2022-12-06 07:47:06,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45220 conditions, 5531 events. 2371/5531 cut-off events. For 107601/108229 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 52205 event pairs, 642 based on Foata normal form. 54/5193 useless extension candidates. Maximal degree in co-relation 44889. Up to 2091 conditions per place. [2022-12-06 07:47:06,935 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 222 places, 593 transitions, 14471 flow [2022-12-06 07:47:06,935 INFO L188 LiptonReduction]: Number of co-enabled transitions 3500 [2022-12-06 07:47:06,938 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:47:06,939 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 800 [2022-12-06 07:47:06,939 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 593 transitions, 14471 flow [2022-12-06 07:47:06,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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) [2022-12-06 07:47:06,939 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:47:06,939 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:47:06,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-06 07:47:06,940 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:47:06,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:47:06,940 INFO L85 PathProgramCache]: Analyzing trace with hash -141081413, now seen corresponding path program 1 times [2022-12-06 07:47:06,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:47:06,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526173341] [2022-12-06 07:47:06,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:47:06,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:47:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:47:07,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:47:07,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:47:07,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526173341] [2022-12-06 07:47:07,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526173341] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:47:07,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864449191] [2022-12-06 07:47:07,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:47:07,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:47:07,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:47:07,021 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:47:07,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 07:47:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:47:07,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 07:47:07,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:47:07,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:47:07,226 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:47:07,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864449191] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:47:07,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:47:07,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-12-06 07:47:07,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371926947] [2022-12-06 07:47:07,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:47:07,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:47:07,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:47:07,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:47:07,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:47:07,228 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 71 [2022-12-06 07:47:07,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 593 transitions, 14471 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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) [2022-12-06 07:47:07,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:47:07,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 71 [2022-12-06 07:47:07,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:47:10,485 INFO L130 PetriNetUnfolder]: 8749/13877 cut-off events. [2022-12-06 07:47:10,485 INFO L131 PetriNetUnfolder]: For 357402/357402 co-relation queries the response was YES. [2022-12-06 07:47:10,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125857 conditions, 13877 events. 8749/13877 cut-off events. For 357402/357402 co-relation queries the response was YES. Maximal size of possible extension queue 810. Compared 95575 event pairs, 2190 based on Foata normal form. 727/14604 useless extension candidates. Maximal degree in co-relation 124701. Up to 4766 conditions per place. [2022-12-06 07:47:10,601 INFO L137 encePairwiseOnDemand]: 53/71 looper letters, 527 selfloop transitions, 127 changer transitions 11/665 dead transitions. [2022-12-06 07:47:10,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 665 transitions, 16817 flow [2022-12-06 07:47:10,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:47:10,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:47:10,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2022-12-06 07:47:10,603 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37746478873239436 [2022-12-06 07:47:10,603 INFO L175 Difference]: Start difference. First operand has 222 places, 593 transitions, 14471 flow. Second operand 5 states and 134 transitions. [2022-12-06 07:47:10,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 665 transitions, 16817 flow [2022-12-06 07:47:12,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 665 transitions, 16632 flow, removed 24 selfloop flow, removed 7 redundant places. [2022-12-06 07:47:12,129 INFO L231 Difference]: Finished difference. Result has 221 places, 565 transitions, 14309 flow [2022-12-06 07:47:12,130 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=13498, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=14309, PETRI_PLACES=221, PETRI_TRANSITIONS=565} [2022-12-06 07:47:12,130 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 191 predicate places. [2022-12-06 07:47:12,130 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:47:12,130 INFO L89 Accepts]: Start accepts. Operand has 221 places, 565 transitions, 14309 flow [2022-12-06 07:47:12,132 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:47:12,132 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:47:12,132 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 565 transitions, 14309 flow [2022-12-06 07:47:12,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 221 places, 565 transitions, 14309 flow [2022-12-06 07:47:12,734 INFO L130 PetriNetUnfolder]: 2122/5166 cut-off events. [2022-12-06 07:47:12,734 INFO L131 PetriNetUnfolder]: For 104533/105061 co-relation queries the response was YES. [2022-12-06 07:47:12,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41884 conditions, 5166 events. 2122/5166 cut-off events. For 104533/105061 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 49944 event pairs, 633 based on Foata normal form. 49/4846 useless extension candidates. Maximal degree in co-relation 41557. Up to 2035 conditions per place. [2022-12-06 07:47:12,822 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 221 places, 565 transitions, 14309 flow [2022-12-06 07:47:12,822 INFO L188 LiptonReduction]: Number of co-enabled transitions 3250 [2022-12-06 07:47:12,825 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:47:12,826 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 696 [2022-12-06 07:47:12,826 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 565 transitions, 14309 flow [2022-12-06 07:47:12,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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) [2022-12-06 07:47:12,826 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:47:12,826 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:47:12,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 07:47:13,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-12-06 07:47:13,030 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:47:13,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:47:13,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1629762972, now seen corresponding path program 1 times [2022-12-06 07:47:13,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:47:13,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560874623] [2022-12-06 07:47:13,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:47:13,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:47:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:47:13,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:47:13,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:47:13,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560874623] [2022-12-06 07:47:13,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560874623] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:47:13,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873045359] [2022-12-06 07:47:13,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:47:13,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:47:13,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:47:13,520 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:47:13,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 07:47:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:47:13,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-06 07:47:13,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:47:13,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:47:13,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 07:47:13,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:47:13,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-12-06 07:47:13,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:47:13,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-12-06 07:47:13,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:47:13,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2022-12-06 07:47:14,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:47:14,102 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:47:14,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 57 [2022-12-06 07:47:14,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:47:14,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:47:16,409 WARN L837 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1696 (Array Int Int))) (or (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1696) c_~A~0.base))) (= (mod (let ((.cse1 (* ~M~0 4))) (+ c_~sum3~0 (select .cse0 (+ c_~A~0.offset .cse1 4)) c_~sum2~0 (select .cse0 (+ c_~A~0.offset .cse1)))) 4294967296) (mod (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4)) c_~sum1~0) 4294967296))) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0))) is different from false [2022-12-06 07:47:18,438 WARN L837 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1695 (Array Int Int))) (or (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1695))) (let ((.cse0 (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1696) c_~A~0.base))) (= (mod (let ((.cse1 (* ~M~0 4))) (+ c_~sum3~0 (select .cse0 (+ c_~A~0.offset .cse1)) (select .cse0 (+ c_~A~0.offset .cse1 4)) c_~sum2~0)) 4294967296) (mod (+ (select (select .cse2 c_~A~0.base) c_~A~0.offset) c_~sum1~0 (select .cse0 (+ c_~A~0.offset 4))) 4294967296)))) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0))) is different from false [2022-12-06 07:47:18,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:47:18,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873045359] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:47:18,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:47:18,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 07:47:18,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320172930] [2022-12-06 07:47:18,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:47:18,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 07:47:18,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:47:18,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 07:47:18,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=240, Unknown=2, NotChecked=66, Total=380 [2022-12-06 07:47:18,453 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 68 [2022-12-06 07:47:18,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 565 transitions, 14309 flow. Second operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 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) [2022-12-06 07:47:18,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:47:18,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 68 [2022-12-06 07:47:18,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:47:22,451 INFO L130 PetriNetUnfolder]: 8791/13919 cut-off events. [2022-12-06 07:47:22,451 INFO L131 PetriNetUnfolder]: For 360599/360599 co-relation queries the response was YES. [2022-12-06 07:47:22,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127287 conditions, 13919 events. 8791/13919 cut-off events. For 360599/360599 co-relation queries the response was YES. Maximal size of possible extension queue 816. Compared 95538 event pairs, 2387 based on Foata normal form. 2/13921 useless extension candidates. Maximal degree in co-relation 126136. Up to 10887 conditions per place. [2022-12-06 07:47:22,576 INFO L137 encePairwiseOnDemand]: 15/68 looper letters, 434 selfloop transitions, 268 changer transitions 16/718 dead transitions. [2022-12-06 07:47:22,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 718 transitions, 17539 flow [2022-12-06 07:47:22,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 07:47:22,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 07:47:22,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 212 transitions. [2022-12-06 07:47:22,577 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18339100346020762 [2022-12-06 07:47:22,577 INFO L175 Difference]: Start difference. First operand has 221 places, 565 transitions, 14309 flow. Second operand 17 states and 212 transitions. [2022-12-06 07:47:22,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 718 transitions, 17539 flow [2022-12-06 07:47:24,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 718 transitions, 17538 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:47:24,251 INFO L231 Difference]: Finished difference. Result has 244 places, 596 transitions, 16067 flow [2022-12-06 07:47:24,252 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=14308, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=238, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=16067, PETRI_PLACES=244, PETRI_TRANSITIONS=596} [2022-12-06 07:47:24,252 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 214 predicate places. [2022-12-06 07:47:24,252 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:47:24,252 INFO L89 Accepts]: Start accepts. Operand has 244 places, 596 transitions, 16067 flow [2022-12-06 07:47:24,254 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:47:24,254 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:47:24,254 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 596 transitions, 16067 flow [2022-12-06 07:47:24,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 243 places, 596 transitions, 16067 flow [2022-12-06 07:47:24,914 INFO L130 PetriNetUnfolder]: 2142/5238 cut-off events. [2022-12-06 07:47:24,914 INFO L131 PetriNetUnfolder]: For 120945/121452 co-relation queries the response was YES. [2022-12-06 07:47:24,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44769 conditions, 5238 events. 2142/5238 cut-off events. For 120945/121452 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 50868 event pairs, 643 based on Foata normal form. 52/4916 useless extension candidates. Maximal degree in co-relation 44418. Up to 2072 conditions per place. [2022-12-06 07:47:24,997 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 243 places, 596 transitions, 16067 flow [2022-12-06 07:47:24,997 INFO L188 LiptonReduction]: Number of co-enabled transitions 3406 [2022-12-06 07:47:25,192 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:47:25,192 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 940 [2022-12-06 07:47:25,192 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 595 transitions, 16062 flow [2022-12-06 07:47:25,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 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) [2022-12-06 07:47:25,193 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:47:25,193 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:47:25,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 07:47:25,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-12-06 07:47:25,396 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:47:25,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:47:25,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1232609135, now seen corresponding path program 1 times [2022-12-06 07:47:25,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:47:25,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573338396] [2022-12-06 07:47:25,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:47:25,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:47:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:47:25,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:47:25,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:47:25,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573338396] [2022-12-06 07:47:25,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573338396] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:47:25,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:47:25,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:47:25,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612408306] [2022-12-06 07:47:25,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:47:25,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:47:25,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:47:25,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:47:25,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:47:25,443 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 70 [2022-12-06 07:47:25,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 595 transitions, 16062 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2022-12-06 07:47:25,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:47:25,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 70 [2022-12-06 07:47:25,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:47:28,262 INFO L130 PetriNetUnfolder]: 8097/13036 cut-off events. [2022-12-06 07:47:28,262 INFO L131 PetriNetUnfolder]: For 395952/397303 co-relation queries the response was YES. [2022-12-06 07:47:28,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125277 conditions, 13036 events. 8097/13036 cut-off events. For 395952/397303 co-relation queries the response was YES. Maximal size of possible extension queue 855. Compared 91861 event pairs, 3673 based on Foata normal form. 785/13612 useless extension candidates. Maximal degree in co-relation 123811. Up to 5737 conditions per place. [2022-12-06 07:47:28,377 INFO L137 encePairwiseOnDemand]: 62/70 looper letters, 669 selfloop transitions, 6 changer transitions 4/695 dead transitions. [2022-12-06 07:47:28,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 695 transitions, 19240 flow [2022-12-06 07:47:28,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:47:28,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:47:28,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2022-12-06 07:47:28,378 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2022-12-06 07:47:28,378 INFO L175 Difference]: Start difference. First operand has 242 places, 595 transitions, 16062 flow. Second operand 4 states and 125 transitions. [2022-12-06 07:47:28,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 695 transitions, 19240 flow [2022-12-06 07:47:29,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 695 transitions, 19088 flow, removed 64 selfloop flow, removed 3 redundant places. [2022-12-06 07:47:29,820 INFO L231 Difference]: Finished difference. Result has 243 places, 592 transitions, 15832 flow [2022-12-06 07:47:29,820 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=15899, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=15832, PETRI_PLACES=243, PETRI_TRANSITIONS=592} [2022-12-06 07:47:29,821 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 213 predicate places. [2022-12-06 07:47:29,821 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:47:29,821 INFO L89 Accepts]: Start accepts. Operand has 243 places, 592 transitions, 15832 flow [2022-12-06 07:47:29,823 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:47:29,823 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:47:29,823 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 243 places, 592 transitions, 15832 flow [2022-12-06 07:47:29,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 243 places, 592 transitions, 15832 flow [2022-12-06 07:47:30,554 INFO L130 PetriNetUnfolder]: 2138/5179 cut-off events. [2022-12-06 07:47:30,554 INFO L131 PetriNetUnfolder]: For 119184/119706 co-relation queries the response was YES. [2022-12-06 07:47:30,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44515 conditions, 5179 events. 2138/5179 cut-off events. For 119184/119706 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 50097 event pairs, 650 based on Foata normal form. 49/4856 useless extension candidates. Maximal degree in co-relation 44057. Up to 2050 conditions per place. [2022-12-06 07:47:30,632 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 243 places, 592 transitions, 15832 flow [2022-12-06 07:47:30,632 INFO L188 LiptonReduction]: Number of co-enabled transitions 3384 [2022-12-06 07:47:30,636 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:47:30,636 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 815 [2022-12-06 07:47:30,636 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 592 transitions, 15832 flow [2022-12-06 07:47:30,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2022-12-06 07:47:30,636 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:47:30,636 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:47:30,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-06 07:47:30,637 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:47:30,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:47:30,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1271830573, now seen corresponding path program 1 times [2022-12-06 07:47:30,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:47:30,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967115659] [2022-12-06 07:47:30,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:47:30,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:47:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:47:30,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:47:30,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:47:30,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967115659] [2022-12-06 07:47:30,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967115659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:47:30,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:47:30,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:47:30,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691435877] [2022-12-06 07:47:30,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:47:30,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:47:30,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:47:30,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:47:30,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:47:30,718 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-06 07:47:30,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 592 transitions, 15832 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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) [2022-12-06 07:47:30,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:47:30,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-06 07:47:30,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:47:33,814 INFO L130 PetriNetUnfolder]: 8777/13897 cut-off events. [2022-12-06 07:47:33,814 INFO L131 PetriNetUnfolder]: For 387147/387147 co-relation queries the response was YES. [2022-12-06 07:47:33,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132204 conditions, 13897 events. 8777/13897 cut-off events. For 387147/387147 co-relation queries the response was YES. Maximal size of possible extension queue 854. Compared 95773 event pairs, 1455 based on Foata normal form. 16/13913 useless extension candidates. Maximal degree in co-relation 130910. Up to 4673 conditions per place. [2022-12-06 07:47:33,952 INFO L137 encePairwiseOnDemand]: 43/69 looper letters, 675 selfloop transitions, 76 changer transitions 5/756 dead transitions. [2022-12-06 07:47:33,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 756 transitions, 19839 flow [2022-12-06 07:47:33,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:47:33,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:47:33,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2022-12-06 07:47:33,953 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3357487922705314 [2022-12-06 07:47:33,953 INFO L175 Difference]: Start difference. First operand has 243 places, 592 transitions, 15832 flow. Second operand 6 states and 139 transitions. [2022-12-06 07:47:33,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 756 transitions, 19839 flow [2022-12-06 07:47:35,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 756 transitions, 19809 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-12-06 07:47:35,590 INFO L231 Difference]: Finished difference. Result has 247 places, 589 transitions, 15938 flow [2022-12-06 07:47:35,590 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=15810, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=15938, PETRI_PLACES=247, PETRI_TRANSITIONS=589} [2022-12-06 07:47:35,591 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 217 predicate places. [2022-12-06 07:47:35,591 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:47:35,591 INFO L89 Accepts]: Start accepts. Operand has 247 places, 589 transitions, 15938 flow [2022-12-06 07:47:35,593 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:47:35,593 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:47:35,593 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 247 places, 589 transitions, 15938 flow [2022-12-06 07:47:35,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 246 places, 589 transitions, 15938 flow [2022-12-06 07:47:36,351 INFO L130 PetriNetUnfolder]: 2123/5153 cut-off events. [2022-12-06 07:47:36,352 INFO L131 PetriNetUnfolder]: For 130967/131477 co-relation queries the response was YES. [2022-12-06 07:47:36,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45239 conditions, 5153 events. 2123/5153 cut-off events. For 130967/131477 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 49740 event pairs, 657 based on Foata normal form. 62/4849 useless extension candidates. Maximal degree in co-relation 44953. Up to 2053 conditions per place. [2022-12-06 07:47:36,432 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 246 places, 589 transitions, 15938 flow [2022-12-06 07:47:36,432 INFO L188 LiptonReduction]: Number of co-enabled transitions 3366 [2022-12-06 07:47:36,444 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [612] $Ultimate##0-->L64-5: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_201 0) (= (+ v_~M~0_203 1) v_thread3Thread1of1ForFork0_~i~2_264) (= v_~sum3~0_220 (+ (select (select |v_#memory_int_391| v_~A~0.base_265) (+ (* v_thread3Thread1of1ForFork0_~i~2_264 4) v_~A~0.offset_265 (- 4))) v_~sum3~0_221)) (= |v_thread2Thread1of1ForFork2_#res.offset_77| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_201 v_~M~0_203)) (= |v_thread2Thread1of1ForFork2_#res.base_77| 0) (< v_thread3Thread1of1ForFork0_~i~2_264 (+ v_~N~0_249 1))) InVars {~A~0.base=v_~A~0.base_265, ~A~0.offset=v_~A~0.offset_265, ~M~0=v_~M~0_203, #memory_int=|v_#memory_int_391|, ~sum3~0=v_~sum3~0_221, ~N~0=v_~N~0_249} OutVars{~A~0.base=v_~A~0.base_265, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_201, ~A~0.offset=v_~A~0.offset_265, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_77|, ~M~0=v_~M~0_203, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_264, #memory_int=|v_#memory_int_391|, ~sum3~0=v_~sum3~0_220, ~N~0=v_~N~0_249, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_125|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_123|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_77|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5, thread2Thread1of1ForFork2_#res.offset] and [532] $Ultimate##0-->L48-5: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_43 (+ 1 v_~N~0_93)) (= v_~sum1~0_77 (+ v_~sum1~0_78 (select (select |v_#memory_int_171| v_~A~0.base_100) (+ v_~A~0.offset_100 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_43 4))))) (= v_thread1Thread1of1ForFork1_~i~0_43 1)) InVars {~A~0.base=v_~A~0.base_100, ~A~0.offset=v_~A~0.offset_100, ~sum1~0=v_~sum1~0_78, #memory_int=|v_#memory_int_171|, ~N~0=v_~N~0_93} OutVars{~A~0.base=v_~A~0.base_100, ~A~0.offset=v_~A~0.offset_100, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_31|, ~sum1~0=v_~sum1~0_77, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_171|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_43, ~N~0=v_~N~0_93} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] [2022-12-06 07:47:36,609 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:47:36,610 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1019 [2022-12-06 07:47:36,610 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 589 transitions, 16006 flow [2022-12-06 07:47:36,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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) [2022-12-06 07:47:36,610 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:47:36,611 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:47:36,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-06 07:47:36,611 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:47:36,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:47:36,611 INFO L85 PathProgramCache]: Analyzing trace with hash 28920814, now seen corresponding path program 1 times [2022-12-06 07:47:36,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:47:36,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035094038] [2022-12-06 07:47:36,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:47:36,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:47:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:47:37,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:47:37,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:47:37,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035094038] [2022-12-06 07:47:37,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035094038] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:47:37,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502859557] [2022-12-06 07:47:37,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:47:37,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:47:37,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:47:37,358 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:47:37,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 07:47:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:47:37,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 07:47:37,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:47:37,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:47:37,632 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:47:37,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 41 [2022-12-06 07:47:37,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:47:37,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:47:37,851 INFO L321 Elim1Store]: treesize reduction 10, result has 76.7 percent of original size [2022-12-06 07:47:37,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 47 [2022-12-06 07:47:38,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:47:38,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502859557] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:47:38,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:47:38,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 17 [2022-12-06 07:47:38,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581036626] [2022-12-06 07:47:38,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:47:38,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 07:47:38,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:47:38,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 07:47:38,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-12-06 07:47:38,139 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 67 [2022-12-06 07:47:38,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 589 transitions, 16006 flow. Second operand has 19 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 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) [2022-12-06 07:47:38,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:47:38,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 67 [2022-12-06 07:47:38,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:47:41,919 INFO L130 PetriNetUnfolder]: 8817/13983 cut-off events. [2022-12-06 07:47:41,919 INFO L131 PetriNetUnfolder]: For 446055/446055 co-relation queries the response was YES. [2022-12-06 07:47:41,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135409 conditions, 13983 events. 8817/13983 cut-off events. For 446055/446055 co-relation queries the response was YES. Maximal size of possible extension queue 881. Compared 96170 event pairs, 3879 based on Foata normal form. 1/13984 useless extension candidates. Maximal degree in co-relation 133921. Up to 13649 conditions per place. [2022-12-06 07:47:42,052 INFO L137 encePairwiseOnDemand]: 24/67 looper letters, 522 selfloop transitions, 143 changer transitions 8/673 dead transitions. [2022-12-06 07:47:42,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 673 transitions, 18375 flow [2022-12-06 07:47:42,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 07:47:42,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 07:47:42,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2022-12-06 07:47:42,054 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17537313432835822 [2022-12-06 07:47:42,054 INFO L175 Difference]: Start difference. First operand has 246 places, 589 transitions, 16006 flow. Second operand 12 states and 141 transitions. [2022-12-06 07:47:42,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 673 transitions, 18375 flow [2022-12-06 07:47:43,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 673 transitions, 18299 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-06 07:47:43,735 INFO L231 Difference]: Finished difference. Result has 259 places, 603 transitions, 16522 flow [2022-12-06 07:47:43,736 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=15934, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=589, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=16522, PETRI_PLACES=259, PETRI_TRANSITIONS=603} [2022-12-06 07:47:43,736 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 229 predicate places. [2022-12-06 07:47:43,736 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:47:43,736 INFO L89 Accepts]: Start accepts. Operand has 259 places, 603 transitions, 16522 flow [2022-12-06 07:47:43,739 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:47:43,739 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:47:43,739 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 259 places, 603 transitions, 16522 flow [2022-12-06 07:47:43,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 258 places, 603 transitions, 16522 flow [2022-12-06 07:47:44,245 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][200], [Black: 1188#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 425#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 269#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))) ~sum2~0) (= ~sum3~0 0) (= ~sum1~0 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 4) (not (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset) 3)) (<= ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset (- 4))))), Black: 1808#(and (<= ~sum1~0 (+ ~sum3~0 ~sum2~0)) (< (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 1 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296))) (<= (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)) (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)))), Black: 1298#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~sum2~0) ~sum1~0) (= ~sum3~0 0)), 1766#(<= ~M~0 2), Black: 1807#(and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0)) (= ~A~0.offset 0) (= ~sum2~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0) ~sum1~0)), Black: 1299#(and (= ~sum3~0 0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), Black: 1806#(and (= ~A~0.offset 0) (or (<= (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1) (* ~N~0 4)) (and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0)) (= ~sum2~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0) ~sum1~0)))), Black: 1296#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum2~0 0) (= ~sum3~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 9#thread2EXITtrue, Black: 1487#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 462#true, Black: 1477#(and (= ~A~0.offset 0) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0)), 14#thread3EXITtrue, Black: 1576#(<= ~N~0 (+ 2 ~M~0)), Black: 1574#true, Black: 1584#(<= 2 ~N~0), Black: 1585#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 1593#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), 361#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 157#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1605#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 ~N~0)), Black: 1607#(and (<= 2 ~M~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 ~N~0)), 622#true, Black: 328#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread1Thread1of1ForFork1_~i~0 1) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1107#(or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) 4294967296))), 1970#(or (= (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) 4294967296) (mod ~sum1~0 4294967296)) (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)), 1707#(or (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (and (<= (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) 4294967296) 4294967296)) (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (* (div ~sum1~0 4294967296) 4294967296))) (< (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) 4294967296) 4294967296) 1)))), Black: 1620#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 ~N~0)), Black: 1618#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 ~N~0)), 1591#(and (<= (+ ~M~0 1) ~N~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), Black: 1857#(and (<= 0 ~M~0) (<= ~M~0 2) (<= 2 thread2Thread1of1ForFork2_~i~1)), 890#(<= 2 ~N~0), Black: 1828#(and (<= 0 ~M~0) (<= ~M~0 2)), 752#true, 1853#(and (<= 0 ~M~0) (<= ~M~0 2) (<= 1 thread2Thread1of1ForFork2_~i~1)), Black: 523#(and (<= 0 (+ ~sum1~0 4294967296)) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), 403#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 788#(and (= ~A~0.offset 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 493#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 817#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 485#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 2147483647) (= ~sum2~0 0) (= ~sum3~0 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483647) (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))), Black: 612#(and (<= 0 (+ ~sum1~0 4294967296)) (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int))) (= (mod (+ ~sum3~0 ~sum2~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) ~A~0.offset) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_788) ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0) 4294967296))) (= ~sum2~0 ~sum1~0) (= ~sum3~0 0) (<= ~sum1~0 4294967294)), Black: 795#(and (= ~sum2~0 ~sum1~0) (= ~sum3~0 0)), Black: 839#(= (mod (+ ~sum3~0 ~sum2~0) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), 1798#(and (<= 0 ~M~0) (<= ~M~0 2) (<= ~M~0 ~N~0) (<= ~M~0 thread2Thread1of1ForFork2_~i~1)), Black: 884#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0)), 1156#true, Black: 1018#(and (not (< 2 ~N~0)) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0) (< 1 ~N~0)), Black: 1074#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 1006#true, Black: 381#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), Black: 1136#(and (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (= ~A~0.offset 0) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum3~0) (<= ~sum3~0 (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (< 3 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4)))), Black: 2085#(and (= ~A~0.offset 0) (exists ((v_thread3Thread1of1ForFork0_~i~2_290 Int)) (and (<= v_thread3Thread1of1ForFork0_~i~2_290 1) (= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_290 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* v_thread3Thread1of1ForFork0_~i~2_290 4)))) ~sum3~0) (<= thread3Thread1of1ForFork0_~i~2 (+ v_thread3Thread1of1ForFork0_~i~2_290 1)))) (= ~sum2~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 1)), Black: 2089#(and (or (<= thread3Thread1of1ForFork0_~i~2 1) (and (<= thread3Thread1of1ForFork0_~i~2 2) (= ~sum3~0 ~sum1~0))) (= ~sum2~0 0) (<= 2 ~N~0)), Black: 2177#(and (<= thread3Thread1of1ForFork0_~i~2 2) (= ~sum2~0 0) (< 1 ~N~0) (= ~sum3~0 ~sum1~0)), Black: 2122#(or (= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), Black: 1341#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) ~sum1~0) (= thread2Thread1of1ForFork2_~i~1 1) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0)), Black: 151#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 1348#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), 354#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1370#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), Black: 408#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1427#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4))) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 410#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 1425#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1440#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), Black: 153#true, 1442#true, 1777#true, 1816#(<= ~N~0 2), Black: 430#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 12#L48-5true, Black: 442#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= thread2Thread1of1ForFork2_~i~1 1) (<= (+ 2 thread3Thread1of1ForFork0_~i~2) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), 1579#(and (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= ~N~0 (+ 2 ~M~0))), Black: 459#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|)), Black: 204#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 202#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), 2047#true, 1293#true, 49#L85-1true, 2041#(and (<= 0 ~M~0) (<= ~N~0 (+ 2 ~M~0)) (<= ~M~0 ~N~0) (<= ~N~0 thread3Thread1of1ForFork0_~i~2)), Black: 217#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0))), Black: 1743#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= 2 thread1Thread1of1ForFork1_~i~0) (= ~sum3~0 0) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= ~N~0 2)), Black: 1666#(and (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum2~0) (= ~A~0.offset 0) (<= 1 thread3Thread1of1ForFork0_~i~2) (= ~sum3~0 0) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum1~0) (<= ~N~0 2)), Black: 2019#(and (= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)) (or (= (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) 4294967296) (mod ~sum1~0 4294967296)) (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0))), Black: 1950#(= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)), 457#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (+ ~N~0 ~M~0)) (<= 2 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= 1 ~M~0)), Black: 1966#(or (= (mod ~sum1~0 4294967296) (mod (+ ~sum3~0 ~sum2~0) 4294967296)) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), Black: 1887#(and (= ~A~0.offset 0) (or (<= (* ~N~0 4) (+ 3 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~sum1~0 (+ ~sum3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (<= (+ ~sum3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) ~sum1~0) (= ~sum2~0 0)) (<= (+ 5 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)))), Black: 1930#(and (<= 0 (+ ~sum1~0 4294967296)) (not (< 2 ~N~0)) (or (and (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum3~0 ~sum1~0)) (<= thread3Thread1of1ForFork0_~i~2 1)) (= ~sum2~0 0) (< 1 ~N~0) (<= ~sum1~0 4294967294)), 1303#true, Black: 1882#true, Black: 923#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0)), Black: 2021#(and (<= 0 (+ ~sum1~0 4294967296)) (not (< 2 ~N~0)) (or (= (mod (+ ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) 4294967296) (mod ~sum1~0 4294967296)) (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum2~0 0) (< 1 ~N~0) (= ~sum3~0 ~sum1~0) (<= ~sum1~0 4294967294)), Black: 1001#(and (<= 2 ~N~0) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0))), Black: 627#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= ~sum3~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 1) (<= (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 724#(= (mod (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0 ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 4294967296) (mod (+ ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) 4294967296)), 1614#(and (= thread2Thread1of1ForFork2_~i~1 1) (<= 2 ~N~0)), 1774#(and (<= ~N~0 thread3Thread1of1ForFork0_~i~2) (<= ~N~0 2)), 371#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 2043#(and (<= 0 ~M~0) (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= ~N~0 (+ 2 ~M~0)) (<= ~M~0 ~N~0)), Black: 1784#(and (<= ~sum1~0 (+ ~sum3~0 ~sum2~0)) (not (<= (+ ~sum1~0 1 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)) (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)))) (<= (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)) (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)))), Black: 1783#(or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (and (<= ~sum1~0 (+ ~sum3~0 ~sum2~0)) (not (<= (+ ~sum1~0 1 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)) (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)))) (<= (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)) (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296))))), 388#(<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)), Black: 1782#(and (= ~A~0.offset 0) (or (<= (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1) (* ~N~0 4)) (and (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~sum2~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum3~0) ~sum1~0)))), Black: 1159#(and (= ~A~0.offset 0) (= ~sum2~0 0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 4) (= ~sum3~0 0) (<= ~sum1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~sum1~0))]) [2022-12-06 07:47:44,245 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:47:44,245 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:47:44,245 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:47:44,245 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:47:44,451 INFO L130 PetriNetUnfolder]: 2131/5228 cut-off events. [2022-12-06 07:47:44,452 INFO L131 PetriNetUnfolder]: For 137036/137557 co-relation queries the response was YES. [2022-12-06 07:47:44,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46490 conditions, 5228 events. 2131/5228 cut-off events. For 137036/137557 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 51086 event pairs, 657 based on Foata normal form. 71/4925 useless extension candidates. Maximal degree in co-relation 46352. Up to 2071 conditions per place. [2022-12-06 07:47:44,541 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 258 places, 603 transitions, 16522 flow [2022-12-06 07:47:44,541 INFO L188 LiptonReduction]: Number of co-enabled transitions 3450 [2022-12-06 07:47:44,552 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [611] $Ultimate##0-->L64-5: Formula: (let ((.cse0 (select |v_#memory_int_389| v_~A~0.base_263))) (and (not (< v_thread2Thread1of1ForFork2_~i~1_199 v_~M~0_201)) (= v_thread2Thread1of1ForFork2_~i~1_199 0) (< v_thread1Thread1of1ForFork1_~i~0_201 (+ v_~N~0_247 1)) (= (+ (select .cse0 (+ v_~A~0.offset_263 (- 4) (* v_thread3Thread1of1ForFork0_~i~2_260 4))) v_~sum3~0_217) v_~sum3~0_216) (= v_thread1Thread1of1ForFork1_~i~0_201 1) (= (+ v_~M~0_201 1) v_thread3Thread1of1ForFork0_~i~2_260) (= v_~sum1~0_341 (+ (select .cse0 (+ v_~A~0.offset_263 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_201 4))) v_~sum1~0_342)) (= |v_thread2Thread1of1ForFork2_#res.offset_75| 0) (= |v_thread2Thread1of1ForFork2_#res.base_75| 0))) InVars {~A~0.base=v_~A~0.base_263, ~A~0.offset=v_~A~0.offset_263, ~sum1~0=v_~sum1~0_342, ~M~0=v_~M~0_201, #memory_int=|v_#memory_int_389|, ~sum3~0=v_~sum3~0_217, ~N~0=v_~N~0_247} OutVars{~A~0.base=v_~A~0.base_263, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_260, ~sum3~0=v_~sum3~0_216, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_201, ~N~0=v_~N~0_247, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_123|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_199, ~A~0.offset=v_~A~0.offset_263, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_179|, ~sum1~0=v_~sum1~0_341, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_75|, ~M~0=v_~M~0_201, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_171|, #memory_int=|v_#memory_int_389|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_121|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_75|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread2Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5, thread2Thread1of1ForFork2_#res.offset] and [503] L48-5-->L48-5: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_36 v_~N~0_63) (= v_thread1Thread1of1ForFork1_~i~0_35 (+ v_thread1Thread1of1ForFork1_~i~0_36 1)) (= v_~sum1~0_53 (+ v_~sum1~0_54 (select (select |v_#memory_int_127| v_~A~0.base_64) (+ (* v_thread1Thread1of1ForFork1_~i~0_36 4) v_~A~0.offset_64))))) InVars {~A~0.base=v_~A~0.base_64, ~A~0.offset=v_~A~0.offset_64, ~sum1~0=v_~sum1~0_54, #memory_int=|v_#memory_int_127|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_36, ~N~0=v_~N~0_63} OutVars{~A~0.base=v_~A~0.base_64, ~A~0.offset=v_~A~0.offset_64, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_27|, ~sum1~0=v_~sum1~0_53, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, #memory_int=|v_#memory_int_127|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, ~N~0=v_~N~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] [2022-12-06 07:47:44,729 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:47:44,729 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 993 [2022-12-06 07:47:44,730 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 603 transitions, 16594 flow [2022-12-06 07:47:44,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 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) [2022-12-06 07:47:44,730 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:47:44,730 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:47:44,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 07:47:44,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-12-06 07:47:44,936 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:47:44,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:47:44,936 INFO L85 PathProgramCache]: Analyzing trace with hash -111558707, now seen corresponding path program 1 times [2022-12-06 07:47:44,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:47:44,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578999530] [2022-12-06 07:47:44,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:47:44,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:47:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:47:45,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:47:45,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:47:45,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578999530] [2022-12-06 07:47:45,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578999530] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:47:45,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107402822] [2022-12-06 07:47:45,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:47:45,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:47:45,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:47:45,300 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:47:45,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 07:47:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:47:45,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-06 07:47:45,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:47:45,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:47:45,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 07:47:45,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:47:45,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-12-06 07:47:45,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:47:45,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-12-06 07:47:45,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:47:45,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-12-06 07:47:45,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:47:45,825 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:47:45,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 59 [2022-12-06 07:47:45,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:47:45,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:47:48,073 WARN L837 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1859 (Array Int Int))) (or (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1859) c_~A~0.base))) (= (mod (+ c_~sum1~0 (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4))) 4294967296) (mod (let ((.cse1 (* ~M~0 4))) (+ (select .cse0 (+ c_~A~0.offset .cse1)) c_~sum3~0 (select .cse0 (+ c_~A~0.offset .cse1 4)) c_~sum2~0)) 4294967296))) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0))) is different from false [2022-12-06 07:47:48,100 WARN L837 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1859 (Array Int Int)) (v_ArrVal_1858 (Array Int Int))) (or (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1858) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1859) c_~A~0.base))) (= (mod (let ((.cse1 (* ~M~0 4))) (+ c_~sum3~0 (select .cse0 (+ c_~A~0.offset .cse1)) c_~sum2~0 (select .cse0 (+ c_~A~0.offset .cse1 4)))) 4294967296) (mod (+ (select .cse0 (+ c_~A~0.offset 4)) c_~sum1~0 (select .cse0 c_~A~0.offset)) 4294967296))) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0))) is different from false [2022-12-06 07:47:48,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:47:48,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107402822] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:47:48,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:47:48,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 19 [2022-12-06 07:47:48,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869417701] [2022-12-06 07:47:48,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:47:48,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 07:47:48,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:47:48,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 07:47:48,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=263, Unknown=2, NotChecked=70, Total=420 [2022-12-06 07:47:48,112 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 68 [2022-12-06 07:47:48,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 603 transitions, 16594 flow. Second operand has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 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) [2022-12-06 07:47:48,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:47:48,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 68 [2022-12-06 07:47:48,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:47:52,094 INFO L130 PetriNetUnfolder]: 8879/14111 cut-off events. [2022-12-06 07:47:52,094 INFO L131 PetriNetUnfolder]: For 459156/459156 co-relation queries the response was YES. [2022-12-06 07:47:52,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138899 conditions, 14111 events. 8879/14111 cut-off events. For 459156/459156 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 97524 event pairs, 3868 based on Foata normal form. 1/14112 useless extension candidates. Maximal degree in co-relation 138507. Up to 13736 conditions per place. [2022-12-06 07:47:52,226 INFO L137 encePairwiseOnDemand]: 23/68 looper letters, 548 selfloop transitions, 154 changer transitions 13/715 dead transitions. [2022-12-06 07:47:52,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 715 transitions, 19493 flow [2022-12-06 07:47:52,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 07:47:52,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 07:47:52,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 171 transitions. [2022-12-06 07:47:52,227 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14792387543252594 [2022-12-06 07:47:52,227 INFO L175 Difference]: Start difference. First operand has 258 places, 603 transitions, 16594 flow. Second operand 17 states and 171 transitions. [2022-12-06 07:47:52,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 715 transitions, 19493 flow [2022-12-06 07:47:54,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 715 transitions, 19128 flow, removed 171 selfloop flow, removed 2 redundant places. [2022-12-06 07:47:54,074 INFO L231 Difference]: Finished difference. Result has 277 places, 623 transitions, 17107 flow [2022-12-06 07:47:54,075 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=16375, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=17107, PETRI_PLACES=277, PETRI_TRANSITIONS=623} [2022-12-06 07:47:54,075 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 247 predicate places. [2022-12-06 07:47:54,075 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:47:54,075 INFO L89 Accepts]: Start accepts. Operand has 277 places, 623 transitions, 17107 flow [2022-12-06 07:47:54,078 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:47:54,078 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:47:54,078 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 277 places, 623 transitions, 17107 flow [2022-12-06 07:47:54,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 276 places, 623 transitions, 17107 flow [2022-12-06 07:47:54,867 INFO L130 PetriNetUnfolder]: 2169/5330 cut-off events. [2022-12-06 07:47:54,867 INFO L131 PetriNetUnfolder]: For 147890/148470 co-relation queries the response was YES. [2022-12-06 07:47:54,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48221 conditions, 5330 events. 2169/5330 cut-off events. For 147890/148470 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 52268 event pairs, 644 based on Foata normal form. 59/5008 useless extension candidates. Maximal degree in co-relation 48089. Up to 2094 conditions per place. [2022-12-06 07:47:54,947 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 276 places, 623 transitions, 17107 flow [2022-12-06 07:47:54,947 INFO L188 LiptonReduction]: Number of co-enabled transitions 3522 [2022-12-06 07:47:54,958 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [503] L48-5-->L48-5: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_36 v_~N~0_63) (= v_thread1Thread1of1ForFork1_~i~0_35 (+ v_thread1Thread1of1ForFork1_~i~0_36 1)) (= v_~sum1~0_53 (+ v_~sum1~0_54 (select (select |v_#memory_int_127| v_~A~0.base_64) (+ (* v_thread1Thread1of1ForFork1_~i~0_36 4) v_~A~0.offset_64))))) InVars {~A~0.base=v_~A~0.base_64, ~A~0.offset=v_~A~0.offset_64, ~sum1~0=v_~sum1~0_54, #memory_int=|v_#memory_int_127|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_36, ~N~0=v_~N~0_63} OutVars{~A~0.base=v_~A~0.base_64, ~A~0.offset=v_~A~0.offset_64, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_27|, ~sum1~0=v_~sum1~0_53, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, #memory_int=|v_#memory_int_127|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, ~N~0=v_~N~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [505] L64-5-->L64-5: Formula: (and (= (+ v_thread3Thread1of1ForFork0_~i~2_38 1) v_thread3Thread1of1ForFork0_~i~2_37) (= (+ v_~sum3~0_36 (select (select |v_#memory_int_131| v_~A~0.base_68) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_38) v_~A~0.offset_68))) v_~sum3~0_35) (< v_thread3Thread1of1ForFork0_~i~2_38 v_~N~0_69)) InVars {~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_38, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_36, ~N~0=v_~N~0_69} OutVars{~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_37, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_35, ~N~0=v_~N~0_69, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_21|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5] [2022-12-06 07:47:55,139 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [616] $Ultimate##0-->L48-5: Formula: (let ((.cse0 (select |v_#memory_int_406| v_~A~0.base_273))) (and (= v_thread2Thread1of1ForFork2_~i~1_209 0) (= (+ (select .cse0 (+ v_~A~0.offset_273 (- 4) (* v_thread3Thread1of1ForFork0_~i~2_284 4))) v_~sum3~0_241) v_~sum3~0_240) (= v_thread3Thread1of1ForFork0_~i~2_284 (+ v_~M~0_207 1)) (< v_thread1Thread1of1ForFork1_~i~0_207 (+ v_~N~0_257 1)) (= |v_thread2Thread1of1ForFork2_#res.offset_81| 0) (= (+ (select .cse0 (+ (* v_thread1Thread1of1ForFork1_~i~0_207 4) v_~A~0.offset_273 (- 4))) v_~sum1~0_352) v_~sum1~0_351) (= |v_thread2Thread1of1ForFork2_#res.base_81| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_209 v_~M~0_207)) (= v_thread1Thread1of1ForFork1_~i~0_207 1))) InVars {~A~0.base=v_~A~0.base_273, ~A~0.offset=v_~A~0.offset_273, ~sum1~0=v_~sum1~0_352, ~M~0=v_~M~0_207, #memory_int=|v_#memory_int_406|, ~sum3~0=v_~sum3~0_241, ~N~0=v_~N~0_257} OutVars{~A~0.base=v_~A~0.base_273, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_284, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_207, ~sum3~0=v_~sum3~0_240, ~N~0=v_~N~0_257, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_138|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_209, ~A~0.offset=v_~A~0.offset_273, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_185|, ~sum1~0=v_~sum1~0_351, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_81|, ~M~0=v_~M~0_207, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_177|, #memory_int=|v_#memory_int_406|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_136|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_81|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread2Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_~i~2, thread1Thread1of1ForFork1_~i~0, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5, thread2Thread1of1ForFork2_#res.offset] and [505] L64-5-->L64-5: Formula: (and (= (+ v_thread3Thread1of1ForFork0_~i~2_38 1) v_thread3Thread1of1ForFork0_~i~2_37) (= (+ v_~sum3~0_36 (select (select |v_#memory_int_131| v_~A~0.base_68) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_38) v_~A~0.offset_68))) v_~sum3~0_35) (< v_thread3Thread1of1ForFork0_~i~2_38 v_~N~0_69)) InVars {~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_38, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_36, ~N~0=v_~N~0_69} OutVars{~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_37, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_35, ~N~0=v_~N~0_69, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_21|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5] [2022-12-06 07:47:55,403 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [617] $Ultimate##0-->L64-5: Formula: (and (not (< v_thread2Thread1of1ForFork2_~i~1_211 v_~M~0_209)) (= (let ((.cse0 (select |v_#memory_int_408| v_~A~0.base_275)) (.cse1 (* v_~M~0_209 4))) (+ v_~sum3~0_246 (select .cse0 (+ .cse1 v_~A~0.offset_275)) (select .cse0 (+ .cse1 v_~A~0.offset_275 4)))) v_~sum3~0_244) (= |v_thread2Thread1of1ForFork2_#res.base_83| 0) (= v_thread2Thread1of1ForFork2_~i~1_211 0) (< (+ v_~M~0_209 1) v_~N~0_259) (= |v_thread2Thread1of1ForFork2_#res.offset_83| 0) (= (+ v_~M~0_209 2) v_thread3Thread1of1ForFork0_~i~2_286)) InVars {~A~0.base=v_~A~0.base_275, ~A~0.offset=v_~A~0.offset_275, ~M~0=v_~M~0_209, #memory_int=|v_#memory_int_408|, ~sum3~0=v_~sum3~0_246, ~N~0=v_~N~0_259} OutVars{~A~0.base=v_~A~0.base_275, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_211, ~A~0.offset=v_~A~0.offset_275, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_83|, ~M~0=v_~M~0_209, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_286, #memory_int=|v_#memory_int_408|, ~sum3~0=v_~sum3~0_244, ~N~0=v_~N~0_259, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_140|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_138|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_83|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5, thread2Thread1of1ForFork2_#res.offset] and [532] $Ultimate##0-->L48-5: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_43 (+ 1 v_~N~0_93)) (= v_~sum1~0_77 (+ v_~sum1~0_78 (select (select |v_#memory_int_171| v_~A~0.base_100) (+ v_~A~0.offset_100 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_43 4))))) (= v_thread1Thread1of1ForFork1_~i~0_43 1)) InVars {~A~0.base=v_~A~0.base_100, ~A~0.offset=v_~A~0.offset_100, ~sum1~0=v_~sum1~0_78, #memory_int=|v_#memory_int_171|, ~N~0=v_~N~0_93} OutVars{~A~0.base=v_~A~0.base_100, ~A~0.offset=v_~A~0.offset_100, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_31|, ~sum1~0=v_~sum1~0_77, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_171|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_43, ~N~0=v_~N~0_93} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] [2022-12-06 07:47:55,596 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [503] L48-5-->L48-5: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_36 v_~N~0_63) (= v_thread1Thread1of1ForFork1_~i~0_35 (+ v_thread1Thread1of1ForFork1_~i~0_36 1)) (= v_~sum1~0_53 (+ v_~sum1~0_54 (select (select |v_#memory_int_127| v_~A~0.base_64) (+ (* v_thread1Thread1of1ForFork1_~i~0_36 4) v_~A~0.offset_64))))) InVars {~A~0.base=v_~A~0.base_64, ~A~0.offset=v_~A~0.offset_64, ~sum1~0=v_~sum1~0_54, #memory_int=|v_#memory_int_127|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_36, ~N~0=v_~N~0_63} OutVars{~A~0.base=v_~A~0.base_64, ~A~0.offset=v_~A~0.offset_64, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_27|, ~sum1~0=v_~sum1~0_53, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, #memory_int=|v_#memory_int_127|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, ~N~0=v_~N~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [505] L64-5-->L64-5: Formula: (and (= (+ v_thread3Thread1of1ForFork0_~i~2_38 1) v_thread3Thread1of1ForFork0_~i~2_37) (= (+ v_~sum3~0_36 (select (select |v_#memory_int_131| v_~A~0.base_68) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_38) v_~A~0.offset_68))) v_~sum3~0_35) (< v_thread3Thread1of1ForFork0_~i~2_38 v_~N~0_69)) InVars {~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_38, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_36, ~N~0=v_~N~0_69} OutVars{~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_37, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_35, ~N~0=v_~N~0_69, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_21|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5] [2022-12-06 07:47:55,642 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [622] $Ultimate##0-->L48-5: Formula: (let ((.cse0 (select |v_#memory_int_425| v_~A~0.base_285))) (and (= |v_thread2Thread1of1ForFork2_#res.base_93| 0) (= v_~sum1~0_383 (+ v_~sum1~0_385 (select .cse0 (+ v_~A~0.offset_285 4)) (select .cse0 (+ v_~A~0.offset_285 8)) (select .cse0 v_~A~0.offset_285))) (= |v_thread2Thread1of1ForFork2_#res.offset_93| 0) (= (+ (select .cse0 (+ v_~A~0.offset_285 (- 4) (* v_thread3Thread1of1ForFork0_~i~2_306 4))) v_~sum3~0_271) v_~sum3~0_270) (= 3 v_thread1Thread1of1ForFork1_~i~0_231) (not (< v_thread2Thread1of1ForFork2_~i~1_221 v_~M~0_215)) (< 2 v_~N~0_269) (= v_thread3Thread1of1ForFork0_~i~2_306 (+ v_~M~0_215 1)) (= v_thread2Thread1of1ForFork2_~i~1_221 0))) InVars {~A~0.base=v_~A~0.base_285, ~A~0.offset=v_~A~0.offset_285, ~sum1~0=v_~sum1~0_385, ~M~0=v_~M~0_215, #memory_int=|v_#memory_int_425|, ~sum3~0=v_~sum3~0_271, ~N~0=v_~N~0_269} OutVars{~A~0.base=v_~A~0.base_285, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_306, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_231, ~sum3~0=v_~sum3~0_270, ~N~0=v_~N~0_269, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_157|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_221, ~A~0.offset=v_~A~0.offset_285, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_205|, ~sum1~0=v_~sum1~0_383, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_93|, ~M~0=v_~M~0_215, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_197|, #memory_int=|v_#memory_int_425|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_155|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_93|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread2Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_~i~2, thread1Thread1of1ForFork1_~i~0, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5, thread2Thread1of1ForFork2_#res.offset] and [505] L64-5-->L64-5: Formula: (and (= (+ v_thread3Thread1of1ForFork0_~i~2_38 1) v_thread3Thread1of1ForFork0_~i~2_37) (= (+ v_~sum3~0_36 (select (select |v_#memory_int_131| v_~A~0.base_68) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_38) v_~A~0.offset_68))) v_~sum3~0_35) (< v_thread3Thread1of1ForFork0_~i~2_38 v_~N~0_69)) InVars {~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_38, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_36, ~N~0=v_~N~0_69} OutVars{~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_37, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_35, ~N~0=v_~N~0_69, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_21|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5] [2022-12-06 07:47:56,111 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [618] $Ultimate##0-->L48-5: Formula: (let ((.cse0 (select |v_#memory_int_412| v_~A~0.base_277))) (and (= |v_thread2Thread1of1ForFork2_#res.offset_87| 0) (= 2 v_thread1Thread1of1ForFork1_~i~0_212) (= v_thread2Thread1of1ForFork2_~i~1_215 0) (= v_~sum1~0_359 (+ v_~sum1~0_361 (select .cse0 v_~A~0.offset_277) (select .cse0 (+ v_~A~0.offset_277 4)))) (= |v_thread2Thread1of1ForFork2_#res.base_87| 0) (= v_~sum3~0_254 (+ (select .cse0 (+ v_~A~0.offset_277 (- 4) (* v_thread3Thread1of1ForFork0_~i~2_294 4))) v_~sum3~0_255)) (= v_thread3Thread1of1ForFork0_~i~2_294 (+ v_~M~0_211 1)) (< 1 v_~N~0_261) (not (< v_thread2Thread1of1ForFork2_~i~1_215 v_~M~0_211)))) InVars {~A~0.base=v_~A~0.base_277, ~A~0.offset=v_~A~0.offset_277, ~sum1~0=v_~sum1~0_361, ~M~0=v_~M~0_211, #memory_int=|v_#memory_int_412|, ~sum3~0=v_~sum3~0_255, ~N~0=v_~N~0_261} OutVars{~A~0.base=v_~A~0.base_277, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_294, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_212, ~sum3~0=v_~sum3~0_254, ~N~0=v_~N~0_261, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_147|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_215, ~A~0.offset=v_~A~0.offset_277, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_190|, ~sum1~0=v_~sum1~0_359, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_87|, ~M~0=v_~M~0_211, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_182|, #memory_int=|v_#memory_int_412|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_145|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_87|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread2Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_~i~2, thread1Thread1of1ForFork1_~i~0, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5, thread2Thread1of1ForFork2_#res.offset] and [505] L64-5-->L64-5: Formula: (and (= (+ v_thread3Thread1of1ForFork0_~i~2_38 1) v_thread3Thread1of1ForFork0_~i~2_37) (= (+ v_~sum3~0_36 (select (select |v_#memory_int_131| v_~A~0.base_68) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_38) v_~A~0.offset_68))) v_~sum3~0_35) (< v_thread3Thread1of1ForFork0_~i~2_38 v_~N~0_69)) InVars {~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_38, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_36, ~N~0=v_~N~0_69} OutVars{~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_37, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_35, ~N~0=v_~N~0_69, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_21|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5] [2022-12-06 07:47:56,307 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [631] $Ultimate##0-->L48-5: Formula: (let ((.cse0 (select |v_#memory_int_443| v_~A~0.base_303))) (and (= |v_thread2Thread1of1ForFork2_#res.offset_105| 0) (= v_thread3Thread1of1ForFork0_~i~2_330 (+ v_~M~0_227 1)) (not (< v_thread2Thread1of1ForFork2_~i~1_233 v_~M~0_227)) (< v_thread1Thread1of1ForFork1_~i~0_261 (+ v_~N~0_287 1)) (= v_thread1Thread1of1ForFork1_~i~0_261 4) (= (+ (select .cse0 (+ v_~A~0.offset_303 (- 4) (* v_thread3Thread1of1ForFork0_~i~2_330 4))) v_~sum3~0_307) v_~sum3~0_306) (= |v_thread2Thread1of1ForFork2_#res.base_105| 0) (= v_thread2Thread1of1ForFork2_~i~1_233 0) (= v_~sum1~0_423 (+ (select .cse0 (+ (* v_thread1Thread1of1ForFork1_~i~0_261 4) v_~A~0.offset_303 (- 4))) v_~sum1~0_425 (select .cse0 v_~A~0.offset_303) (select .cse0 (+ v_~A~0.offset_303 4)) (select .cse0 (+ v_~A~0.offset_303 8)))))) InVars {~A~0.base=v_~A~0.base_303, ~A~0.offset=v_~A~0.offset_303, ~sum1~0=v_~sum1~0_425, ~M~0=v_~M~0_227, #memory_int=|v_#memory_int_443|, ~sum3~0=v_~sum3~0_307, ~N~0=v_~N~0_287} OutVars{~A~0.base=v_~A~0.base_303, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_330, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_261, ~sum3~0=v_~sum3~0_306, ~N~0=v_~N~0_287, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_179|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_233, ~A~0.offset=v_~A~0.offset_303, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_229|, ~sum1~0=v_~sum1~0_423, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_105|, ~M~0=v_~M~0_227, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_221|, #memory_int=|v_#memory_int_443|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_177|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_105|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread2Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_~i~2, thread1Thread1of1ForFork1_~i~0, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5, thread2Thread1of1ForFork2_#res.offset] and [505] L64-5-->L64-5: Formula: (and (= (+ v_thread3Thread1of1ForFork0_~i~2_38 1) v_thread3Thread1of1ForFork0_~i~2_37) (= (+ v_~sum3~0_36 (select (select |v_#memory_int_131| v_~A~0.base_68) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_38) v_~A~0.offset_68))) v_~sum3~0_35) (< v_thread3Thread1of1ForFork0_~i~2_38 v_~N~0_69)) InVars {~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_38, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_36, ~N~0=v_~N~0_69} OutVars{~A~0.base=v_~A~0.base_68, ~A~0.offset=v_~A~0.offset_68, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_37, #memory_int=|v_#memory_int_131|, ~sum3~0=v_~sum3~0_35, ~N~0=v_~N~0_69, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_21|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5] [2022-12-06 07:47:56,426 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 07:47:56,427 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2352 [2022-12-06 07:47:56,427 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 619 transitions, 17422 flow [2022-12-06 07:47:56,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 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) [2022-12-06 07:47:56,427 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:47:56,427 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:47:56,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 07:47:56,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2022-12-06 07:47:56,628 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:47:56,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:47:56,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1797684037, now seen corresponding path program 1 times [2022-12-06 07:47:56,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:47:56,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271407319] [2022-12-06 07:47:56,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:47:56,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:47:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:47:57,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:47:57,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:47:57,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271407319] [2022-12-06 07:47:57,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271407319] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:47:57,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:47:57,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:47:57,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364803199] [2022-12-06 07:47:57,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:47:57,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:47:57,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:47:57,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:47:57,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:47:57,172 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 78 [2022-12-06 07:47:57,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 619 transitions, 17422 flow. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2022-12-06 07:47:57,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:47:57,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 78 [2022-12-06 07:47:57,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:48:00,456 INFO L130 PetriNetUnfolder]: 8868/14084 cut-off events. [2022-12-06 07:48:00,456 INFO L131 PetriNetUnfolder]: For 485214/485214 co-relation queries the response was YES. [2022-12-06 07:48:00,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141320 conditions, 14084 events. 8868/14084 cut-off events. For 485214/485214 co-relation queries the response was YES. Maximal size of possible extension queue 871. Compared 97272 event pairs, 3928 based on Foata normal form. 1/14083 useless extension candidates. Maximal degree in co-relation 140805. Up to 14005 conditions per place. [2022-12-06 07:48:00,592 INFO L137 encePairwiseOnDemand]: 30/78 looper letters, 590 selfloop transitions, 50 changer transitions 8/648 dead transitions. [2022-12-06 07:48:00,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 648 transitions, 18987 flow [2022-12-06 07:48:00,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:48:00,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:48:00,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2022-12-06 07:48:00,593 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2846153846153846 [2022-12-06 07:48:00,593 INFO L175 Difference]: Start difference. First operand has 272 places, 619 transitions, 17422 flow. Second operand 5 states and 111 transitions. [2022-12-06 07:48:00,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 648 transitions, 18987 flow [2022-12-06 07:48:02,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 648 transitions, 18588 flow, removed 117 selfloop flow, removed 6 redundant places. [2022-12-06 07:48:02,741 INFO L231 Difference]: Finished difference. Result has 272 places, 622 transitions, 17209 flow [2022-12-06 07:48:02,742 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=17023, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=619, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=17209, PETRI_PLACES=272, PETRI_TRANSITIONS=622} [2022-12-06 07:48:02,742 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 242 predicate places. [2022-12-06 07:48:02,742 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:02,742 INFO L89 Accepts]: Start accepts. Operand has 272 places, 622 transitions, 17209 flow [2022-12-06 07:48:02,744 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:02,744 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:02,744 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 272 places, 622 transitions, 17209 flow [2022-12-06 07:48:02,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 269 places, 622 transitions, 17209 flow [2022-12-06 07:48:03,464 INFO L130 PetriNetUnfolder]: 2160/5315 cut-off events. [2022-12-06 07:48:03,464 INFO L131 PetriNetUnfolder]: For 152921/153475 co-relation queries the response was YES. [2022-12-06 07:48:03,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48738 conditions, 5315 events. 2160/5315 cut-off events. For 152921/153475 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 52132 event pairs, 654 based on Foata normal form. 60/4993 useless extension candidates. Maximal degree in co-relation 48470. Up to 2102 conditions per place. [2022-12-06 07:48:03,557 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 269 places, 622 transitions, 17209 flow [2022-12-06 07:48:03,558 INFO L188 LiptonReduction]: Number of co-enabled transitions 3506 [2022-12-06 07:48:03,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-12-06 07:48:03,566 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IndexOutOfBoundsException: Index 17 out of bounds for length 17 at java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) at java.base/jdk.internal.util.Preconditions.outOfBoundsCheckIndex(Preconditions.java:70) at java.base/jdk.internal.util.Preconditions.checkIndex(Preconditions.java:248) at java.base/java.util.Objects.checkIndex(Objects.java:372) at java.base/java.util.ArrayList.get(ArrayList.java:459) at de.uni_freiburg.informatik.ultimate.automata.petrinet.PetriNetRun.getTransition(PetriNetRun.java:125) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.adaptRun(ChoiceRule.java:163) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.applyInternal(ChoiceRule.java:115) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.choiceRuleWrapper(LiptonReduction.java:239) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:200) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 07:48:03,569 INFO L158 Benchmark]: Toolchain (without parser) took 188741.54ms. Allocated memory was 175.1MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 139.3MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. [2022-12-06 07:48:03,569 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 127.9MB. Free memory was 110.7MB in the beginning and 110.6MB in the end (delta: 75.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:48:03,569 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.75ms. Allocated memory is still 175.1MB. Free memory was 138.9MB in the beginning and 127.7MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-12-06 07:48:03,569 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.25ms. Allocated memory is still 175.1MB. Free memory was 127.7MB in the beginning and 125.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:48:03,569 INFO L158 Benchmark]: Boogie Preprocessor took 90.76ms. Allocated memory is still 175.1MB. Free memory was 125.9MB in the beginning and 153.9MB in the end (delta: -28.0MB). Peak memory consumption was 4.8MB. Max. memory is 8.0GB. [2022-12-06 07:48:03,570 INFO L158 Benchmark]: RCFGBuilder took 495.33ms. Allocated memory is still 175.1MB. Free memory was 153.9MB in the beginning and 138.2MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-12-06 07:48:03,570 INFO L158 Benchmark]: TraceAbstraction took 187879.17ms. Allocated memory was 175.1MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 137.1MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. [2022-12-06 07:48:03,570 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 127.9MB. Free memory was 110.7MB in the beginning and 110.6MB in the end (delta: 75.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 239.75ms. Allocated memory is still 175.1MB. Free memory was 138.9MB in the beginning and 127.7MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.25ms. Allocated memory is still 175.1MB. Free memory was 127.7MB in the beginning and 125.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 90.76ms. Allocated memory is still 175.1MB. Free memory was 125.9MB in the beginning and 153.9MB in the end (delta: -28.0MB). Peak memory consumption was 4.8MB. Max. memory is 8.0GB. * RCFGBuilder took 495.33ms. Allocated memory is still 175.1MB. Free memory was 153.9MB in the beginning and 138.2MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 187879.17ms. Allocated memory was 175.1MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 137.1MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 133 PlacesBefore, 30 PlacesAfterwards, 135 TransitionsBefore, 24 TransitionsAfterwards, 1728 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 67 TrivialYvCompositions, 36 ConcurrentYvCompositions, 8 ChoiceCompositions, 111 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 959, independent: 952, independent conditional: 952, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 959, independent: 952, independent conditional: 0, independent unconditional: 952, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 959, independent: 952, independent conditional: 0, independent unconditional: 952, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 959, independent: 952, independent conditional: 0, independent unconditional: 952, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 959, independent: 952, independent conditional: 0, independent unconditional: 952, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 959, independent: 952, independent conditional: 0, independent unconditional: 952, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 959, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 959, unknown conditional: 0, unknown unconditional: 959] , Statistics on independence cache: Total cache size (in pairs): 1530, Positive cache size: 1523, Positive conditional cache size: 0, Positive unconditional cache size: 1523, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 27 PlacesBefore, 27 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 35 PlacesBefore, 35 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 36 PlacesBefore, 35 PlacesAfterwards, 32 TransitionsBefore, 29 TransitionsAfterwards, 274 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, independent: 57, independent conditional: 57, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 57, independent: 57, independent conditional: 57, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 57, independent: 57, independent conditional: 36, independent unconditional: 21, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 57, independent: 57, independent conditional: 36, independent unconditional: 21, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 12, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 57, independent: 38, independent conditional: 24, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 19, unknown conditional: 12, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 19, Positive conditional cache size: 12, Positive unconditional cache size: 7, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 39 PlacesBefore, 39 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, independent: 14, independent conditional: 6, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 6, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 3, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 26, Positive conditional cache size: 15, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 43 PlacesBefore, 43 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 330 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, independent: 21, independent conditional: 9, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 9, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21, independent: 21, independent conditional: 9, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 26, Positive conditional cache size: 15, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 43 PlacesBefore, 42 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 310 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 50, independent conditional: 50, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 50, independent conditional: 50, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, independent: 50, independent conditional: 20, independent unconditional: 30, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 50, independent conditional: 20, independent unconditional: 30, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 10, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, independent: 28, independent conditional: 10, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 22, unknown conditional: 10, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 50, Positive conditional cache size: 27, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 49 PlacesBefore, 49 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 396 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 50, Positive conditional cache size: 27, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 50, Positive conditional cache size: 27, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 568 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 50, Positive conditional cache size: 27, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 630 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 50, Positive conditional cache size: 27, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 69 PlacesBefore, 68 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 61, Positive conditional cache size: 38, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 70 PlacesBefore, 70 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 718 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 61, Positive conditional cache size: 38, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 92 TransitionsBefore, 92 TransitionsAfterwards, 710 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 61, Positive conditional cache size: 38, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 76 PlacesBefore, 75 PlacesAfterwards, 96 TransitionsBefore, 95 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 63, Positive conditional cache size: 40, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 77 PlacesBefore, 77 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 692 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 63, Positive conditional cache size: 40, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 81 PlacesBefore, 81 PlacesAfterwards, 91 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 63, Positive conditional cache size: 40, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 83 PlacesBefore, 83 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 656 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 141, Positive conditional cache size: 118, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 84 PlacesBefore, 84 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 560 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 141, Positive conditional cache size: 118, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 84 PlacesBefore, 84 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 542 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 141, Positive conditional cache size: 118, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 89 PlacesBefore, 89 PlacesAfterwards, 70 TransitionsBefore, 70 TransitionsAfterwards, 530 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 146, Positive conditional cache size: 123, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 92 PlacesBefore, 92 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 146, Positive conditional cache size: 123, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 94 PlacesBefore, 93 PlacesAfterwards, 64 TransitionsBefore, 63 TransitionsAfterwards, 464 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 153, Positive conditional cache size: 130, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 87 PlacesBefore, 87 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 374 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 153, Positive conditional cache size: 130, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 78 PlacesBefore, 78 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 354 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 153, Positive conditional cache size: 130, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 68 PlacesBefore, 68 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 310 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 153, Positive conditional cache size: 130, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 358 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 153, Positive conditional cache size: 130, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 64 PlacesBefore, 64 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 344 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 153, Positive conditional cache size: 130, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 66 PlacesBefore, 66 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 153, Positive conditional cache size: 130, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 71 PlacesBefore, 71 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 408 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 159, Positive conditional cache size: 136, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 75 PlacesBefore, 75 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 424 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 159, Positive conditional cache size: 136, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 87 PlacesBefore, 87 PlacesAfterwards, 104 TransitionsBefore, 104 TransitionsAfterwards, 664 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 160, Positive conditional cache size: 137, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 100 PlacesBefore, 98 PlacesAfterwards, 196 TransitionsBefore, 194 TransitionsAfterwards, 1072 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 100, independent: 100, independent conditional: 100, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 100, independent: 100, independent conditional: 100, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 100, independent: 100, independent conditional: 100, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 100, independent: 100, independent conditional: 100, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 100, independent: 90, independent conditional: 90, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 172, Positive conditional cache size: 149, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 110 PlacesBefore, 110 PlacesAfterwards, 214 TransitionsBefore, 214 TransitionsAfterwards, 1214 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 186, Positive cache size: 186, Positive conditional cache size: 162, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 112 PlacesBefore, 112 PlacesAfterwards, 215 TransitionsBefore, 215 TransitionsAfterwards, 1224 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 192, Positive cache size: 192, Positive conditional cache size: 168, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 116 PlacesBefore, 116 PlacesAfterwards, 218 TransitionsBefore, 218 TransitionsAfterwards, 1308 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 192, Positive cache size: 192, Positive conditional cache size: 168, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 137 PlacesBefore, 134 PlacesAfterwards, 293 TransitionsBefore, 290 TransitionsAfterwards, 1514 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 197, Positive cache size: 197, Positive conditional cache size: 173, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 144 PlacesBefore, 144 PlacesAfterwards, 338 TransitionsBefore, 338 TransitionsAfterwards, 1734 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 200, Positive conditional cache size: 176, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 144 PlacesBefore, 144 PlacesAfterwards, 336 TransitionsBefore, 336 TransitionsAfterwards, 1728 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 200, Positive conditional cache size: 176, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 148 PlacesBefore, 148 PlacesAfterwards, 382 TransitionsBefore, 382 TransitionsAfterwards, 2148 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 200, Positive conditional cache size: 176, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 162 PlacesBefore, 162 PlacesAfterwards, 437 TransitionsBefore, 437 TransitionsAfterwards, 2452 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 200, Positive conditional cache size: 176, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 159 PlacesBefore, 158 PlacesAfterwards, 420 TransitionsBefore, 419 TransitionsAfterwards, 2332 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 206, Positive conditional cache size: 182, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 167 PlacesBefore, 167 PlacesAfterwards, 435 TransitionsBefore, 435 TransitionsAfterwards, 2444 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 206, Positive conditional cache size: 182, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 167 PlacesBefore, 167 PlacesAfterwards, 447 TransitionsBefore, 447 TransitionsAfterwards, 2592 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 206, Positive conditional cache size: 182, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 177 PlacesBefore, 177 PlacesAfterwards, 474 TransitionsBefore, 474 TransitionsAfterwards, 2870 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 206, Positive conditional cache size: 182, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 184 PlacesBefore, 184 PlacesAfterwards, 511 TransitionsBefore, 511 TransitionsAfterwards, 3006 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 208, Positive cache size: 208, Positive conditional cache size: 184, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 188 PlacesBefore, 188 PlacesAfterwards, 523 TransitionsBefore, 523 TransitionsAfterwards, 3072 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 208, Positive cache size: 208, Positive conditional cache size: 184, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 205 PlacesBefore, 202 PlacesAfterwards, 553 TransitionsBefore, 550 TransitionsAfterwards, 3272 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 46, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 276, Positive conditional cache size: 252, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 202 PlacesBefore, 202 PlacesAfterwards, 551 TransitionsBefore, 551 TransitionsAfterwards, 3278 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 276, Positive conditional cache size: 252, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 204 PlacesBefore, 204 PlacesAfterwards, 548 TransitionsBefore, 548 TransitionsAfterwards, 3258 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 276, Positive conditional cache size: 252, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 212 PlacesBefore, 212 PlacesAfterwards, 571 TransitionsBefore, 571 TransitionsAfterwards, 3380 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 276, Positive conditional cache size: 252, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 216 PlacesBefore, 216 PlacesAfterwards, 576 TransitionsBefore, 576 TransitionsAfterwards, 3448 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 276, Positive conditional cache size: 252, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 224 PlacesBefore, 224 PlacesAfterwards, 598 TransitionsBefore, 598 TransitionsAfterwards, 3544 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 276, Positive conditional cache size: 252, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 222 PlacesBefore, 222 PlacesAfterwards, 593 TransitionsBefore, 593 TransitionsAfterwards, 3500 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 276, Positive conditional cache size: 252, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 221 PlacesBefore, 221 PlacesAfterwards, 565 TransitionsBefore, 565 TransitionsAfterwards, 3250 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 276, Positive conditional cache size: 252, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 243 PlacesBefore, 242 PlacesAfterwards, 596 TransitionsBefore, 595 TransitionsAfterwards, 3406 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 388, Positive cache size: 388, Positive conditional cache size: 364, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 243 PlacesBefore, 243 PlacesAfterwards, 592 TransitionsBefore, 592 TransitionsAfterwards, 3384 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 388, Positive cache size: 388, Positive conditional cache size: 364, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 246 PlacesBefore, 246 PlacesAfterwards, 589 TransitionsBefore, 589 TransitionsAfterwards, 3366 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 389, Positive cache size: 389, Positive conditional cache size: 365, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 258 PlacesBefore, 258 PlacesAfterwards, 603 TransitionsBefore, 603 TransitionsAfterwards, 3450 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 390, Positive cache size: 390, Positive conditional cache size: 366, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 276 PlacesBefore, 272 PlacesAfterwards, 623 TransitionsBefore, 619 TransitionsAfterwards, 3522 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 459, Positive cache size: 459, Positive conditional cache size: 435, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - ExceptionOrErrorResult: IndexOutOfBoundsException: Index 17 out of bounds for length 17 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IndexOutOfBoundsException: Index 17 out of bounds for length 17: java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 07:48:03,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...