/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-RepeatedSemanticLbe.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 00:21:03,155 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:21:03,157 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:21:03,195 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:21:03,196 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:21:03,198 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:21:03,201 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:21:03,204 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:21:03,208 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:21:03,208 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:21:03,209 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:21:03,210 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:21:03,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:21:03,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:21:03,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:21:03,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:21:03,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:21:03,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:21:03,221 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:21:03,236 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:21:03,238 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:21:03,240 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:21:03,240 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:21:03,241 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:21:03,249 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:21:03,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:21:03,249 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:21:03,251 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:21:03,251 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:21:03,252 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:21:03,252 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:21:03,254 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:21:03,255 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:21:03,256 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:21:03,257 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:21:03,257 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:21:03,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:21:03,257 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:21:03,258 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:21:03,258 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:21:03,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:21:03,260 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-RepeatedSemanticLbe.epf [2022-12-06 00:21:03,293 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:21:03,294 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:21:03,336 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:21:03,336 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:21:03,336 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:21:03,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:21:03,337 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:21:03,338 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:21:03,338 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:21:03,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:21:03,353 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:21:03,365 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:21:03,369 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:21:03,369 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:21:03,369 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:21:03,369 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:21:03,369 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:21:03,369 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:21:03,370 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:21:03,370 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:21:03,370 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:21:03,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:21:03,370 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:21:03,370 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:21:03,370 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:21:03,371 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:21:03,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:21:03,371 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:21:03,371 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 00:21:03,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:21:03,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:21:03,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:21:03,749 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:21:03,749 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:21:03,750 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 00:21:04,916 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:21:05,211 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:21:05,212 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2022-12-06 00:21:05,238 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c8230b08/2d3e9d58dfbf4a5b925888d12e5cf000/FLAGb785f7c07 [2022-12-06 00:21:05,251 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c8230b08/2d3e9d58dfbf4a5b925888d12e5cf000 [2022-12-06 00:21:05,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:21:05,255 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:21:05,256 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:21:05,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:21:05,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:21:05,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:21:05" (1/1) ... [2022-12-06 00:21:05,260 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@290d6c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:21:05, skipping insertion in model container [2022-12-06 00:21:05,260 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:21:05" (1/1) ... [2022-12-06 00:21:05,265 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:21:05,280 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:21:05,455 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 00:21:05,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:21:05,477 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:21:05,511 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 00:21:05,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:21:05,530 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:21:05,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:21:05 WrapperNode [2022-12-06 00:21:05,531 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:21:05,533 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:21:05,533 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:21:05,534 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:21:05,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:21:05" (1/1) ... [2022-12-06 00:21:05,554 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:21:05" (1/1) ... [2022-12-06 00:21:05,581 INFO L138 Inliner]: procedures = 25, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2022-12-06 00:21:05,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:21:05,583 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:21:05,583 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:21:05,583 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:21:05,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:21:05" (1/1) ... [2022-12-06 00:21:05,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:21:05" (1/1) ... [2022-12-06 00:21:05,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:21:05" (1/1) ... [2022-12-06 00:21:05,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:21:05" (1/1) ... [2022-12-06 00:21:05,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:21:05" (1/1) ... [2022-12-06 00:21:05,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:21:05" (1/1) ... [2022-12-06 00:21:05,614 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:21:05" (1/1) ... [2022-12-06 00:21:05,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:21:05" (1/1) ... [2022-12-06 00:21:05,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:21:05,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:21:05,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:21:05,632 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:21:05,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:21:05" (1/1) ... [2022-12-06 00:21:05,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:21:05,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:21:05,674 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 00:21:05,707 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 00:21:05,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:21:05,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:21:05,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:21:05,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:21:05,722 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 00:21:05,722 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 00:21:05,722 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 00:21:05,722 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 00:21:05,722 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 00:21:05,722 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 00:21:05,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:21:05,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 00:21:05,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:21:05,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:21:05,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:21:05,724 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 00:21:05,799 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:21:05,801 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:21:06,000 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:21:06,008 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:21:06,008 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 00:21:06,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:21:06 BoogieIcfgContainer [2022-12-06 00:21:06,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:21:06,012 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:21:06,012 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:21:06,014 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:21:06,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:21:05" (1/3) ... [2022-12-06 00:21:06,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b21a251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:21:06, skipping insertion in model container [2022-12-06 00:21:06,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:21:05" (2/3) ... [2022-12-06 00:21:06,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b21a251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:21:06, skipping insertion in model container [2022-12-06 00:21:06,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:21:06" (3/3) ... [2022-12-06 00:21:06,016 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2022-12-06 00:21:06,030 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:21:06,030 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:21:06,030 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:21:06,140 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 00:21:06,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 148 transitions, 320 flow [2022-12-06 00:21:06,252 INFO L130 PetriNetUnfolder]: 12/145 cut-off events. [2022-12-06 00:21:06,252 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:21:06,257 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 00:21:06,257 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 148 transitions, 320 flow [2022-12-06 00:21:06,260 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 135 transitions, 288 flow [2022-12-06 00:21:06,261 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:06,274 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 135 transitions, 288 flow [2022-12-06 00:21:06,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 135 transitions, 288 flow [2022-12-06 00:21:06,309 INFO L130 PetriNetUnfolder]: 12/135 cut-off events. [2022-12-06 00:21:06,310 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:21:06,310 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 00:21:06,313 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 135 transitions, 288 flow [2022-12-06 00:21:06,313 INFO L188 LiptonReduction]: Number of co-enabled transitions 1728 [2022-12-06 00:21:10,941 INFO L203 LiptonReduction]: Total number of compositions: 111 [2022-12-06 00:21:10,952 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:21:10,972 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;@3f5e47a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:21:10,972 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 00:21:10,986 INFO L130 PetriNetUnfolder]: 4/23 cut-off events. [2022-12-06 00:21:10,986 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:21:10,987 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:10,987 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 00:21:10,988 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 00:21:11,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:11,003 INFO L85 PathProgramCache]: Analyzing trace with hash 2027454459, now seen corresponding path program 1 times [2022-12-06 00:21:11,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:11,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063954933] [2022-12-06 00:21:11,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:11,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:11,481 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 00:21:11,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:11,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063954933] [2022-12-06 00:21:11,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063954933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:11,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:11,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 00:21:11,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747373047] [2022-12-06 00:21:11,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:11,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:21:11,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:11,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:21:11,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:21:11,524 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2022-12-06 00:21:11,525 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 00:21:11,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:11,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2022-12-06 00:21:11,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:11,598 INFO L130 PetriNetUnfolder]: 360/508 cut-off events. [2022-12-06 00:21:11,599 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-12-06 00:21:11,600 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 00:21:11,603 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 32 selfloop transitions, 4 changer transitions 1/40 dead transitions. [2022-12-06 00:21:11,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 40 transitions, 187 flow [2022-12-06 00:21:11,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:21:11,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:21:11,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-06 00:21:11,612 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6527777777777778 [2022-12-06 00:21:11,613 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 66 flow. Second operand 3 states and 47 transitions. [2022-12-06 00:21:11,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 40 transitions, 187 flow [2022-12-06 00:21:11,616 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 00:21:11,618 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 80 flow [2022-12-06 00:21:11,619 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 00:21:11,621 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2022-12-06 00:21:11,622 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:11,622 INFO L89 Accepts]: Start accepts. Operand has 27 places, 27 transitions, 80 flow [2022-12-06 00:21:11,624 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:11,625 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:11,625 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 27 transitions, 80 flow [2022-12-06 00:21:11,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 27 transitions, 80 flow [2022-12-06 00:21:11,631 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 00:21:11,631 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-06 00:21:11,631 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 00:21:11,631 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 00:21:11,631 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 00:21:11,632 INFO L130 PetriNetUnfolder]: 23/64 cut-off events. [2022-12-06 00:21:11,632 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:21:11,633 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 00:21:11,633 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 27 transitions, 80 flow [2022-12-06 00:21:11,633 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 00:21:11,634 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:11,635 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 00:21:11,635 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 80 flow [2022-12-06 00:21:11,635 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 00:21:11,635 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:11,635 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 00:21:11,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:21:11,636 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 00:21:11,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:11,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1702965316, now seen corresponding path program 1 times [2022-12-06 00:21:11,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:11,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339775049] [2022-12-06 00:21:11,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:11,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:11,774 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 00:21:11,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:11,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339775049] [2022-12-06 00:21:11,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339775049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:11,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:11,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:21:11,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436724218] [2022-12-06 00:21:11,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:11,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:21:11,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:11,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:21:11,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:21:11,776 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 00:21:11,777 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 00:21:11,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:11,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 00:21:11,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:11,905 INFO L130 PetriNetUnfolder]: 663/975 cut-off events. [2022-12-06 00:21:11,905 INFO L131 PetriNetUnfolder]: For 287/287 co-relation queries the response was YES. [2022-12-06 00:21:11,907 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 00:21:11,911 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 64 selfloop transitions, 5 changer transitions 0/71 dead transitions. [2022-12-06 00:21:11,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 71 transitions, 348 flow [2022-12-06 00:21:11,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:21:11,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:21:11,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-12-06 00:21:11,913 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2022-12-06 00:21:11,913 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 80 flow. Second operand 6 states and 73 transitions. [2022-12-06 00:21:11,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 71 transitions, 348 flow [2022-12-06 00:21:11,913 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 00:21:11,914 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 115 flow [2022-12-06 00:21:11,914 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 00:21:11,915 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2022-12-06 00:21:11,915 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:11,915 INFO L89 Accepts]: Start accepts. Operand has 35 places, 31 transitions, 115 flow [2022-12-06 00:21:11,916 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:11,916 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:11,916 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 31 transitions, 115 flow [2022-12-06 00:21:11,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 115 flow [2022-12-06 00:21:11,923 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 00:21:11,923 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2022-12-06 00:21:11,923 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 00:21:11,923 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-12-06 00:21:11,924 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 00:21:11,925 INFO L130 PetriNetUnfolder]: 30/102 cut-off events. [2022-12-06 00:21:11,925 INFO L131 PetriNetUnfolder]: For 6/7 co-relation queries the response was YES. [2022-12-06 00:21:11,927 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 00:21:11,927 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 31 transitions, 115 flow [2022-12-06 00:21:11,928 INFO L188 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-06 00:21:13,754 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:21:13,755 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1840 [2022-12-06 00:21:13,755 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 121 flow [2022-12-06 00:21:13,755 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 00:21:13,756 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:13,756 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 00:21:13,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:21:13,756 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 00:21:13,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:13,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1920480195, now seen corresponding path program 1 times [2022-12-06 00:21:13,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:13,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315521778] [2022-12-06 00:21:13,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:13,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:13,823 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 00:21:13,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:13,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315521778] [2022-12-06 00:21:13,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315521778] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:13,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:13,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:21:13,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803152914] [2022-12-06 00:21:13,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:13,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:21:13,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:13,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:21:13,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:21:13,828 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 00:21:13,828 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 00:21:13,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:13,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 00:21:13,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:13,925 INFO L130 PetriNetUnfolder]: 483/758 cut-off events. [2022-12-06 00:21:13,926 INFO L131 PetriNetUnfolder]: For 432/460 co-relation queries the response was YES. [2022-12-06 00:21:13,927 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 00:21:13,930 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 51 selfloop transitions, 2 changer transitions 1/57 dead transitions. [2022-12-06 00:21:13,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 57 transitions, 301 flow [2022-12-06 00:21:13,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:21:13,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:21:13,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-06 00:21:13,932 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5576923076923077 [2022-12-06 00:21:13,933 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 121 flow. Second operand 4 states and 58 transitions. [2022-12-06 00:21:13,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 57 transitions, 301 flow [2022-12-06 00:21:13,936 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 00:21:13,937 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 122 flow [2022-12-06 00:21:13,937 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 00:21:13,938 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2022-12-06 00:21:13,938 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:13,938 INFO L89 Accepts]: Start accepts. Operand has 40 places, 31 transitions, 122 flow [2022-12-06 00:21:13,939 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:13,939 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:13,940 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 31 transitions, 122 flow [2022-12-06 00:21:13,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 122 flow [2022-12-06 00:21:13,945 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 00:21:13,945 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-06 00:21:13,945 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 00:21:13,945 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 00:21:13,945 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 00:21:13,946 INFO L130 PetriNetUnfolder]: 24/89 cut-off events. [2022-12-06 00:21:13,946 INFO L131 PetriNetUnfolder]: For 14/15 co-relation queries the response was YES. [2022-12-06 00:21:13,947 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 00:21:13,947 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 122 flow [2022-12-06 00:21:13,947 INFO L188 LiptonReduction]: Number of co-enabled transitions 254 [2022-12-06 00:21:13,949 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:13,950 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 00:21:13,950 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 122 flow [2022-12-06 00:21:13,950 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 00:21:13,950 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:13,951 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 00:21:13,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 00:21:13,951 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 00:21:13,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:13,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1884357865, now seen corresponding path program 1 times [2022-12-06 00:21:13,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:13,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239938266] [2022-12-06 00:21:13,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:13,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:14,096 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 00:21:14,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:14,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239938266] [2022-12-06 00:21:14,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239938266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:14,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:14,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:21:14,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709342110] [2022-12-06 00:21:14,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:14,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:21:14,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:14,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:21:14,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:21:14,098 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 00:21:14,098 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 00:21:14,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:14,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 00:21:14,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:14,183 INFO L130 PetriNetUnfolder]: 483/740 cut-off events. [2022-12-06 00:21:14,183 INFO L131 PetriNetUnfolder]: For 490/515 co-relation queries the response was YES. [2022-12-06 00:21:14,185 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 00:21:14,187 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 26 selfloop transitions, 0 changer transitions 26/53 dead transitions. [2022-12-06 00:21:14,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 282 flow [2022-12-06 00:21:14,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:21:14,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:21:14,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-06 00:21:14,189 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.53 [2022-12-06 00:21:14,189 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 122 flow. Second operand 4 states and 53 transitions. [2022-12-06 00:21:14,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 282 flow [2022-12-06 00:21:14,192 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 00:21:14,192 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 91 flow [2022-12-06 00:21:14,192 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 00:21:14,194 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2022-12-06 00:21:14,194 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:14,194 INFO L89 Accepts]: Start accepts. Operand has 42 places, 27 transitions, 91 flow [2022-12-06 00:21:14,194 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:14,194 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:14,195 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 27 transitions, 91 flow [2022-12-06 00:21:14,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 27 transitions, 91 flow [2022-12-06 00:21:14,199 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 00:21:14,199 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-06 00:21:14,199 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 00:21:14,199 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 00:21:14,199 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 00:21:14,200 INFO L130 PetriNetUnfolder]: 23/64 cut-off events. [2022-12-06 00:21:14,200 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:21:14,200 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 00:21:14,201 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 27 transitions, 91 flow [2022-12-06 00:21:14,201 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 00:21:14,202 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:14,204 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 00:21:14,204 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 91 flow [2022-12-06 00:21:14,204 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 00:21:14,204 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:14,204 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 00:21:14,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 00:21:14,204 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 00:21:14,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:14,205 INFO L85 PathProgramCache]: Analyzing trace with hash 484914264, now seen corresponding path program 1 times [2022-12-06 00:21:14,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:14,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409172519] [2022-12-06 00:21:14,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:14,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:14,300 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 00:21:14,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:14,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409172519] [2022-12-06 00:21:14,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409172519] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:14,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:14,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:21:14,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320951367] [2022-12-06 00:21:14,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:14,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:21:14,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:14,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:21:14,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:21:14,302 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 00:21:14,302 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 00:21:14,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:14,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 00:21:14,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:14,467 INFO L130 PetriNetUnfolder]: 544/798 cut-off events. [2022-12-06 00:21:14,467 INFO L131 PetriNetUnfolder]: For 456/456 co-relation queries the response was YES. [2022-12-06 00:21:14,468 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 00:21:14,471 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 58 selfloop transitions, 8 changer transitions 0/67 dead transitions. [2022-12-06 00:21:14,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 67 transitions, 361 flow [2022-12-06 00:21:14,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:21:14,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:21:14,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-12-06 00:21:14,472 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-06 00:21:14,472 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 91 flow. Second operand 6 states and 64 transitions. [2022-12-06 00:21:14,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 67 transitions, 361 flow [2022-12-06 00:21:14,474 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 00:21:14,475 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 133 flow [2022-12-06 00:21:14,475 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 00:21:14,475 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2022-12-06 00:21:14,476 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:14,476 INFO L89 Accepts]: Start accepts. Operand has 36 places, 32 transitions, 133 flow [2022-12-06 00:21:14,476 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:14,476 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:14,476 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 32 transitions, 133 flow [2022-12-06 00:21:14,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 133 flow [2022-12-06 00:21:14,481 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 00:21:14,481 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-06 00:21:14,481 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 00:21:14,481 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 00:21:14,481 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 00:21:14,481 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 00:21:14,481 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-06 00:21:14,481 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 00:21:14,482 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 00:21:14,482 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 00:21:14,482 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 00:21:14,483 INFO L130 PetriNetUnfolder]: 29/84 cut-off events. [2022-12-06 00:21:14,483 INFO L131 PetriNetUnfolder]: For 11/17 co-relation queries the response was YES. [2022-12-06 00:21:14,483 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 00:21:14,484 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 32 transitions, 133 flow [2022-12-06 00:21:14,484 INFO L188 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-06 00:21:14,555 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:21:14,555 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 00:21:14,555 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 115 flow [2022-12-06 00:21:14,556 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 00:21:14,556 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:14,556 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 00:21:14,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 00:21:14,556 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 00:21:14,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:14,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1369268887, now seen corresponding path program 1 times [2022-12-06 00:21:14,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:14,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113529654] [2022-12-06 00:21:14,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:14,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:14,622 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 00:21:14,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:14,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113529654] [2022-12-06 00:21:14,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113529654] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:14,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:14,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:21:14,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014760338] [2022-12-06 00:21:14,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:14,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:21:14,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:14,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:21:14,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:21:14,623 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 00:21:14,623 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 00:21:14,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:14,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 00:21:14,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:14,756 INFO L130 PetriNetUnfolder]: 550/824 cut-off events. [2022-12-06 00:21:14,756 INFO L131 PetriNetUnfolder]: For 1083/1083 co-relation queries the response was YES. [2022-12-06 00:21:14,757 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 00:21:14,760 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 59 selfloop transitions, 11 changer transitions 1/72 dead transitions. [2022-12-06 00:21:14,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 72 transitions, 427 flow [2022-12-06 00:21:14,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:21:14,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:21:14,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-12-06 00:21:14,761 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46794871794871795 [2022-12-06 00:21:14,761 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 115 flow. Second operand 6 states and 73 transitions. [2022-12-06 00:21:14,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 72 transitions, 427 flow [2022-12-06 00:21:14,763 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 00:21:14,763 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 179 flow [2022-12-06 00:21:14,764 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 00:21:14,764 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2022-12-06 00:21:14,764 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:14,764 INFO L89 Accepts]: Start accepts. Operand has 40 places, 36 transitions, 179 flow [2022-12-06 00:21:14,765 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:14,765 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:14,765 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 36 transitions, 179 flow [2022-12-06 00:21:14,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 36 transitions, 179 flow [2022-12-06 00:21:14,771 INFO L130 PetriNetUnfolder]: 25/83 cut-off events. [2022-12-06 00:21:14,771 INFO L131 PetriNetUnfolder]: For 47/48 co-relation queries the response was YES. [2022-12-06 00:21:14,771 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 00:21:14,772 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 36 transitions, 179 flow [2022-12-06 00:21:14,772 INFO L188 LiptonReduction]: Number of co-enabled transitions 292 [2022-12-06 00:21:14,772 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 00:21:14,791 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 00:21:14,812 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:21:14,813 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 00:21:14,813 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 189 flow [2022-12-06 00:21:14,813 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 00:21:14,813 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:14,813 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 00:21:14,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 00:21:14,813 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 00:21:14,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:14,814 INFO L85 PathProgramCache]: Analyzing trace with hash 81363167, now seen corresponding path program 2 times [2022-12-06 00:21:14,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:14,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500269565] [2022-12-06 00:21:14,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:14,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:14,908 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 00:21:14,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:14,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500269565] [2022-12-06 00:21:14,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500269565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:14,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:14,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:21:14,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810155] [2022-12-06 00:21:14,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:14,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:21:14,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:14,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:21:14,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:21:14,909 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 00:21:14,909 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 00:21:14,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:14,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 00:21:14,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:15,031 INFO L130 PetriNetUnfolder]: 598/875 cut-off events. [2022-12-06 00:21:15,031 INFO L131 PetriNetUnfolder]: For 1655/1655 co-relation queries the response was YES. [2022-12-06 00:21:15,033 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 00:21:15,036 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 49 selfloop transitions, 11 changer transitions 0/61 dead transitions. [2022-12-06 00:21:15,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 61 transitions, 408 flow [2022-12-06 00:21:15,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:21:15,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:21:15,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-06 00:21:15,037 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40714285714285714 [2022-12-06 00:21:15,037 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 189 flow. Second operand 5 states and 57 transitions. [2022-12-06 00:21:15,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 61 transitions, 408 flow [2022-12-06 00:21:15,039 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 00:21:15,040 INFO L231 Difference]: Finished difference. Result has 43 places, 40 transitions, 227 flow [2022-12-06 00:21:15,040 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 00:21:15,041 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2022-12-06 00:21:15,041 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:15,041 INFO L89 Accepts]: Start accepts. Operand has 43 places, 40 transitions, 227 flow [2022-12-06 00:21:15,041 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:15,041 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:15,042 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 40 transitions, 227 flow [2022-12-06 00:21:15,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 40 transitions, 227 flow [2022-12-06 00:21:15,049 INFO L130 PetriNetUnfolder]: 40/108 cut-off events. [2022-12-06 00:21:15,049 INFO L131 PetriNetUnfolder]: For 128/139 co-relation queries the response was YES. [2022-12-06 00:21:15,049 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 00:21:15,050 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 40 transitions, 227 flow [2022-12-06 00:21:15,050 INFO L188 LiptonReduction]: Number of co-enabled transitions 330 [2022-12-06 00:21:15,120 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:21:15,120 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 00:21:15,120 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 40 transitions, 245 flow [2022-12-06 00:21:15,121 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 00:21:15,121 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:15,121 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 00:21:15,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 00:21:15,121 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 00:21:15,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:15,121 INFO L85 PathProgramCache]: Analyzing trace with hash -882476984, now seen corresponding path program 1 times [2022-12-06 00:21:15,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:15,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140654589] [2022-12-06 00:21:15,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:15,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:15,181 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 00:21:15,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:15,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140654589] [2022-12-06 00:21:15,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140654589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:15,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:15,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:21:15,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737225580] [2022-12-06 00:21:15,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:15,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:21:15,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:15,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:21:15,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:21:15,183 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 00:21:15,183 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 00:21:15,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:15,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 00:21:15,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:15,290 INFO L130 PetriNetUnfolder]: 603/898 cut-off events. [2022-12-06 00:21:15,290 INFO L131 PetriNetUnfolder]: For 1957/1979 co-relation queries the response was YES. [2022-12-06 00:21:15,291 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 00:21:15,295 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 55 selfloop transitions, 4 changer transitions 0/61 dead transitions. [2022-12-06 00:21:15,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 61 transitions, 510 flow [2022-12-06 00:21:15,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:21:15,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:21:15,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-06 00:21:15,296 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4112903225806452 [2022-12-06 00:21:15,296 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 245 flow. Second operand 4 states and 51 transitions. [2022-12-06 00:21:15,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 61 transitions, 510 flow [2022-12-06 00:21:15,298 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 00:21:15,299 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 234 flow [2022-12-06 00:21:15,299 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 00:21:15,300 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2022-12-06 00:21:15,300 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:15,300 INFO L89 Accepts]: Start accepts. Operand has 43 places, 41 transitions, 234 flow [2022-12-06 00:21:15,300 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:15,300 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:15,301 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 41 transitions, 234 flow [2022-12-06 00:21:15,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 41 transitions, 234 flow [2022-12-06 00:21:15,307 INFO L130 PetriNetUnfolder]: 36/100 cut-off events. [2022-12-06 00:21:15,307 INFO L131 PetriNetUnfolder]: For 130/159 co-relation queries the response was YES. [2022-12-06 00:21:15,308 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 00:21:15,308 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 41 transitions, 234 flow [2022-12-06 00:21:15,308 INFO L188 LiptonReduction]: Number of co-enabled transitions 310 [2022-12-06 00:21:15,375 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 00:21:15,416 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:21:15,417 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-06 00:21:15,417 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 238 flow [2022-12-06 00:21:15,417 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 00:21:15,418 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:15,418 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 00:21:15,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 00:21:15,418 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 00:21:15,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:15,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1423117007, now seen corresponding path program 1 times [2022-12-06 00:21:15,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:15,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732956174] [2022-12-06 00:21:15,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:15,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:16,249 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 00:21:16,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:16,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732956174] [2022-12-06 00:21:16,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732956174] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:16,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:16,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:21:16,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497152630] [2022-12-06 00:21:16,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:16,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:21:16,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:16,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:21:16,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:21:16,252 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 00:21:16,252 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 00:21:16,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:16,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 00:21:16,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:16,567 INFO L130 PetriNetUnfolder]: 669/1008 cut-off events. [2022-12-06 00:21:16,567 INFO L131 PetriNetUnfolder]: For 2478/2478 co-relation queries the response was YES. [2022-12-06 00:21:16,568 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 00:21:16,572 INFO L137 encePairwiseOnDemand]: 18/33 looper letters, 74 selfloop transitions, 26 changer transitions 5/105 dead transitions. [2022-12-06 00:21:16,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 105 transitions, 793 flow [2022-12-06 00:21:16,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:21:16,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:21:16,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-12-06 00:21:16,573 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41125541125541126 [2022-12-06 00:21:16,573 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 238 flow. Second operand 7 states and 95 transitions. [2022-12-06 00:21:16,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 105 transitions, 793 flow [2022-12-06 00:21:16,577 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 00:21:16,578 INFO L231 Difference]: Finished difference. Result has 49 places, 59 transitions, 458 flow [2022-12-06 00:21:16,578 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 00:21:16,579 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 19 predicate places. [2022-12-06 00:21:16,579 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:16,579 INFO L89 Accepts]: Start accepts. Operand has 49 places, 59 transitions, 458 flow [2022-12-06 00:21:16,580 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:16,580 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:16,580 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 59 transitions, 458 flow [2022-12-06 00:21:16,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 59 transitions, 458 flow [2022-12-06 00:21:16,590 INFO L130 PetriNetUnfolder]: 57/159 cut-off events. [2022-12-06 00:21:16,590 INFO L131 PetriNetUnfolder]: For 412/468 co-relation queries the response was YES. [2022-12-06 00:21:16,590 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 00:21:16,591 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 59 transitions, 458 flow [2022-12-06 00:21:16,591 INFO L188 LiptonReduction]: Number of co-enabled transitions 396 [2022-12-06 00:21:18,894 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:21:18,895 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2316 [2022-12-06 00:21:18,895 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 59 transitions, 466 flow [2022-12-06 00:21:18,895 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 00:21:18,895 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:18,895 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 00:21:18,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 00:21:18,896 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 00:21:18,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:18,896 INFO L85 PathProgramCache]: Analyzing trace with hash -955963427, now seen corresponding path program 1 times [2022-12-06 00:21:18,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:18,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030606287] [2022-12-06 00:21:18,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:18,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:19,228 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 00:21:19,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:19,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030606287] [2022-12-06 00:21:19,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030606287] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:19,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:19,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:21:19,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704458206] [2022-12-06 00:21:19,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:19,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:21:19,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:19,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:21:19,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:21:19,232 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-06 00:21:19,232 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 00:21:19,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:19,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-06 00:21:19,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:19,421 INFO L130 PetriNetUnfolder]: 798/1216 cut-off events. [2022-12-06 00:21:19,421 INFO L131 PetriNetUnfolder]: For 3685/3797 co-relation queries the response was YES. [2022-12-06 00:21:19,423 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 00:21:19,428 INFO L137 encePairwiseOnDemand]: 17/35 looper letters, 73 selfloop transitions, 25 changer transitions 5/105 dead transitions. [2022-12-06 00:21:19,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 105 transitions, 908 flow [2022-12-06 00:21:19,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:21:19,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:21:19,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-06 00:21:19,429 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49714285714285716 [2022-12-06 00:21:19,430 INFO L175 Difference]: Start difference. First operand has 49 places, 59 transitions, 466 flow. Second operand 5 states and 87 transitions. [2022-12-06 00:21:19,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 105 transitions, 908 flow [2022-12-06 00:21:19,437 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 00:21:19,438 INFO L231 Difference]: Finished difference. Result has 55 places, 68 transitions, 593 flow [2022-12-06 00:21:19,439 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 00:21:19,440 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 25 predicate places. [2022-12-06 00:21:19,440 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:19,440 INFO L89 Accepts]: Start accepts. Operand has 55 places, 68 transitions, 593 flow [2022-12-06 00:21:19,442 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:19,442 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:19,442 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 68 transitions, 593 flow [2022-12-06 00:21:19,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 68 transitions, 593 flow [2022-12-06 00:21:19,454 INFO L130 PetriNetUnfolder]: 73/207 cut-off events. [2022-12-06 00:21:19,455 INFO L131 PetriNetUnfolder]: For 705/772 co-relation queries the response was YES. [2022-12-06 00:21:19,455 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 00:21:19,456 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 68 transitions, 593 flow [2022-12-06 00:21:19,456 INFO L188 LiptonReduction]: Number of co-enabled transitions 484 [2022-12-06 00:21:19,457 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:19,458 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 00:21:19,458 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 68 transitions, 593 flow [2022-12-06 00:21:19,458 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 00:21:19,458 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:19,458 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 00:21:19,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 00:21:19,458 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 00:21:19,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:19,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1359502275, now seen corresponding path program 1 times [2022-12-06 00:21:19,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:19,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916696034] [2022-12-06 00:21:19,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:19,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:19,894 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 00:21:19,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:19,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916696034] [2022-12-06 00:21:19,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916696034] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:19,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:19,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:21:19,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74423183] [2022-12-06 00:21:19,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:19,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:21:19,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:19,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:21:19,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:21:19,895 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 00:21:19,895 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 00:21:19,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:19,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 00:21:19,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:20,085 INFO L130 PetriNetUnfolder]: 940/1438 cut-off events. [2022-12-06 00:21:20,085 INFO L131 PetriNetUnfolder]: For 5156/5300 co-relation queries the response was YES. [2022-12-06 00:21:20,088 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 00:21:20,093 INFO L137 encePairwiseOnDemand]: 18/34 looper letters, 74 selfloop transitions, 32 changer transitions 4/112 dead transitions. [2022-12-06 00:21:20,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 112 transitions, 1059 flow [2022-12-06 00:21:20,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:21:20,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:21:20,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-12-06 00:21:20,095 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5058823529411764 [2022-12-06 00:21:20,095 INFO L175 Difference]: Start difference. First operand has 54 places, 68 transitions, 593 flow. Second operand 5 states and 86 transitions. [2022-12-06 00:21:20,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 112 transitions, 1059 flow [2022-12-06 00:21:20,102 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 00:21:20,104 INFO L231 Difference]: Finished difference. Result has 57 places, 76 transitions, 755 flow [2022-12-06 00:21:20,104 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 00:21:20,104 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 27 predicate places. [2022-12-06 00:21:20,104 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:20,104 INFO L89 Accepts]: Start accepts. Operand has 57 places, 76 transitions, 755 flow [2022-12-06 00:21:20,106 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:20,106 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:20,106 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 76 transitions, 755 flow [2022-12-06 00:21:20,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 76 transitions, 755 flow [2022-12-06 00:21:20,122 INFO L130 PetriNetUnfolder]: 83/246 cut-off events. [2022-12-06 00:21:20,122 INFO L131 PetriNetUnfolder]: For 1063/1133 co-relation queries the response was YES. [2022-12-06 00:21:20,123 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 00:21:20,127 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 76 transitions, 755 flow [2022-12-06 00:21:20,127 INFO L188 LiptonReduction]: Number of co-enabled transitions 568 [2022-12-06 00:21:20,127 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:20,128 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 00:21:20,128 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 76 transitions, 755 flow [2022-12-06 00:21:20,128 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 00:21:20,128 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:20,128 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 00:21:20,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 00:21:20,128 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 00:21:20,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:20,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1164826203, now seen corresponding path program 1 times [2022-12-06 00:21:20,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:20,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116685414] [2022-12-06 00:21:20,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:20,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:20,622 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 00:21:20,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:20,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116685414] [2022-12-06 00:21:20,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116685414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:20,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:20,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:21:20,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476724107] [2022-12-06 00:21:20,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:20,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:21:20,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:20,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:21:20,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:21:20,625 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 00:21:20,626 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 00:21:20,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:20,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 00:21:20,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:20,900 INFO L130 PetriNetUnfolder]: 1066/1629 cut-off events. [2022-12-06 00:21:20,900 INFO L131 PetriNetUnfolder]: For 7283/7436 co-relation queries the response was YES. [2022-12-06 00:21:20,903 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 00:21:20,909 INFO L137 encePairwiseOnDemand]: 20/34 looper letters, 88 selfloop transitions, 22 changer transitions 3/115 dead transitions. [2022-12-06 00:21:20,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 115 transitions, 1179 flow [2022-12-06 00:21:20,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:21:20,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:21:20,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-12-06 00:21:20,910 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4019607843137255 [2022-12-06 00:21:20,910 INFO L175 Difference]: Start difference. First operand has 57 places, 76 transitions, 755 flow. Second operand 6 states and 82 transitions. [2022-12-06 00:21:20,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 115 transitions, 1179 flow [2022-12-06 00:21:20,920 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 00:21:20,924 INFO L231 Difference]: Finished difference. Result has 62 places, 83 transitions, 829 flow [2022-12-06 00:21:20,924 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 00:21:20,925 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 32 predicate places. [2022-12-06 00:21:20,925 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:20,925 INFO L89 Accepts]: Start accepts. Operand has 62 places, 83 transitions, 829 flow [2022-12-06 00:21:20,926 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:20,926 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:20,926 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 83 transitions, 829 flow [2022-12-06 00:21:20,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 83 transitions, 829 flow [2022-12-06 00:21:20,942 INFO L130 PetriNetUnfolder]: 99/286 cut-off events. [2022-12-06 00:21:20,943 INFO L131 PetriNetUnfolder]: For 1184/1261 co-relation queries the response was YES. [2022-12-06 00:21:20,943 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 00:21:20,945 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 83 transitions, 829 flow [2022-12-06 00:21:20,945 INFO L188 LiptonReduction]: Number of co-enabled transitions 630 [2022-12-06 00:21:20,946 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:20,947 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 00:21:20,947 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 83 transitions, 829 flow [2022-12-06 00:21:20,947 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 00:21:20,947 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:20,947 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 00:21:20,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 00:21:20,947 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 00:21:20,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:20,947 INFO L85 PathProgramCache]: Analyzing trace with hash 293782741, now seen corresponding path program 1 times [2022-12-06 00:21:20,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:20,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755756454] [2022-12-06 00:21:20,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:20,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:21,482 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 00:21:21,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:21,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755756454] [2022-12-06 00:21:21,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755756454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:21,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:21,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:21:21,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848213230] [2022-12-06 00:21:21,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:21,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:21:21,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:21,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:21:21,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:21:21,483 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 00:21:21,483 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 00:21:21,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:21,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 00:21:21,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:21,799 INFO L130 PetriNetUnfolder]: 1244/1882 cut-off events. [2022-12-06 00:21:21,800 INFO L131 PetriNetUnfolder]: For 8495/8495 co-relation queries the response was YES. [2022-12-06 00:21:21,804 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 00:21:21,813 INFO L137 encePairwiseOnDemand]: 21/34 looper letters, 103 selfloop transitions, 23 changer transitions 5/131 dead transitions. [2022-12-06 00:21:21,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 131 transitions, 1363 flow [2022-12-06 00:21:21,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:21:21,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:21:21,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2022-12-06 00:21:21,814 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36134453781512604 [2022-12-06 00:21:21,814 INFO L175 Difference]: Start difference. First operand has 62 places, 83 transitions, 829 flow. Second operand 7 states and 86 transitions. [2022-12-06 00:21:21,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 131 transitions, 1363 flow [2022-12-06 00:21:21,829 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 00:21:21,830 INFO L231 Difference]: Finished difference. Result has 69 places, 92 transitions, 936 flow [2022-12-06 00:21:21,831 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 00:21:21,831 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 39 predicate places. [2022-12-06 00:21:21,831 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:21,831 INFO L89 Accepts]: Start accepts. Operand has 69 places, 92 transitions, 936 flow [2022-12-06 00:21:21,832 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:21,832 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:21,832 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 92 transitions, 936 flow [2022-12-06 00:21:21,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 92 transitions, 936 flow [2022-12-06 00:21:21,851 INFO L130 PetriNetUnfolder]: 106/301 cut-off events. [2022-12-06 00:21:21,851 INFO L131 PetriNetUnfolder]: For 1344/1437 co-relation queries the response was YES. [2022-12-06 00:21:21,852 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 00:21:21,853 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 92 transitions, 936 flow [2022-12-06 00:21:21,854 INFO L188 LiptonReduction]: Number of co-enabled transitions 690 [2022-12-06 00:21:21,860 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 00:21:21,907 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 00:21:21,987 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 00:21:22,054 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:21:22,055 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 224 [2022-12-06 00:21:22,055 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 91 transitions, 952 flow [2022-12-06 00:21:22,055 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 00:21:22,055 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:22,055 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 00:21:22,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 00:21:22,056 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 00:21:22,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:22,056 INFO L85 PathProgramCache]: Analyzing trace with hash 791534071, now seen corresponding path program 2 times [2022-12-06 00:21:22,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:22,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239112920] [2022-12-06 00:21:22,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:22,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:22,442 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 00:21:22,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:22,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239112920] [2022-12-06 00:21:22,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239112920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:22,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:22,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:21:22,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489608827] [2022-12-06 00:21:22,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:22,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:21:22,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:22,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:21:22,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:21:22,444 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 37 [2022-12-06 00:21:22,444 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 00:21:22,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:22,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 37 [2022-12-06 00:21:22,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:22,714 INFO L130 PetriNetUnfolder]: 1238/1890 cut-off events. [2022-12-06 00:21:22,714 INFO L131 PetriNetUnfolder]: For 9733/9886 co-relation queries the response was YES. [2022-12-06 00:21:22,719 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 00:21:22,732 INFO L137 encePairwiseOnDemand]: 22/37 looper letters, 86 selfloop transitions, 39 changer transitions 4/131 dead transitions. [2022-12-06 00:21:22,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 131 transitions, 1418 flow [2022-12-06 00:21:22,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:21:22,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:21:22,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2022-12-06 00:21:22,734 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4810810810810811 [2022-12-06 00:21:22,734 INFO L175 Difference]: Start difference. First operand has 68 places, 91 transitions, 952 flow. Second operand 5 states and 89 transitions. [2022-12-06 00:21:22,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 131 transitions, 1418 flow [2022-12-06 00:21:22,752 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 00:21:22,754 INFO L231 Difference]: Finished difference. Result has 70 places, 94 transitions, 1023 flow [2022-12-06 00:21:22,754 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 00:21:22,754 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 40 predicate places. [2022-12-06 00:21:22,754 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:22,755 INFO L89 Accepts]: Start accepts. Operand has 70 places, 94 transitions, 1023 flow [2022-12-06 00:21:22,756 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:22,756 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:22,756 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 94 transitions, 1023 flow [2022-12-06 00:21:22,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 94 transitions, 1023 flow [2022-12-06 00:21:22,777 INFO L130 PetriNetUnfolder]: 120/342 cut-off events. [2022-12-06 00:21:22,778 INFO L131 PetriNetUnfolder]: For 1669/1752 co-relation queries the response was YES. [2022-12-06 00:21:22,779 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 00:21:22,781 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 94 transitions, 1023 flow [2022-12-06 00:21:22,781 INFO L188 LiptonReduction]: Number of co-enabled transitions 718 [2022-12-06 00:21:22,782 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:22,783 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 00:21:22,783 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 94 transitions, 1023 flow [2022-12-06 00:21:22,783 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 00:21:22,783 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:22,783 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 00:21:22,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 00:21:22,784 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 00:21:22,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:22,784 INFO L85 PathProgramCache]: Analyzing trace with hash -2044737383, now seen corresponding path program 1 times [2022-12-06 00:21:22,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:22,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078856342] [2022-12-06 00:21:22,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:22,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:22,827 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 00:21:22,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:22,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078856342] [2022-12-06 00:21:22,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078856342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:22,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:22,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:21:22,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866117928] [2022-12-06 00:21:22,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:22,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:21:22,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:22,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:21:22,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:21:22,829 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 37 [2022-12-06 00:21:22,829 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 00:21:22,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:22,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 37 [2022-12-06 00:21:22,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:23,056 INFO L130 PetriNetUnfolder]: 1586/2424 cut-off events. [2022-12-06 00:21:23,056 INFO L131 PetriNetUnfolder]: For 13935/14022 co-relation queries the response was YES. [2022-12-06 00:21:23,063 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 00:21:23,073 INFO L137 encePairwiseOnDemand]: 34/37 looper letters, 114 selfloop transitions, 1 changer transitions 0/117 dead transitions. [2022-12-06 00:21:23,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 117 transitions, 1396 flow [2022-12-06 00:21:23,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:21:23,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:21:23,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-12-06 00:21:23,074 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6126126126126126 [2022-12-06 00:21:23,074 INFO L175 Difference]: Start difference. First operand has 70 places, 94 transitions, 1023 flow. Second operand 3 states and 68 transitions. [2022-12-06 00:21:23,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 117 transitions, 1396 flow [2022-12-06 00:21:23,089 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 00:21:23,091 INFO L231 Difference]: Finished difference. Result has 69 places, 92 transitions, 940 flow [2022-12-06 00:21:23,091 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 00:21:23,091 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 39 predicate places. [2022-12-06 00:21:23,091 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:23,091 INFO L89 Accepts]: Start accepts. Operand has 69 places, 92 transitions, 940 flow [2022-12-06 00:21:23,092 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:23,092 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:23,092 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 92 transitions, 940 flow [2022-12-06 00:21:23,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 92 transitions, 940 flow [2022-12-06 00:21:23,116 INFO L130 PetriNetUnfolder]: 139/407 cut-off events. [2022-12-06 00:21:23,117 INFO L131 PetriNetUnfolder]: For 1506/1589 co-relation queries the response was YES. [2022-12-06 00:21:23,118 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 00:21:23,120 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 92 transitions, 940 flow [2022-12-06 00:21:23,120 INFO L188 LiptonReduction]: Number of co-enabled transitions 710 [2022-12-06 00:21:23,121 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:23,122 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-06 00:21:23,122 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 92 transitions, 940 flow [2022-12-06 00:21:23,122 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 00:21:23,122 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:23,122 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 00:21:23,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 00:21:23,122 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 00:21:23,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:23,123 INFO L85 PathProgramCache]: Analyzing trace with hash 998026839, now seen corresponding path program 2 times [2022-12-06 00:21:23,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:23,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847992021] [2022-12-06 00:21:23,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:23,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:23,585 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 00:21:23,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:23,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847992021] [2022-12-06 00:21:23,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847992021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:23,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:23,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:21:23,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081057807] [2022-12-06 00:21:23,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:23,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:21:23,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:23,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:21:23,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:21:23,589 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 00:21:23,589 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 00:21:23,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:23,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 00:21:23,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:23,921 INFO L130 PetriNetUnfolder]: 1702/2557 cut-off events. [2022-12-06 00:21:23,921 INFO L131 PetriNetUnfolder]: For 12270/12270 co-relation queries the response was YES. [2022-12-06 00:21:23,928 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 00:21:23,937 INFO L137 encePairwiseOnDemand]: 23/35 looper letters, 99 selfloop transitions, 21 changer transitions 7/127 dead transitions. [2022-12-06 00:21:23,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 127 transitions, 1382 flow [2022-12-06 00:21:23,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:21:23,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:21:23,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-12-06 00:21:23,938 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3142857142857143 [2022-12-06 00:21:23,938 INFO L175 Difference]: Start difference. First operand has 69 places, 92 transitions, 940 flow. Second operand 7 states and 77 transitions. [2022-12-06 00:21:23,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 127 transitions, 1382 flow [2022-12-06 00:21:23,960 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 00:21:23,962 INFO L231 Difference]: Finished difference. Result has 76 places, 96 transitions, 1027 flow [2022-12-06 00:21:23,962 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 00:21:23,963 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 46 predicate places. [2022-12-06 00:21:23,963 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:23,963 INFO L89 Accepts]: Start accepts. Operand has 76 places, 96 transitions, 1027 flow [2022-12-06 00:21:23,964 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:23,964 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:23,965 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 96 transitions, 1027 flow [2022-12-06 00:21:23,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 96 transitions, 1027 flow [2022-12-06 00:21:23,990 INFO L130 PetriNetUnfolder]: 144/421 cut-off events. [2022-12-06 00:21:23,991 INFO L131 PetriNetUnfolder]: For 1715/1798 co-relation queries the response was YES. [2022-12-06 00:21:23,992 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 00:21:23,995 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 96 transitions, 1027 flow [2022-12-06 00:21:23,995 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:21:24,001 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 00:21:24,047 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 00:21:24,091 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:21:24,092 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-06 00:21:24,092 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 95 transitions, 1034 flow [2022-12-06 00:21:24,092 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 00:21:24,092 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:24,092 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 00:21:24,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 00:21:24,092 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 00:21:24,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:24,092 INFO L85 PathProgramCache]: Analyzing trace with hash 702707311, now seen corresponding path program 1 times [2022-12-06 00:21:24,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:24,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917589973] [2022-12-06 00:21:24,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:24,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:24,137 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 00:21:24,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:24,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917589973] [2022-12-06 00:21:24,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917589973] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:24,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:24,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:21:24,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753567635] [2022-12-06 00:21:24,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:24,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:21:24,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:24,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:21:24,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:21:24,139 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 00:21:24,139 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 00:21:24,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:24,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 00:21:24,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:24,399 INFO L130 PetriNetUnfolder]: 1568/2381 cut-off events. [2022-12-06 00:21:24,399 INFO L131 PetriNetUnfolder]: For 12877/12877 co-relation queries the response was YES. [2022-12-06 00:21:24,406 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 00:21:24,414 INFO L137 encePairwiseOnDemand]: 29/37 looper letters, 128 selfloop transitions, 10 changer transitions 7/145 dead transitions. [2022-12-06 00:21:24,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 145 transitions, 1606 flow [2022-12-06 00:21:24,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:21:24,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:21:24,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2022-12-06 00:21:24,415 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5351351351351351 [2022-12-06 00:21:24,416 INFO L175 Difference]: Start difference. First operand has 75 places, 95 transitions, 1034 flow. Second operand 5 states and 99 transitions. [2022-12-06 00:21:24,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 145 transitions, 1606 flow [2022-12-06 00:21:24,432 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 00:21:24,433 INFO L231 Difference]: Finished difference. Result has 78 places, 89 transitions, 955 flow [2022-12-06 00:21:24,434 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 00:21:24,434 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 48 predicate places. [2022-12-06 00:21:24,434 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:24,434 INFO L89 Accepts]: Start accepts. Operand has 78 places, 89 transitions, 955 flow [2022-12-06 00:21:24,435 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:24,435 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:24,435 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 89 transitions, 955 flow [2022-12-06 00:21:24,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 89 transitions, 955 flow [2022-12-06 00:21:24,457 INFO L130 PetriNetUnfolder]: 125/364 cut-off events. [2022-12-06 00:21:24,458 INFO L131 PetriNetUnfolder]: For 1429/1470 co-relation queries the response was YES. [2022-12-06 00:21:24,459 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 00:21:24,461 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 89 transitions, 955 flow [2022-12-06 00:21:24,461 INFO L188 LiptonReduction]: Number of co-enabled transitions 692 [2022-12-06 00:21:24,462 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:24,462 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 00:21:24,462 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 89 transitions, 955 flow [2022-12-06 00:21:24,462 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 00:21:24,462 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:24,462 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 00:21:24,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 00:21:24,463 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 00:21:24,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:24,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1408419310, now seen corresponding path program 1 times [2022-12-06 00:21:24,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:24,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844534512] [2022-12-06 00:21:24,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:24,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:24,537 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 00:21:24,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:24,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844534512] [2022-12-06 00:21:24,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844534512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:24,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:24,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:21:24,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525468021] [2022-12-06 00:21:24,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:24,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:21:24,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:24,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:21:24,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:21:24,539 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 00:21:24,539 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 00:21:24,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:24,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 00:21:24,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:24,799 INFO L130 PetriNetUnfolder]: 1528/2324 cut-off events. [2022-12-06 00:21:24,800 INFO L131 PetriNetUnfolder]: For 13925/14015 co-relation queries the response was YES. [2022-12-06 00:21:24,807 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 00:21:24,817 INFO L137 encePairwiseOnDemand]: 29/34 looper letters, 124 selfloop transitions, 4 changer transitions 0/130 dead transitions. [2022-12-06 00:21:24,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 130 transitions, 1511 flow [2022-12-06 00:21:24,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:21:24,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:21:24,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-12-06 00:21:24,818 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6029411764705882 [2022-12-06 00:21:24,818 INFO L175 Difference]: Start difference. First operand has 77 places, 89 transitions, 955 flow. Second operand 4 states and 82 transitions. [2022-12-06 00:21:24,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 130 transitions, 1511 flow [2022-12-06 00:21:24,834 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 00:21:24,835 INFO L231 Difference]: Finished difference. Result has 81 places, 91 transitions, 992 flow [2022-12-06 00:21:24,836 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 00:21:24,836 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 51 predicate places. [2022-12-06 00:21:24,836 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:24,836 INFO L89 Accepts]: Start accepts. Operand has 81 places, 91 transitions, 992 flow [2022-12-06 00:21:24,837 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:24,837 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:24,837 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 91 transitions, 992 flow [2022-12-06 00:21:24,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 91 transitions, 992 flow [2022-12-06 00:21:24,878 INFO L130 PetriNetUnfolder]: 143/403 cut-off events. [2022-12-06 00:21:24,879 INFO L131 PetriNetUnfolder]: For 1720/1781 co-relation queries the response was YES. [2022-12-06 00:21:24,880 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 00:21:24,883 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 91 transitions, 992 flow [2022-12-06 00:21:24,883 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:21:24,884 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:24,887 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-06 00:21:24,887 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 91 transitions, 992 flow [2022-12-06 00:21:24,887 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 00:21:24,887 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:24,887 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 00:21:24,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 00:21:24,887 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 00:21:24,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:24,888 INFO L85 PathProgramCache]: Analyzing trace with hash 569166126, now seen corresponding path program 1 times [2022-12-06 00:21:24,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:24,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641295019] [2022-12-06 00:21:24,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:24,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:24,935 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 00:21:24,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:24,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641295019] [2022-12-06 00:21:24,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641295019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:24,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:24,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:21:24,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777991022] [2022-12-06 00:21:24,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:24,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:21:24,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:24,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:21:24,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:21:24,937 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 00:21:24,937 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 00:21:24,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:24,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 00:21:24,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:25,173 INFO L130 PetriNetUnfolder]: 1427/2222 cut-off events. [2022-12-06 00:21:25,173 INFO L131 PetriNetUnfolder]: For 15700/15839 co-relation queries the response was YES. [2022-12-06 00:21:25,180 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 00:21:25,188 INFO L137 encePairwiseOnDemand]: 30/34 looper letters, 108 selfloop transitions, 5 changer transitions 1/116 dead transitions. [2022-12-06 00:21:25,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 116 transitions, 1370 flow [2022-12-06 00:21:25,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:21:25,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:21:25,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-12-06 00:21:25,189 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5661764705882353 [2022-12-06 00:21:25,189 INFO L175 Difference]: Start difference. First operand has 81 places, 91 transitions, 992 flow. Second operand 4 states and 77 transitions. [2022-12-06 00:21:25,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 116 transitions, 1370 flow [2022-12-06 00:21:25,206 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 00:21:25,207 INFO L231 Difference]: Finished difference. Result has 83 places, 84 transitions, 933 flow [2022-12-06 00:21:25,207 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 00:21:25,207 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 53 predicate places. [2022-12-06 00:21:25,208 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:25,208 INFO L89 Accepts]: Start accepts. Operand has 83 places, 84 transitions, 933 flow [2022-12-06 00:21:25,208 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:25,208 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:25,209 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 84 transitions, 933 flow [2022-12-06 00:21:25,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 84 transitions, 933 flow [2022-12-06 00:21:25,232 INFO L130 PetriNetUnfolder]: 119/368 cut-off events. [2022-12-06 00:21:25,232 INFO L131 PetriNetUnfolder]: For 1587/1644 co-relation queries the response was YES. [2022-12-06 00:21:25,233 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 00:21:25,235 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 84 transitions, 933 flow [2022-12-06 00:21:25,236 INFO L188 LiptonReduction]: Number of co-enabled transitions 656 [2022-12-06 00:21:25,421 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:21:25,422 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-06 00:21:25,422 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 84 transitions, 944 flow [2022-12-06 00:21:25,422 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 00:21:25,422 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:25,422 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 00:21:25,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 00:21:25,422 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 00:21:25,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:25,423 INFO L85 PathProgramCache]: Analyzing trace with hash 2141029274, now seen corresponding path program 1 times [2022-12-06 00:21:25,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:25,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91117759] [2022-12-06 00:21:25,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:25,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:25,490 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 00:21:25,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:25,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91117759] [2022-12-06 00:21:25,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91117759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:25,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:25,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:21:25,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450094651] [2022-12-06 00:21:25,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:25,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:21:25,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:25,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:21:25,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:21:25,492 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 00:21:25,493 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 00:21:25,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:25,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 00:21:25,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:25,754 INFO L130 PetriNetUnfolder]: 1380/2175 cut-off events. [2022-12-06 00:21:25,755 INFO L131 PetriNetUnfolder]: For 14458/14458 co-relation queries the response was YES. [2022-12-06 00:21:25,760 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 00:21:25,767 INFO L137 encePairwiseOnDemand]: 31/39 looper letters, 99 selfloop transitions, 12 changer transitions 5/116 dead transitions. [2022-12-06 00:21:25,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 116 transitions, 1380 flow [2022-12-06 00:21:25,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:21:25,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:21:25,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-12-06 00:21:25,769 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.532051282051282 [2022-12-06 00:21:25,769 INFO L175 Difference]: Start difference. First operand has 83 places, 84 transitions, 944 flow. Second operand 4 states and 83 transitions. [2022-12-06 00:21:25,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 116 transitions, 1380 flow [2022-12-06 00:21:25,791 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 00:21:25,795 INFO L231 Difference]: Finished difference. Result has 84 places, 75 transitions, 851 flow [2022-12-06 00:21:25,796 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 00:21:25,796 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 54 predicate places. [2022-12-06 00:21:25,796 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:25,796 INFO L89 Accepts]: Start accepts. Operand has 84 places, 75 transitions, 851 flow [2022-12-06 00:21:25,797 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:25,797 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:25,797 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 75 transitions, 851 flow [2022-12-06 00:21:25,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 75 transitions, 851 flow [2022-12-06 00:21:25,818 INFO L130 PetriNetUnfolder]: 90/319 cut-off events. [2022-12-06 00:21:25,818 INFO L131 PetriNetUnfolder]: For 1594/1643 co-relation queries the response was YES. [2022-12-06 00:21:25,819 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 00:21:25,821 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 75 transitions, 851 flow [2022-12-06 00:21:25,821 INFO L188 LiptonReduction]: Number of co-enabled transitions 560 [2022-12-06 00:21:25,822 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:25,823 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 00:21:25,823 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 75 transitions, 851 flow [2022-12-06 00:21:25,823 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 00:21:25,823 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:25,823 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 00:21:25,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 00:21:25,823 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 00:21:25,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:25,824 INFO L85 PathProgramCache]: Analyzing trace with hash 686814983, now seen corresponding path program 1 times [2022-12-06 00:21:25,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:25,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180330246] [2022-12-06 00:21:25,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:25,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:25,918 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 00:21:25,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:25,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180330246] [2022-12-06 00:21:25,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180330246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:25,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:25,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:21:25,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375977386] [2022-12-06 00:21:25,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:25,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:21:25,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:25,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:21:25,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:21:25,920 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 00:21:25,920 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 00:21:25,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:25,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 00:21:25,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:26,121 INFO L130 PetriNetUnfolder]: 1376/2195 cut-off events. [2022-12-06 00:21:26,121 INFO L131 PetriNetUnfolder]: For 15072/15072 co-relation queries the response was YES. [2022-12-06 00:21:26,128 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 00:21:26,137 INFO L137 encePairwiseOnDemand]: 35/39 looper letters, 95 selfloop transitions, 2 changer transitions 1/98 dead transitions. [2022-12-06 00:21:26,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 98 transitions, 1182 flow [2022-12-06 00:21:26,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:21:26,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:21:26,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-12-06 00:21:26,138 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2022-12-06 00:21:26,138 INFO L175 Difference]: Start difference. First operand has 84 places, 75 transitions, 851 flow. Second operand 3 states and 69 transitions. [2022-12-06 00:21:26,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 98 transitions, 1182 flow [2022-12-06 00:21:26,161 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 00:21:26,162 INFO L231 Difference]: Finished difference. Result has 84 places, 73 transitions, 801 flow [2022-12-06 00:21:26,162 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 00:21:26,163 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 54 predicate places. [2022-12-06 00:21:26,163 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:26,164 INFO L89 Accepts]: Start accepts. Operand has 84 places, 73 transitions, 801 flow [2022-12-06 00:21:26,166 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:26,166 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:26,166 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 73 transitions, 801 flow [2022-12-06 00:21:26,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 73 transitions, 801 flow [2022-12-06 00:21:26,186 INFO L130 PetriNetUnfolder]: 86/315 cut-off events. [2022-12-06 00:21:26,186 INFO L131 PetriNetUnfolder]: For 1428/1476 co-relation queries the response was YES. [2022-12-06 00:21:26,187 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 00:21:26,189 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 73 transitions, 801 flow [2022-12-06 00:21:26,189 INFO L188 LiptonReduction]: Number of co-enabled transitions 542 [2022-12-06 00:21:26,190 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:26,191 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 00:21:26,192 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 73 transitions, 801 flow [2022-12-06 00:21:26,192 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 00:21:26,192 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:26,192 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 00:21:26,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 00:21:26,192 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 00:21:26,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:26,192 INFO L85 PathProgramCache]: Analyzing trace with hash 586471010, now seen corresponding path program 1 times [2022-12-06 00:21:26,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:26,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036369056] [2022-12-06 00:21:26,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:26,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:26,232 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 00:21:26,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:26,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036369056] [2022-12-06 00:21:26,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036369056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:26,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:26,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:21:26,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747805777] [2022-12-06 00:21:26,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:26,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:21:26,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:26,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:21:26,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:21:26,234 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 00:21:26,234 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 00:21:26,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:26,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 00:21:26,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:26,493 INFO L130 PetriNetUnfolder]: 1443/2302 cut-off events. [2022-12-06 00:21:26,494 INFO L131 PetriNetUnfolder]: For 14754/14754 co-relation queries the response was YES. [2022-12-06 00:21:26,500 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 00:21:26,507 INFO L137 encePairwiseOnDemand]: 31/37 looper letters, 107 selfloop transitions, 4 changer transitions 6/117 dead transitions. [2022-12-06 00:21:26,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 117 transitions, 1301 flow [2022-12-06 00:21:26,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:21:26,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:21:26,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2022-12-06 00:21:26,508 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4810810810810811 [2022-12-06 00:21:26,508 INFO L175 Difference]: Start difference. First operand has 84 places, 73 transitions, 801 flow. Second operand 5 states and 89 transitions. [2022-12-06 00:21:26,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 117 transitions, 1301 flow [2022-12-06 00:21:26,533 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 00:21:26,535 INFO L231 Difference]: Finished difference. Result has 89 places, 70 transitions, 739 flow [2022-12-06 00:21:26,535 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 00:21:26,535 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 59 predicate places. [2022-12-06 00:21:26,535 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:26,536 INFO L89 Accepts]: Start accepts. Operand has 89 places, 70 transitions, 739 flow [2022-12-06 00:21:26,536 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:26,536 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:26,536 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 70 transitions, 739 flow [2022-12-06 00:21:26,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 70 transitions, 739 flow [2022-12-06 00:21:26,555 INFO L130 PetriNetUnfolder]: 82/295 cut-off events. [2022-12-06 00:21:26,555 INFO L131 PetriNetUnfolder]: For 1368/1414 co-relation queries the response was YES. [2022-12-06 00:21:26,556 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 00:21:26,558 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 70 transitions, 739 flow [2022-12-06 00:21:26,558 INFO L188 LiptonReduction]: Number of co-enabled transitions 530 [2022-12-06 00:21:26,560 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 00:21:26,590 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:21:26,591 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-06 00:21:26,591 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 70 transitions, 750 flow [2022-12-06 00:21:26,591 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 00:21:26,591 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:26,591 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 00:21:26,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 00:21:26,592 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 00:21:26,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:26,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1829278939, now seen corresponding path program 1 times [2022-12-06 00:21:26,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:26,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682125970] [2022-12-06 00:21:26,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:26,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:26,649 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 00:21:26,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:26,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682125970] [2022-12-06 00:21:26,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682125970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:26,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:26,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:21:26,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589278151] [2022-12-06 00:21:26,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:26,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:21:26,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:26,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:21:26,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:21:26,651 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 00:21:26,652 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 00:21:26,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:26,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 00:21:26,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:26,880 INFO L130 PetriNetUnfolder]: 1299/2098 cut-off events. [2022-12-06 00:21:26,880 INFO L131 PetriNetUnfolder]: For 13364/13364 co-relation queries the response was YES. [2022-12-06 00:21:26,887 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 00:21:26,894 INFO L137 encePairwiseOnDemand]: 29/38 looper letters, 103 selfloop transitions, 7 changer transitions 2/112 dead transitions. [2022-12-06 00:21:26,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 112 transitions, 1226 flow [2022-12-06 00:21:26,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:21:26,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:21:26,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-12-06 00:21:26,895 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4631578947368421 [2022-12-06 00:21:26,895 INFO L175 Difference]: Start difference. First operand has 89 places, 70 transitions, 750 flow. Second operand 5 states and 88 transitions. [2022-12-06 00:21:26,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 112 transitions, 1226 flow [2022-12-06 00:21:26,921 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 00:21:26,922 INFO L231 Difference]: Finished difference. Result has 92 places, 68 transitions, 729 flow [2022-12-06 00:21:26,922 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 00:21:26,923 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 62 predicate places. [2022-12-06 00:21:26,923 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:26,923 INFO L89 Accepts]: Start accepts. Operand has 92 places, 68 transitions, 729 flow [2022-12-06 00:21:26,924 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:26,924 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:26,925 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 68 transitions, 729 flow [2022-12-06 00:21:26,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 68 transitions, 729 flow [2022-12-06 00:21:26,943 INFO L130 PetriNetUnfolder]: 79/287 cut-off events. [2022-12-06 00:21:26,943 INFO L131 PetriNetUnfolder]: For 1384/1427 co-relation queries the response was YES. [2022-12-06 00:21:26,944 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 00:21:26,946 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 68 transitions, 729 flow [2022-12-06 00:21:26,946 INFO L188 LiptonReduction]: Number of co-enabled transitions 500 [2022-12-06 00:21:26,947 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:26,948 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 00:21:26,948 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 68 transitions, 729 flow [2022-12-06 00:21:26,948 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 00:21:26,948 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:26,948 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 00:21:26,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 00:21:26,948 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 00:21:26,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:26,949 INFO L85 PathProgramCache]: Analyzing trace with hash 31418726, now seen corresponding path program 1 times [2022-12-06 00:21:26,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:26,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840862734] [2022-12-06 00:21:26,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:26,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:27,029 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 00:21:27,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:27,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840862734] [2022-12-06 00:21:27,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840862734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:27,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:27,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:21:27,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360078477] [2022-12-06 00:21:27,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:27,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:21:27,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:27,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:21:27,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:21:27,031 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 00:21:27,031 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 00:21:27,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:27,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 00:21:27,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:27,263 INFO L130 PetriNetUnfolder]: 1223/1990 cut-off events. [2022-12-06 00:21:27,263 INFO L131 PetriNetUnfolder]: For 12798/12798 co-relation queries the response was YES. [2022-12-06 00:21:27,269 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 00:21:27,275 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 102 selfloop transitions, 4 changer transitions 4/110 dead transitions. [2022-12-06 00:21:27,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 110 transitions, 1205 flow [2022-12-06 00:21:27,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:21:27,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:21:27,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-12-06 00:21:27,276 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49142857142857144 [2022-12-06 00:21:27,276 INFO L175 Difference]: Start difference. First operand has 92 places, 68 transitions, 729 flow. Second operand 5 states and 86 transitions. [2022-12-06 00:21:27,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 110 transitions, 1205 flow [2022-12-06 00:21:27,295 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 00:21:27,296 INFO L231 Difference]: Finished difference. Result has 95 places, 64 transitions, 670 flow [2022-12-06 00:21:27,296 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 00:21:27,297 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 65 predicate places. [2022-12-06 00:21:27,297 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:27,297 INFO L89 Accepts]: Start accepts. Operand has 95 places, 64 transitions, 670 flow [2022-12-06 00:21:27,298 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:27,298 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:27,298 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 64 transitions, 670 flow [2022-12-06 00:21:27,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 64 transitions, 670 flow [2022-12-06 00:21:27,315 INFO L130 PetriNetUnfolder]: 72/276 cut-off events. [2022-12-06 00:21:27,315 INFO L131 PetriNetUnfolder]: For 1318/1361 co-relation queries the response was YES. [2022-12-06 00:21:27,316 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 00:21:27,318 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 64 transitions, 670 flow [2022-12-06 00:21:27,318 INFO L188 LiptonReduction]: Number of co-enabled transitions 464 [2022-12-06 00:21:27,329 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 00:21:27,465 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 00:21:27,572 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:21:27,573 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 276 [2022-12-06 00:21:27,573 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 63 transitions, 696 flow [2022-12-06 00:21:27,573 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 00:21:27,573 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:27,573 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 00:21:27,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 00:21:27,573 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 00:21:27,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:27,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1696855821, now seen corresponding path program 1 times [2022-12-06 00:21:27,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:27,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869344038] [2022-12-06 00:21:27,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:27,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:27,628 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 00:21:27,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:27,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869344038] [2022-12-06 00:21:27,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869344038] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:27,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:27,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:21:27,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187086127] [2022-12-06 00:21:27,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:27,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:21:27,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:27,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:21:27,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:21:27,630 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 00:21:27,630 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 00:21:27,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:27,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 00:21:27,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:27,960 INFO L130 PetriNetUnfolder]: 1085/1798 cut-off events. [2022-12-06 00:21:27,960 INFO L131 PetriNetUnfolder]: For 12370/12370 co-relation queries the response was YES. [2022-12-06 00:21:27,966 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 00:21:27,971 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 120 selfloop transitions, 10 changer transitions 9/139 dead transitions. [2022-12-06 00:21:27,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 139 transitions, 1364 flow [2022-12-06 00:21:27,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:21:27,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:21:27,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 124 transitions. [2022-12-06 00:21:27,973 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37237237237237236 [2022-12-06 00:21:27,973 INFO L175 Difference]: Start difference. First operand has 93 places, 63 transitions, 696 flow. Second operand 9 states and 124 transitions. [2022-12-06 00:21:27,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 139 transitions, 1364 flow [2022-12-06 00:21:27,994 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 00:21:27,996 INFO L231 Difference]: Finished difference. Result has 93 places, 53 transitions, 511 flow [2022-12-06 00:21:27,996 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 00:21:27,996 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 63 predicate places. [2022-12-06 00:21:27,996 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:27,996 INFO L89 Accepts]: Start accepts. Operand has 93 places, 53 transitions, 511 flow [2022-12-06 00:21:27,997 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:27,997 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:27,997 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 53 transitions, 511 flow [2022-12-06 00:21:27,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 53 transitions, 511 flow [2022-12-06 00:21:28,010 INFO L130 PetriNetUnfolder]: 64/206 cut-off events. [2022-12-06 00:21:28,011 INFO L131 PetriNetUnfolder]: For 735/778 co-relation queries the response was YES. [2022-12-06 00:21:28,012 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 00:21:28,013 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 53 transitions, 511 flow [2022-12-06 00:21:28,013 INFO L188 LiptonReduction]: Number of co-enabled transitions 374 [2022-12-06 00:21:28,014 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:28,015 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 00:21:28,015 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 53 transitions, 511 flow [2022-12-06 00:21:28,015 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 00:21:28,015 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:28,015 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 00:21:28,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 00:21:28,016 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 00:21:28,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:28,016 INFO L85 PathProgramCache]: Analyzing trace with hash -622438843, now seen corresponding path program 1 times [2022-12-06 00:21:28,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:28,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037337017] [2022-12-06 00:21:28,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:28,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:28,086 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 00:21:28,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:28,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037337017] [2022-12-06 00:21:28,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037337017] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:28,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:28,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:21:28,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429488371] [2022-12-06 00:21:28,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:28,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:21:28,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:28,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:21:28,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:21:28,088 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 00:21:28,088 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 00:21:28,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:28,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 00:21:28,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:28,272 INFO L130 PetriNetUnfolder]: 780/1217 cut-off events. [2022-12-06 00:21:28,272 INFO L131 PetriNetUnfolder]: For 7550/7550 co-relation queries the response was YES. [2022-12-06 00:21:28,276 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 00:21:28,281 INFO L137 encePairwiseOnDemand]: 30/36 looper letters, 84 selfloop transitions, 4 changer transitions 2/90 dead transitions. [2022-12-06 00:21:28,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 90 transitions, 871 flow [2022-12-06 00:21:28,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:21:28,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:21:28,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-12-06 00:21:28,283 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4388888888888889 [2022-12-06 00:21:28,283 INFO L175 Difference]: Start difference. First operand has 87 places, 53 transitions, 511 flow. Second operand 5 states and 79 transitions. [2022-12-06 00:21:28,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 90 transitions, 871 flow [2022-12-06 00:21:28,293 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 00:21:28,294 INFO L231 Difference]: Finished difference. Result has 78 places, 49 transitions, 389 flow [2022-12-06 00:21:28,294 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 00:21:28,295 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 48 predicate places. [2022-12-06 00:21:28,295 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:28,295 INFO L89 Accepts]: Start accepts. Operand has 78 places, 49 transitions, 389 flow [2022-12-06 00:21:28,296 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:28,296 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:28,296 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 49 transitions, 389 flow [2022-12-06 00:21:28,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 49 transitions, 389 flow [2022-12-06 00:21:28,310 INFO L130 PetriNetUnfolder]: 61/191 cut-off events. [2022-12-06 00:21:28,310 INFO L131 PetriNetUnfolder]: For 503/544 co-relation queries the response was YES. [2022-12-06 00:21:28,311 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 00:21:28,312 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 49 transitions, 389 flow [2022-12-06 00:21:28,312 INFO L188 LiptonReduction]: Number of co-enabled transitions 354 [2022-12-06 00:21:28,312 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:28,313 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 00:21:28,313 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 49 transitions, 389 flow [2022-12-06 00:21:28,313 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 00:21:28,313 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:28,313 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 00:21:28,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 00:21:28,313 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 00:21:28,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:28,314 INFO L85 PathProgramCache]: Analyzing trace with hash 828824796, now seen corresponding path program 1 times [2022-12-06 00:21:28,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:28,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090474306] [2022-12-06 00:21:28,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:28,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:28,741 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 00:21:28,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:28,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090474306] [2022-12-06 00:21:28,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090474306] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:28,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:28,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:21:28,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133966141] [2022-12-06 00:21:28,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:28,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:21:28,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:28,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:21:28,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:21:28,742 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 00:21:28,743 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 00:21:28,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:28,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 00:21:28,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:28,941 INFO L130 PetriNetUnfolder]: 719/1126 cut-off events. [2022-12-06 00:21:28,941 INFO L131 PetriNetUnfolder]: For 4765/4858 co-relation queries the response was YES. [2022-12-06 00:21:28,944 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 00:21:28,947 INFO L137 encePairwiseOnDemand]: 24/34 looper letters, 40 selfloop transitions, 8 changer transitions 26/76 dead transitions. [2022-12-06 00:21:28,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 76 transitions, 653 flow [2022-12-06 00:21:28,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:21:28,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:21:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-12-06 00:21:28,947 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3431372549019608 [2022-12-06 00:21:28,947 INFO L175 Difference]: Start difference. First operand has 78 places, 49 transitions, 389 flow. Second operand 6 states and 70 transitions. [2022-12-06 00:21:28,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 76 transitions, 653 flow [2022-12-06 00:21:28,953 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 00:21:28,954 INFO L231 Difference]: Finished difference. Result has 79 places, 43 transitions, 317 flow [2022-12-06 00:21:28,954 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 00:21:28,955 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 49 predicate places. [2022-12-06 00:21:28,955 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:28,955 INFO L89 Accepts]: Start accepts. Operand has 79 places, 43 transitions, 317 flow [2022-12-06 00:21:28,955 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:28,955 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:28,955 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 43 transitions, 317 flow [2022-12-06 00:21:28,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 43 transitions, 317 flow [2022-12-06 00:21:28,965 INFO L130 PetriNetUnfolder]: 61/165 cut-off events. [2022-12-06 00:21:28,965 INFO L131 PetriNetUnfolder]: For 393/432 co-relation queries the response was YES. [2022-12-06 00:21:28,966 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 00:21:28,967 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 43 transitions, 317 flow [2022-12-06 00:21:28,967 INFO L188 LiptonReduction]: Number of co-enabled transitions 310 [2022-12-06 00:21:28,968 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:28,968 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 00:21:28,968 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 43 transitions, 317 flow [2022-12-06 00:21:28,968 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 00:21:28,969 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:28,969 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 00:21:28,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 00:21:28,969 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 00:21:28,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:28,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1708469611, now seen corresponding path program 1 times [2022-12-06 00:21:28,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:28,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992413283] [2022-12-06 00:21:28,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:28,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:29,024 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 00:21:29,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:29,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992413283] [2022-12-06 00:21:29,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992413283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:29,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:29,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:21:29,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74804092] [2022-12-06 00:21:29,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:29,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:21:29,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:29,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:21:29,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:21:29,026 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 00:21:29,026 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 00:21:29,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:29,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 00:21:29,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:29,198 INFO L130 PetriNetUnfolder]: 880/1322 cut-off events. [2022-12-06 00:21:29,199 INFO L131 PetriNetUnfolder]: For 4552/4552 co-relation queries the response was YES. [2022-12-06 00:21:29,201 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 00:21:29,204 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 59 selfloop transitions, 16 changer transitions 0/75 dead transitions. [2022-12-06 00:21:29,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 75 transitions, 648 flow [2022-12-06 00:21:29,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:21:29,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:21:29,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-06 00:21:29,205 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3878787878787879 [2022-12-06 00:21:29,205 INFO L175 Difference]: Start difference. First operand has 68 places, 43 transitions, 317 flow. Second operand 5 states and 64 transitions. [2022-12-06 00:21:29,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 75 transitions, 648 flow [2022-12-06 00:21:29,212 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 00:21:29,213 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 362 flow [2022-12-06 00:21:29,213 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 00:21:29,216 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 32 predicate places. [2022-12-06 00:21:29,216 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:29,216 INFO L89 Accepts]: Start accepts. Operand has 62 places, 47 transitions, 362 flow [2022-12-06 00:21:29,216 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:29,216 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:29,217 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 47 transitions, 362 flow [2022-12-06 00:21:29,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 47 transitions, 362 flow [2022-12-06 00:21:29,228 INFO L130 PetriNetUnfolder]: 77/210 cut-off events. [2022-12-06 00:21:29,228 INFO L131 PetriNetUnfolder]: For 464/519 co-relation queries the response was YES. [2022-12-06 00:21:29,229 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 00:21:29,230 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 47 transitions, 362 flow [2022-12-06 00:21:29,230 INFO L188 LiptonReduction]: Number of co-enabled transitions 358 [2022-12-06 00:21:29,230 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:29,232 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 00:21:29,232 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 362 flow [2022-12-06 00:21:29,232 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 00:21:29,233 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:29,233 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 00:21:29,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 00:21:29,233 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 00:21:29,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:29,233 INFO L85 PathProgramCache]: Analyzing trace with hash 807789503, now seen corresponding path program 1 times [2022-12-06 00:21:29,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:29,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736357782] [2022-12-06 00:21:29,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:29,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:29,291 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 00:21:29,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:29,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736357782] [2022-12-06 00:21:29,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736357782] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:29,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:29,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:21:29,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731547858] [2022-12-06 00:21:29,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:29,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:21:29,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:29,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:21:29,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:21:29,294 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 00:21:29,294 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 00:21:29,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:29,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 00:21:29,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:29,432 INFO L130 PetriNetUnfolder]: 866/1294 cut-off events. [2022-12-06 00:21:29,432 INFO L131 PetriNetUnfolder]: For 4088/4088 co-relation queries the response was YES. [2022-12-06 00:21:29,434 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 00:21:29,438 INFO L137 encePairwiseOnDemand]: 27/33 looper letters, 62 selfloop transitions, 5 changer transitions 0/67 dead transitions. [2022-12-06 00:21:29,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 67 transitions, 575 flow [2022-12-06 00:21:29,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:21:29,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:21:29,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-12-06 00:21:29,438 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3393939393939394 [2022-12-06 00:21:29,439 INFO L175 Difference]: Start difference. First operand has 62 places, 47 transitions, 362 flow. Second operand 5 states and 56 transitions. [2022-12-06 00:21:29,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 67 transitions, 575 flow [2022-12-06 00:21:29,443 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 00:21:29,443 INFO L231 Difference]: Finished difference. Result has 64 places, 46 transitions, 362 flow [2022-12-06 00:21:29,444 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 00:21:29,445 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 34 predicate places. [2022-12-06 00:21:29,445 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:29,445 INFO L89 Accepts]: Start accepts. Operand has 64 places, 46 transitions, 362 flow [2022-12-06 00:21:29,446 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:29,446 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:29,446 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 46 transitions, 362 flow [2022-12-06 00:21:29,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 46 transitions, 362 flow [2022-12-06 00:21:29,457 INFO L130 PetriNetUnfolder]: 77/204 cut-off events. [2022-12-06 00:21:29,457 INFO L131 PetriNetUnfolder]: For 469/528 co-relation queries the response was YES. [2022-12-06 00:21:29,458 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 00:21:29,459 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 46 transitions, 362 flow [2022-12-06 00:21:29,459 INFO L188 LiptonReduction]: Number of co-enabled transitions 344 [2022-12-06 00:21:29,460 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:29,460 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 00:21:29,461 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 362 flow [2022-12-06 00:21:29,461 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 00:21:29,461 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:29,461 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 00:21:29,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-06 00:21:29,461 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 00:21:29,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:29,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1572366623, now seen corresponding path program 1 times [2022-12-06 00:21:29,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:29,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096596263] [2022-12-06 00:21:29,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:29,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:29,518 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 00:21:29,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:29,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096596263] [2022-12-06 00:21:29,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096596263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:29,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:29,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:21:29,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790333044] [2022-12-06 00:21:29,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:29,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:21:29,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:29,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:21:29,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:21:29,519 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 00:21:29,519 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 00:21:29,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:29,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 00:21:29,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:29,668 INFO L130 PetriNetUnfolder]: 954/1428 cut-off events. [2022-12-06 00:21:29,669 INFO L131 PetriNetUnfolder]: For 4528/4528 co-relation queries the response was YES. [2022-12-06 00:21:29,672 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 00:21:29,676 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 62 selfloop transitions, 7 changer transitions 0/69 dead transitions. [2022-12-06 00:21:29,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 69 transitions, 613 flow [2022-12-06 00:21:29,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:21:29,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:21:29,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-06 00:21:29,677 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-06 00:21:29,677 INFO L175 Difference]: Start difference. First operand has 64 places, 46 transitions, 362 flow. Second operand 5 states and 55 transitions. [2022-12-06 00:21:29,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 69 transitions, 613 flow [2022-12-06 00:21:29,681 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 00:21:29,682 INFO L231 Difference]: Finished difference. Result has 66 places, 50 transitions, 413 flow [2022-12-06 00:21:29,682 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 00:21:29,683 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 36 predicate places. [2022-12-06 00:21:29,683 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:29,683 INFO L89 Accepts]: Start accepts. Operand has 66 places, 50 transitions, 413 flow [2022-12-06 00:21:29,683 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:29,683 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:29,683 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 50 transitions, 413 flow [2022-12-06 00:21:29,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 50 transitions, 413 flow [2022-12-06 00:21:29,696 INFO L130 PetriNetUnfolder]: 92/243 cut-off events. [2022-12-06 00:21:29,696 INFO L131 PetriNetUnfolder]: For 661/724 co-relation queries the response was YES. [2022-12-06 00:21:29,697 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 00:21:29,698 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 50 transitions, 413 flow [2022-12-06 00:21:29,698 INFO L188 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-06 00:21:29,699 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:29,699 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 00:21:29,699 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 50 transitions, 413 flow [2022-12-06 00:21:29,699 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 00:21:29,699 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:29,699 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 00:21:29,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-06 00:21:29,700 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 00:21:29,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:29,700 INFO L85 PathProgramCache]: Analyzing trace with hash 471555651, now seen corresponding path program 2 times [2022-12-06 00:21:29,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:29,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169479472] [2022-12-06 00:21:29,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:29,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:29,758 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 00:21:29,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:29,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169479472] [2022-12-06 00:21:29,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169479472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:29,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:29,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:21:29,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835542254] [2022-12-06 00:21:29,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:29,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:21:29,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:29,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:21:29,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:21:29,759 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 00:21:29,759 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 00:21:29,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:29,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 00:21:29,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:29,910 INFO L130 PetriNetUnfolder]: 940/1400 cut-off events. [2022-12-06 00:21:29,911 INFO L131 PetriNetUnfolder]: For 5434/5434 co-relation queries the response was YES. [2022-12-06 00:21:29,915 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 00:21:29,918 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 60 selfloop transitions, 8 changer transitions 0/68 dead transitions. [2022-12-06 00:21:29,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 636 flow [2022-12-06 00:21:29,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:21:29,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:21:29,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-12-06 00:21:29,919 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3212121212121212 [2022-12-06 00:21:29,919 INFO L175 Difference]: Start difference. First operand has 66 places, 50 transitions, 413 flow. Second operand 5 states and 53 transitions. [2022-12-06 00:21:29,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 636 flow [2022-12-06 00:21:29,925 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 00:21:29,926 INFO L231 Difference]: Finished difference. Result has 71 places, 52 transitions, 450 flow [2022-12-06 00:21:29,926 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 00:21:29,926 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 41 predicate places. [2022-12-06 00:21:29,926 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:29,926 INFO L89 Accepts]: Start accepts. Operand has 71 places, 52 transitions, 450 flow [2022-12-06 00:21:29,927 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:29,927 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:29,927 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 52 transitions, 450 flow [2022-12-06 00:21:29,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 52 transitions, 450 flow [2022-12-06 00:21:29,940 INFO L130 PetriNetUnfolder]: 91/235 cut-off events. [2022-12-06 00:21:29,940 INFO L131 PetriNetUnfolder]: For 835/908 co-relation queries the response was YES. [2022-12-06 00:21:29,941 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 00:21:29,942 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 52 transitions, 450 flow [2022-12-06 00:21:29,942 INFO L188 LiptonReduction]: Number of co-enabled transitions 408 [2022-12-06 00:21:29,945 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 00:21:29,993 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:21:29,994 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-06 00:21:29,994 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 52 transitions, 467 flow [2022-12-06 00:21:29,994 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 00:21:29,994 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:29,994 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 00:21:29,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-06 00:21:29,994 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 00:21:29,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:29,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1461012245, now seen corresponding path program 2 times [2022-12-06 00:21:29,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:29,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086753820] [2022-12-06 00:21:29,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:29,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:30,046 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 00:21:30,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:30,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086753820] [2022-12-06 00:21:30,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086753820] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:30,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:30,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:21:30,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109193341] [2022-12-06 00:21:30,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:30,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:21:30,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:30,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:21:30,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:21:30,047 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 00:21:30,047 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 00:21:30,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:30,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 00:21:30,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:30,220 INFO L130 PetriNetUnfolder]: 926/1372 cut-off events. [2022-12-06 00:21:30,220 INFO L131 PetriNetUnfolder]: For 5084/5084 co-relation queries the response was YES. [2022-12-06 00:21:30,224 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 00:21:30,228 INFO L137 encePairwiseOnDemand]: 21/34 looper letters, 77 selfloop transitions, 17 changer transitions 1/95 dead transitions. [2022-12-06 00:21:30,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 95 transitions, 879 flow [2022-12-06 00:21:30,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:21:30,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:21:30,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-12-06 00:21:30,229 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39215686274509803 [2022-12-06 00:21:30,229 INFO L175 Difference]: Start difference. First operand has 71 places, 52 transitions, 467 flow. Second operand 6 states and 80 transitions. [2022-12-06 00:21:30,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 95 transitions, 879 flow [2022-12-06 00:21:30,236 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 00:21:30,237 INFO L231 Difference]: Finished difference. Result has 76 places, 54 transitions, 513 flow [2022-12-06 00:21:30,237 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 00:21:30,237 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 46 predicate places. [2022-12-06 00:21:30,237 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:30,238 INFO L89 Accepts]: Start accepts. Operand has 76 places, 54 transitions, 513 flow [2022-12-06 00:21:30,238 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:30,238 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:30,238 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 54 transitions, 513 flow [2022-12-06 00:21:30,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 54 transitions, 513 flow [2022-12-06 00:21:30,251 INFO L130 PetriNetUnfolder]: 97/238 cut-off events. [2022-12-06 00:21:30,251 INFO L131 PetriNetUnfolder]: For 1117/1189 co-relation queries the response was YES. [2022-12-06 00:21:30,252 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 00:21:30,253 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 54 transitions, 513 flow [2022-12-06 00:21:30,253 INFO L188 LiptonReduction]: Number of co-enabled transitions 424 [2022-12-06 00:21:30,254 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:30,254 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 00:21:30,254 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 54 transitions, 513 flow [2022-12-06 00:21:30,255 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 00:21:30,255 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:30,255 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 00:21:30,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-06 00:21:30,255 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 00:21:30,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:30,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1616721691, now seen corresponding path program 1 times [2022-12-06 00:21:30,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:30,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231346706] [2022-12-06 00:21:30,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:30,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:30,768 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 00:21:30,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:30,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231346706] [2022-12-06 00:21:30,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231346706] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:21:30,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35022588] [2022-12-06 00:21:30,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:30,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:21:30,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:21:30,777 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 00:21:30,825 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 00:21:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:30,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-06 00:21:30,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:21:30,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:21:30,993 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 00:21:31,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:21:31,054 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 00:21:31,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:21:31,174 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 00:21:31,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:21:31,331 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 00:21:31,458 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:21:31,458 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 00:21:31,493 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 00:21:31,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:21:31,817 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 00:21:31,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 00:21:31,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35022588] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:21:31,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:21:31,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 23 [2022-12-06 00:21:31,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610309627] [2022-12-06 00:21:31,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:21:31,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 00:21:31,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:31,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 00:21:31,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=449, Unknown=22, NotChecked=44, Total=600 [2022-12-06 00:21:31,820 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 00:21:31,821 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 00:21:31,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:31,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 00:21:31,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:32,276 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 00:21:32,980 INFO L130 PetriNetUnfolder]: 1307/1944 cut-off events. [2022-12-06 00:21:32,980 INFO L131 PetriNetUnfolder]: For 10297/10547 co-relation queries the response was YES. [2022-12-06 00:21:32,985 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 00:21:32,992 INFO L137 encePairwiseOnDemand]: 11/34 looper letters, 100 selfloop transitions, 58 changer transitions 7/167 dead transitions. [2022-12-06 00:21:32,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 167 transitions, 1707 flow [2022-12-06 00:21:32,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 00:21:32,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 00:21:32,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2022-12-06 00:21:32,993 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34558823529411764 [2022-12-06 00:21:32,993 INFO L175 Difference]: Start difference. First operand has 75 places, 54 transitions, 513 flow. Second operand 12 states and 141 transitions. [2022-12-06 00:21:32,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 167 transitions, 1707 flow [2022-12-06 00:21:33,005 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 00:21:33,008 INFO L231 Difference]: Finished difference. Result has 87 places, 104 transitions, 1161 flow [2022-12-06 00:21:33,008 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 00:21:33,008 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 57 predicate places. [2022-12-06 00:21:33,008 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:33,008 INFO L89 Accepts]: Start accepts. Operand has 87 places, 104 transitions, 1161 flow [2022-12-06 00:21:33,010 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:33,010 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:33,010 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 104 transitions, 1161 flow [2022-12-06 00:21:33,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 104 transitions, 1161 flow [2022-12-06 00:21:33,054 INFO L130 PetriNetUnfolder]: 301/665 cut-off events. [2022-12-06 00:21:33,054 INFO L131 PetriNetUnfolder]: For 3722/3931 co-relation queries the response was YES. [2022-12-06 00:21:33,057 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 00:21:33,060 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 104 transitions, 1161 flow [2022-12-06 00:21:33,060 INFO L188 LiptonReduction]: Number of co-enabled transitions 664 [2022-12-06 00:21:36,641 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 00:21:36,688 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 00:21:36,734 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:21:36,735 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3727 [2022-12-06 00:21:36,735 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 104 transitions, 1201 flow [2022-12-06 00:21:36,736 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 00:21:36,736 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:36,736 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 00:21:36,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 00:21:36,936 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 00:21:36,937 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 00:21:36,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:36,937 INFO L85 PathProgramCache]: Analyzing trace with hash 2033705419, now seen corresponding path program 1 times [2022-12-06 00:21:36,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:36,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890875351] [2022-12-06 00:21:36,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:36,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:37,599 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 00:21:37,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:37,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890875351] [2022-12-06 00:21:37,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890875351] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:21:37,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360786733] [2022-12-06 00:21:37,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:37,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:21:37,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:21:37,602 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 00:21:37,604 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 00:21:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:37,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-06 00:21:37,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:21:37,914 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:21:37,915 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 00:21:37,957 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 00:21:37,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:21:38,059 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:21:38,060 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 00:21:38,119 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 00:21:38,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360786733] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:21:38,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:21:38,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 4] total 14 [2022-12-06 00:21:38,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994574940] [2022-12-06 00:21:38,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:21:38,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 00:21:38,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:38,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 00:21:38,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-12-06 00:21:38,120 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2022-12-06 00:21:38,121 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 00:21:38,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:38,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2022-12-06 00:21:38,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:38,936 INFO L130 PetriNetUnfolder]: 2073/3094 cut-off events. [2022-12-06 00:21:38,936 INFO L131 PetriNetUnfolder]: For 19080/19666 co-relation queries the response was YES. [2022-12-06 00:21:38,949 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 00:21:38,962 INFO L137 encePairwiseOnDemand]: 16/38 looper letters, 183 selfloop transitions, 107 changer transitions 9/301 dead transitions. [2022-12-06 00:21:38,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 301 transitions, 3615 flow [2022-12-06 00:21:38,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 00:21:38,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 00:21:38,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 198 transitions. [2022-12-06 00:21:38,964 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37218045112781956 [2022-12-06 00:21:38,964 INFO L175 Difference]: Start difference. First operand has 87 places, 104 transitions, 1201 flow. Second operand 14 states and 198 transitions. [2022-12-06 00:21:38,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 301 transitions, 3615 flow [2022-12-06 00:21:39,009 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 00:21:39,013 INFO L231 Difference]: Finished difference. Result has 103 places, 196 transitions, 2396 flow [2022-12-06 00:21:39,013 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 00:21:39,013 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 73 predicate places. [2022-12-06 00:21:39,013 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:39,013 INFO L89 Accepts]: Start accepts. Operand has 103 places, 196 transitions, 2396 flow [2022-12-06 00:21:39,014 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:39,015 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:39,015 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 196 transitions, 2396 flow [2022-12-06 00:21:39,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 196 transitions, 2396 flow [2022-12-06 00:21:39,100 INFO L130 PetriNetUnfolder]: 542/1178 cut-off events. [2022-12-06 00:21:39,101 INFO L131 PetriNetUnfolder]: For 5537/5735 co-relation queries the response was YES. [2022-12-06 00:21:39,109 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 00:21:39,119 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 196 transitions, 2396 flow [2022-12-06 00:21:39,119 INFO L188 LiptonReduction]: Number of co-enabled transitions 1072 [2022-12-06 00:21:39,140 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 00:21:39,210 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 00:21:39,247 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 00:21:39,283 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 00:21:39,357 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 00:21:39,391 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 00:21:39,428 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 00:21:39,462 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 00:21:39,541 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 00:21:39,607 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 00:21:39,675 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 00:21:39,709 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 00:21:39,745 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 00:21:39,818 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 00:21:39,850 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 00:21:39,888 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 00:21:39,921 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 00:21:40,004 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 00:21:40,044 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:21:40,045 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1032 [2022-12-06 00:21:40,045 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 194 transitions, 2523 flow [2022-12-06 00:21:40,045 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 00:21:40,045 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:40,045 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 00:21:40,055 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 00:21:40,253 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 00:21:40,253 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 00:21:40,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:40,253 INFO L85 PathProgramCache]: Analyzing trace with hash 808041688, now seen corresponding path program 1 times [2022-12-06 00:21:40,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:40,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324004056] [2022-12-06 00:21:40,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:40,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:40,774 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 00:21:40,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:40,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324004056] [2022-12-06 00:21:40,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324004056] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:21:40,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889963361] [2022-12-06 00:21:40,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:40,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:21:40,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:21:40,776 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 00:21:40,779 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 00:21:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:40,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-06 00:21:40,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:21:40,975 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:21:40,975 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 00:21:40,997 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 00:21:40,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:21:41,049 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:21:41,049 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 00:21:41,084 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 00:21:41,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889963361] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:21:41,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:21:41,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 3] total 12 [2022-12-06 00:21:41,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350626254] [2022-12-06 00:21:41,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:21:41,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 00:21:41,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:41,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 00:21:41,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-06 00:21:41,086 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 56 [2022-12-06 00:21:41,086 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 00:21:41,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:41,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 56 [2022-12-06 00:21:41,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:41,783 INFO L130 PetriNetUnfolder]: 2478/3666 cut-off events. [2022-12-06 00:21:41,783 INFO L131 PetriNetUnfolder]: For 27855/28607 co-relation queries the response was YES. [2022-12-06 00:21:41,795 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 00:21:41,811 INFO L137 encePairwiseOnDemand]: 23/56 looper letters, 182 selfloop transitions, 98 changer transitions 4/286 dead transitions. [2022-12-06 00:21:41,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 286 transitions, 3899 flow [2022-12-06 00:21:41,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 00:21:41,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 00:21:41,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 160 transitions. [2022-12-06 00:21:41,812 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2597402597402597 [2022-12-06 00:21:41,813 INFO L175 Difference]: Start difference. First operand has 98 places, 194 transitions, 2523 flow. Second operand 11 states and 160 transitions. [2022-12-06 00:21:41,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 286 transitions, 3899 flow [2022-12-06 00:21:41,861 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 00:21:41,867 INFO L231 Difference]: Finished difference. Result has 110 places, 214 transitions, 2863 flow [2022-12-06 00:21:41,867 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 00:21:41,868 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 80 predicate places. [2022-12-06 00:21:41,868 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:41,868 INFO L89 Accepts]: Start accepts. Operand has 110 places, 214 transitions, 2863 flow [2022-12-06 00:21:41,870 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:41,870 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:41,870 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 214 transitions, 2863 flow [2022-12-06 00:21:41,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 214 transitions, 2863 flow [2022-12-06 00:21:41,959 INFO L130 PetriNetUnfolder]: 637/1403 cut-off events. [2022-12-06 00:21:41,960 INFO L131 PetriNetUnfolder]: For 8507/8816 co-relation queries the response was YES. [2022-12-06 00:21:41,987 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 00:21:41,997 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 214 transitions, 2863 flow [2022-12-06 00:21:41,998 INFO L188 LiptonReduction]: Number of co-enabled transitions 1214 [2022-12-06 00:21:42,039 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 00:21:42,075 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:21:42,076 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 208 [2022-12-06 00:21:42,076 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 214 transitions, 2869 flow [2022-12-06 00:21:42,076 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 00:21:42,076 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:42,076 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 00:21:42,086 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 00:21:42,281 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 00:21:42,282 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 00:21:42,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:42,282 INFO L85 PathProgramCache]: Analyzing trace with hash 961216993, now seen corresponding path program 1 times [2022-12-06 00:21:42,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:42,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190030144] [2022-12-06 00:21:42,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:42,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:42,338 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 00:21:42,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:42,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190030144] [2022-12-06 00:21:42,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190030144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:42,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:42,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:21:42,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149974418] [2022-12-06 00:21:42,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:42,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:21:42,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:42,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:21:42,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:21:42,340 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-06 00:21:42,340 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 00:21:42,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:42,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-06 00:21:42,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:42,794 INFO L130 PetriNetUnfolder]: 2656/3943 cut-off events. [2022-12-06 00:21:42,795 INFO L131 PetriNetUnfolder]: For 30212/30212 co-relation queries the response was YES. [2022-12-06 00:21:42,808 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 00:21:42,824 INFO L137 encePairwiseOnDemand]: 38/58 looper letters, 229 selfloop transitions, 67 changer transitions 0/296 dead transitions. [2022-12-06 00:21:42,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 296 transitions, 4184 flow [2022-12-06 00:21:42,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:21:42,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:21:42,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2022-12-06 00:21:42,825 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28448275862068967 [2022-12-06 00:21:42,825 INFO L175 Difference]: Start difference. First operand has 110 places, 214 transitions, 2869 flow. Second operand 6 states and 99 transitions. [2022-12-06 00:21:42,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 296 transitions, 4184 flow [2022-12-06 00:21:42,895 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 00:21:42,898 INFO L231 Difference]: Finished difference. Result has 112 places, 215 transitions, 2874 flow [2022-12-06 00:21:42,899 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 00:21:42,899 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 82 predicate places. [2022-12-06 00:21:42,899 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:42,899 INFO L89 Accepts]: Start accepts. Operand has 112 places, 215 transitions, 2874 flow [2022-12-06 00:21:42,900 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:42,900 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:42,900 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 215 transitions, 2874 flow [2022-12-06 00:21:42,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 215 transitions, 2874 flow [2022-12-06 00:21:42,992 INFO L130 PetriNetUnfolder]: 650/1423 cut-off events. [2022-12-06 00:21:42,992 INFO L131 PetriNetUnfolder]: For 9479/9754 co-relation queries the response was YES. [2022-12-06 00:21:42,999 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 00:21:43,009 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 215 transitions, 2874 flow [2022-12-06 00:21:43,009 INFO L188 LiptonReduction]: Number of co-enabled transitions 1224 [2022-12-06 00:21:43,302 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:21:43,302 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 403 [2022-12-06 00:21:43,302 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 215 transitions, 2889 flow [2022-12-06 00:21:43,302 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 00:21:43,302 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:43,303 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 00:21:43,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-06 00:21:43,303 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 00:21:43,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:43,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1201742910, now seen corresponding path program 1 times [2022-12-06 00:21:43,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:43,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325817583] [2022-12-06 00:21:43,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:43,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:43,354 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 00:21:43,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:43,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325817583] [2022-12-06 00:21:43,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325817583] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:21:43,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229923815] [2022-12-06 00:21:43,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:43,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:21:43,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:21:43,356 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 00:21:43,358 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 00:21:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:43,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 00:21:43,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:21:43,483 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 00:21:43,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:21:43,511 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 00:21:43,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229923815] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:21:43,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:21:43,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-06 00:21:43,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010077853] [2022-12-06 00:21:43,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:21:43,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:21:43,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:43,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:21:43,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:21:43,513 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-06 00:21:43,513 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 00:21:43,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:43,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-06 00:21:43,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:44,152 INFO L130 PetriNetUnfolder]: 2996/4445 cut-off events. [2022-12-06 00:21:44,152 INFO L131 PetriNetUnfolder]: For 38859/38859 co-relation queries the response was YES. [2022-12-06 00:21:44,167 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 00:21:44,185 INFO L137 encePairwiseOnDemand]: 33/59 looper letters, 269 selfloop transitions, 82 changer transitions 0/351 dead transitions. [2022-12-06 00:21:44,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 351 transitions, 4736 flow [2022-12-06 00:21:44,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:21:44,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:21:44,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2022-12-06 00:21:44,186 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.288135593220339 [2022-12-06 00:21:44,186 INFO L175 Difference]: Start difference. First operand has 112 places, 215 transitions, 2889 flow. Second operand 7 states and 119 transitions. [2022-12-06 00:21:44,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 351 transitions, 4736 flow [2022-12-06 00:21:44,288 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 00:21:44,292 INFO L231 Difference]: Finished difference. Result has 116 places, 218 transitions, 2954 flow [2022-12-06 00:21:44,292 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 00:21:44,292 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 86 predicate places. [2022-12-06 00:21:44,292 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:44,292 INFO L89 Accepts]: Start accepts. Operand has 116 places, 218 transitions, 2954 flow [2022-12-06 00:21:44,293 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:44,293 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:44,293 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 218 transitions, 2954 flow [2022-12-06 00:21:44,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 218 transitions, 2954 flow [2022-12-06 00:21:44,399 INFO L130 PetriNetUnfolder]: 710/1596 cut-off events. [2022-12-06 00:21:44,400 INFO L131 PetriNetUnfolder]: For 10900/11242 co-relation queries the response was YES. [2022-12-06 00:21:44,407 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 00:21:44,418 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 218 transitions, 2954 flow [2022-12-06 00:21:44,418 INFO L188 LiptonReduction]: Number of co-enabled transitions 1308 [2022-12-06 00:21:44,419 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:44,420 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-06 00:21:44,420 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 218 transitions, 2954 flow [2022-12-06 00:21:44,420 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 00:21:44,420 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:44,420 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 00:21:44,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 00:21:44,626 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 00:21:44,627 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 00:21:44,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:44,627 INFO L85 PathProgramCache]: Analyzing trace with hash -616669900, now seen corresponding path program 1 times [2022-12-06 00:21:44,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:44,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594024943] [2022-12-06 00:21:44,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:44,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:45,208 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 00:21:45,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:45,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594024943] [2022-12-06 00:21:45,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594024943] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:21:45,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022574480] [2022-12-06 00:21:45,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:45,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:21:45,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:21:45,210 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 00:21:45,246 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 00:21:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:45,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 00:21:45,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:21:45,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:21:45,408 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 00:21:45,411 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 00:21:45,453 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 00:21:45,494 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 00:21:45,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:21:45,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:21:45,621 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 00:21:45,728 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 00:21:45,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:21:47,875 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 00:21:47,921 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 00:21:47,937 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 00:21:47,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022574480] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:21:47,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:21:47,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 19 [2022-12-06 00:21:47,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358593718] [2022-12-06 00:21:47,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:21:47,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 00:21:47,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:47,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 00:21:47,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=252, Unknown=2, NotChecked=70, Total=420 [2022-12-06 00:21:47,942 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-06 00:21:47,942 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 00:21:47,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:47,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-06 00:21:47,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:49,923 INFO L130 PetriNetUnfolder]: 3357/5128 cut-off events. [2022-12-06 00:21:49,923 INFO L131 PetriNetUnfolder]: For 46299/46299 co-relation queries the response was YES. [2022-12-06 00:21:49,941 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 00:21:49,959 INFO L137 encePairwiseOnDemand]: 17/59 looper letters, 195 selfloop transitions, 163 changer transitions 9/367 dead transitions. [2022-12-06 00:21:49,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 367 transitions, 5047 flow [2022-12-06 00:21:49,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 00:21:49,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 00:21:49,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 165 transitions. [2022-12-06 00:21:49,961 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16450648055832504 [2022-12-06 00:21:49,961 INFO L175 Difference]: Start difference. First operand has 116 places, 218 transitions, 2954 flow. Second operand 17 states and 165 transitions. [2022-12-06 00:21:49,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 367 transitions, 5047 flow [2022-12-06 00:21:50,057 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 00:21:50,061 INFO L231 Difference]: Finished difference. Result has 137 places, 293 transitions, 4470 flow [2022-12-06 00:21:50,062 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 00:21:50,062 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 107 predicate places. [2022-12-06 00:21:50,062 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:50,062 INFO L89 Accepts]: Start accepts. Operand has 137 places, 293 transitions, 4470 flow [2022-12-06 00:21:50,063 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:50,063 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:50,063 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 293 transitions, 4470 flow [2022-12-06 00:21:50,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 293 transitions, 4470 flow [2022-12-06 00:21:50,130 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 00:21:50,130 INFO L382 tUnfolder$Statistics]: this new event has 10 ancestors and is cut-off event [2022-12-06 00:21:50,130 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 00:21:50,130 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 00:21:50,130 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 00:21:50,157 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 00:21:50,158 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 00:21:50,158 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:21:50,158 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 00:21:50,158 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 00:21:50,183 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 00:21:50,183 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 00:21:50,183 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:21:50,183 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:21:50,183 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:21:50,198 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 00:21:50,198 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 00:21:50,198 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:21:50,198 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:21:50,198 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:21:50,225 INFO L130 PetriNetUnfolder]: 932/2050 cut-off events. [2022-12-06 00:21:50,226 INFO L131 PetriNetUnfolder]: For 17308/17684 co-relation queries the response was YES. [2022-12-06 00:21:50,236 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 00:21:50,250 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 293 transitions, 4470 flow [2022-12-06 00:21:50,250 INFO L188 LiptonReduction]: Number of co-enabled transitions 1514 [2022-12-06 00:21:50,255 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 00:21:50,318 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 00:21:50,371 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 00:21:50,414 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 00:21:50,451 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 00:21:50,530 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 00:21:50,701 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 00:21:50,982 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 00:21:50,982 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 920 [2022-12-06 00:21:50,983 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 290 transitions, 4592 flow [2022-12-06 00:21:50,983 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 00:21:50,983 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:50,983 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 00:21:50,996 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 00:21:51,183 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 00:21:51,183 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 00:21:51,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:51,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1419503499, now seen corresponding path program 1 times [2022-12-06 00:21:51,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:51,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271326484] [2022-12-06 00:21:51,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:51,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:51,559 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 00:21:51,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:51,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271326484] [2022-12-06 00:21:51,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271326484] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:21:51,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103086730] [2022-12-06 00:21:51,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:51,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:21:51,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:21:51,561 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 00:21:51,563 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 00:21:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:51,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 00:21:51,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:21:51,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:21:51,747 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 00:21:51,834 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:21:51,835 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 00:21:51,871 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 00:21:51,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:21:51,951 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:21:51,952 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 00:21:51,957 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:21:51,957 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 00:21:51,997 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 00:21:51,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103086730] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:21:51,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:21:51,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 00:21:51,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067850539] [2022-12-06 00:21:51,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:21:51,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 00:21:51,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:51,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 00:21:51,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-12-06 00:21:51,998 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 65 [2022-12-06 00:21:51,998 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 00:21:51,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:51,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 65 [2022-12-06 00:21:51,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:53,332 INFO L130 PetriNetUnfolder]: 3723/5665 cut-off events. [2022-12-06 00:21:53,333 INFO L131 PetriNetUnfolder]: For 64611/65786 co-relation queries the response was YES. [2022-12-06 00:21:53,352 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 00:21:53,376 INFO L137 encePairwiseOnDemand]: 18/65 looper letters, 252 selfloop transitions, 171 changer transitions 6/433 dead transitions. [2022-12-06 00:21:53,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 433 transitions, 7015 flow [2022-12-06 00:21:53,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 00:21:53,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 00:21:53,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 198 transitions. [2022-12-06 00:21:53,377 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23431952662721894 [2022-12-06 00:21:53,377 INFO L175 Difference]: Start difference. First operand has 134 places, 290 transitions, 4592 flow. Second operand 13 states and 198 transitions. [2022-12-06 00:21:53,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 433 transitions, 7015 flow [2022-12-06 00:21:53,514 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 00:21:53,520 INFO L231 Difference]: Finished difference. Result has 145 places, 338 transitions, 5637 flow [2022-12-06 00:21:53,520 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 00:21:53,520 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 115 predicate places. [2022-12-06 00:21:53,520 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:53,520 INFO L89 Accepts]: Start accepts. Operand has 145 places, 338 transitions, 5637 flow [2022-12-06 00:21:53,521 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:53,521 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:53,521 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 338 transitions, 5637 flow [2022-12-06 00:21:53,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 338 transitions, 5637 flow [2022-12-06 00:21:53,618 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 00:21:53,618 INFO L382 tUnfolder$Statistics]: this new event has 10 ancestors and is cut-off event [2022-12-06 00:21:53,618 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 00:21:53,619 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 00:21:53,619 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 00:21:53,658 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 00:21:53,658 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 00:21:53,659 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 00:21:53,659 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 00:21:53,659 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:21:53,678 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 00:21:53,678 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 00:21:53,678 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:21:53,678 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:21:53,678 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:21:53,686 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 00:21:53,686 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 00:21:53,686 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:21:53,686 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:21:53,686 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:21:53,724 INFO L130 PetriNetUnfolder]: 1118/2422 cut-off events. [2022-12-06 00:21:53,724 INFO L131 PetriNetUnfolder]: For 22252/22734 co-relation queries the response was YES. [2022-12-06 00:21:53,737 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 00:21:53,754 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 338 transitions, 5637 flow [2022-12-06 00:21:53,754 INFO L188 LiptonReduction]: Number of co-enabled transitions 1734 [2022-12-06 00:21:53,756 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 00:21:53,824 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:21:53,825 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 305 [2022-12-06 00:21:53,825 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 338 transitions, 5652 flow [2022-12-06 00:21:53,825 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 00:21:53,825 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:53,825 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:53,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-06 00:21:54,030 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 00:21:54,031 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 00:21:54,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:54,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1147053406, now seen corresponding path program 1 times [2022-12-06 00:21:54,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:54,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884771880] [2022-12-06 00:21:54,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:54,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:54,585 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 00:21:54,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:54,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884771880] [2022-12-06 00:21:54,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884771880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:54,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:54,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:21:54,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113249525] [2022-12-06 00:21:54,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:54,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:21:54,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:54,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:21:54,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:21:54,587 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 65 [2022-12-06 00:21:54,587 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 00:21:54,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:54,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 65 [2022-12-06 00:21:54,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:55,415 INFO L130 PetriNetUnfolder]: 3897/5945 cut-off events. [2022-12-06 00:21:55,415 INFO L131 PetriNetUnfolder]: For 68529/68529 co-relation queries the response was YES. [2022-12-06 00:21:55,442 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 00:21:55,608 INFO L137 encePairwiseOnDemand]: 28/65 looper letters, 310 selfloop transitions, 39 changer transitions 10/359 dead transitions. [2022-12-06 00:21:55,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 359 transitions, 6508 flow [2022-12-06 00:21:55,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:21:55,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:21:55,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2022-12-06 00:21:55,609 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24615384615384617 [2022-12-06 00:21:55,609 INFO L175 Difference]: Start difference. First operand has 144 places, 338 transitions, 5652 flow. Second operand 6 states and 96 transitions. [2022-12-06 00:21:55,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 359 transitions, 6508 flow [2022-12-06 00:21:55,751 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 00:21:55,756 INFO L231 Difference]: Finished difference. Result has 145 places, 336 transitions, 5359 flow [2022-12-06 00:21:55,757 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 00:21:55,757 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 115 predicate places. [2022-12-06 00:21:55,757 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:55,757 INFO L89 Accepts]: Start accepts. Operand has 145 places, 336 transitions, 5359 flow [2022-12-06 00:21:55,758 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:55,758 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:55,758 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 336 transitions, 5359 flow [2022-12-06 00:21:55,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 336 transitions, 5359 flow [2022-12-06 00:21:55,914 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 00:21:55,915 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 00:21:55,915 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:21:55,915 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:21:55,915 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:21:55,925 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 00:21:55,926 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 00:21:55,926 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:21:55,926 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:21:55,926 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:21:55,962 INFO L130 PetriNetUnfolder]: 1115/2423 cut-off events. [2022-12-06 00:21:55,962 INFO L131 PetriNetUnfolder]: For 20781/21157 co-relation queries the response was YES. [2022-12-06 00:21:55,975 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 00:21:55,993 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 336 transitions, 5359 flow [2022-12-06 00:21:55,994 INFO L188 LiptonReduction]: Number of co-enabled transitions 1728 [2022-12-06 00:21:55,995 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:55,996 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 239 [2022-12-06 00:21:55,996 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 336 transitions, 5359 flow [2022-12-06 00:21:55,996 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 00:21:55,996 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:55,996 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 00:21:55,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-06 00:21:55,996 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 00:21:55,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:55,997 INFO L85 PathProgramCache]: Analyzing trace with hash -835799711, now seen corresponding path program 1 times [2022-12-06 00:21:55,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:55,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466408012] [2022-12-06 00:21:55,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:55,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:56,396 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 00:21:56,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:56,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466408012] [2022-12-06 00:21:56,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466408012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:56,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:56,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:21:56,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014156940] [2022-12-06 00:21:56,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:56,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:21:56,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:56,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:21:56,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:21:56,398 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 64 [2022-12-06 00:21:56,398 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 00:21:56,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:56,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 64 [2022-12-06 00:21:56,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:57,708 INFO L130 PetriNetUnfolder]: 4570/6955 cut-off events. [2022-12-06 00:21:57,709 INFO L131 PetriNetUnfolder]: For 79927/81372 co-relation queries the response was YES. [2022-12-06 00:21:57,759 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 00:21:57,799 INFO L137 encePairwiseOnDemand]: 23/64 looper letters, 285 selfloop transitions, 142 changer transitions 4/435 dead transitions. [2022-12-06 00:21:57,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 435 transitions, 7303 flow [2022-12-06 00:21:57,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:21:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:21:57,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2022-12-06 00:21:57,817 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34375 [2022-12-06 00:21:57,817 INFO L175 Difference]: Start difference. First operand has 144 places, 336 transitions, 5359 flow. Second operand 6 states and 132 transitions. [2022-12-06 00:21:57,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 435 transitions, 7303 flow [2022-12-06 00:21:58,174 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 00:21:58,180 INFO L231 Difference]: Finished difference. Result has 148 places, 382 transitions, 6477 flow [2022-12-06 00:21:58,181 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 00:21:58,181 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 118 predicate places. [2022-12-06 00:21:58,181 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:58,181 INFO L89 Accepts]: Start accepts. Operand has 148 places, 382 transitions, 6477 flow [2022-12-06 00:21:58,183 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:58,183 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:58,183 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 382 transitions, 6477 flow [2022-12-06 00:21:58,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 382 transitions, 6477 flow [2022-12-06 00:21:58,346 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 00:21:58,347 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 00:21:58,347 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:21:58,347 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:21:58,347 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:21:58,396 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 00:21:58,397 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 00:21:58,397 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:21:58,397 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:21:58,397 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:21:58,397 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:21:58,403 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 00:21:58,404 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 00:21:58,404 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:21:58,404 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:21:58,404 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:21:58,450 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 00:21:58,450 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 00:21:58,450 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:21:58,450 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:21:58,450 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:21:58,494 INFO L130 PetriNetUnfolder]: 1245/2775 cut-off events. [2022-12-06 00:21:58,494 INFO L131 PetriNetUnfolder]: For 25221/25725 co-relation queries the response was YES. [2022-12-06 00:21:58,508 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 00:21:58,529 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 382 transitions, 6477 flow [2022-12-06 00:21:58,529 INFO L188 LiptonReduction]: Number of co-enabled transitions 2148 [2022-12-06 00:21:58,530 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:58,531 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 350 [2022-12-06 00:21:58,531 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 382 transitions, 6477 flow [2022-12-06 00:21:58,531 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 00:21:58,531 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:58,531 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 00:21:58,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-06 00:21:58,531 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 00:21:58,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:58,531 INFO L85 PathProgramCache]: Analyzing trace with hash 594898099, now seen corresponding path program 1 times [2022-12-06 00:21:58,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:58,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748950650] [2022-12-06 00:21:58,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:58,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:59,040 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 00:21:59,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:59,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748950650] [2022-12-06 00:21:59,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748950650] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:21:59,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252509540] [2022-12-06 00:21:59,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:59,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:21:59,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:21:59,042 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 00:21:59,044 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 00:21:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:59,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 00:21:59,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:21:59,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:21:59,217 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 00:21:59,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:21:59,258 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 00:21:59,364 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:21:59,365 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 00:21:59,402 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 00:21:59,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:21:59,488 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1187 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1187) c_~A~0.base))) (= (mod (+ (select .cse0 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4))) c_~sum1~0) 4294967296) (mod (+ (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 c_~A~0.offset) c_~sum3~0 c_~sum2~0) 4294967296)))) is different from false [2022-12-06 00:21:59,500 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:21:59,500 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 00:21:59,505 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 00:21:59,510 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:21:59,510 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 00:21:59,633 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 00:21:59,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252509540] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:21:59,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:21:59,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 00:21:59,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203219458] [2022-12-06 00:21:59,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:21:59,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 00:21:59,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:59,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 00:21:59,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=244, Unknown=1, NotChecked=32, Total=342 [2022-12-06 00:21:59,634 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 64 [2022-12-06 00:21:59,634 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 00:21:59,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:59,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 64 [2022-12-06 00:21:59,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:22:01,318 INFO L130 PetriNetUnfolder]: 5172/7867 cut-off events. [2022-12-06 00:22:01,318 INFO L131 PetriNetUnfolder]: For 101965/103577 co-relation queries the response was YES. [2022-12-06 00:22:01,350 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 00:22:01,380 INFO L137 encePairwiseOnDemand]: 18/64 looper letters, 297 selfloop transitions, 224 changer transitions 5/530 dead transitions. [2022-12-06 00:22:01,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 530 transitions, 9272 flow [2022-12-06 00:22:01,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 00:22:01,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 00:22:01,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 192 transitions. [2022-12-06 00:22:01,381 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2727272727272727 [2022-12-06 00:22:01,381 INFO L175 Difference]: Start difference. First operand has 148 places, 382 transitions, 6477 flow. Second operand 11 states and 192 transitions. [2022-12-06 00:22:01,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 530 transitions, 9272 flow [2022-12-06 00:22:01,620 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 00:22:01,628 INFO L231 Difference]: Finished difference. Result has 162 places, 437 transitions, 8106 flow [2022-12-06 00:22:01,628 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 00:22:01,628 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 132 predicate places. [2022-12-06 00:22:01,628 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:22:01,628 INFO L89 Accepts]: Start accepts. Operand has 162 places, 437 transitions, 8106 flow [2022-12-06 00:22:01,630 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:22:01,630 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:22:01,630 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 437 transitions, 8106 flow [2022-12-06 00:22:01,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 437 transitions, 8106 flow [2022-12-06 00:22:01,838 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)), 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: 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: 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|))), 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), 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)), 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 00:22:01,838 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 00:22:01,838 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:22:01,838 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:22:01,838 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:22:01,923 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: 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)), 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|))), 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: 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)))), 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 00:22:01,923 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 00:22:01,923 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:01,923 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:01,923 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:01,964 INFO L130 PetriNetUnfolder]: 1420/3141 cut-off events. [2022-12-06 00:22:01,964 INFO L131 PetriNetUnfolder]: For 33558/34180 co-relation queries the response was YES. [2022-12-06 00:22:01,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20769 conditions, 3141 events. 1420/3141 cut-off events. For 33558/34180 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 25695 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 00:22:02,004 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 437 transitions, 8106 flow [2022-12-06 00:22:02,005 INFO L188 LiptonReduction]: Number of co-enabled transitions 2452 [2022-12-06 00:22:02,006 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:22:02,006 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 378 [2022-12-06 00:22:02,006 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 437 transitions, 8106 flow [2022-12-06 00:22:02,007 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 00:22:02,007 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:22:02,007 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 00:22:02,015 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 00:22:02,214 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 00:22:02,214 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 00:22:02,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:22:02,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1122428828, now seen corresponding path program 1 times [2022-12-06 00:22:02,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:22:02,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384463281] [2022-12-06 00:22:02,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:22:02,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:22:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:22:02,256 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 00:22:02,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:22:02,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384463281] [2022-12-06 00:22:02,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384463281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:22:02,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:22:02,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:22:02,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866035356] [2022-12-06 00:22:02,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:22:02,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:22:02,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:22:02,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:22:02,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:22:02,258 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 64 [2022-12-06 00:22:02,258 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 00:22:02,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:22:02,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 64 [2022-12-06 00:22:02,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:22:04,036 INFO L130 PetriNetUnfolder]: 7040/10886 cut-off events. [2022-12-06 00:22:04,037 INFO L131 PetriNetUnfolder]: For 158373/160439 co-relation queries the response was YES. [2022-12-06 00:22:04,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85102 conditions, 10886 events. 7040/10886 cut-off events. For 158373/160439 co-relation queries the response was YES. Maximal size of possible extension queue 681. Compared 70065 event pairs, 2814 based on Foata normal form. 1384/12086 useless extension candidates. Maximal degree in co-relation 84470. Up to 5206 conditions per place. [2022-12-06 00:22:04,138 INFO L137 encePairwiseOnDemand]: 57/64 looper letters, 533 selfloop transitions, 7 changer transitions 1/545 dead transitions. [2022-12-06 00:22:04,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 545 transitions, 10649 flow [2022-12-06 00:22:04,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:22:04,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:22:04,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2022-12-06 00:22:04,139 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46875 [2022-12-06 00:22:04,139 INFO L175 Difference]: Start difference. First operand has 162 places, 437 transitions, 8106 flow. Second operand 4 states and 120 transitions. [2022-12-06 00:22:04,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 545 transitions, 10649 flow [2022-12-06 00:22:04,660 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 00:22:04,667 INFO L231 Difference]: Finished difference. Result has 160 places, 420 transitions, 7589 flow [2022-12-06 00:22:04,668 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 00:22:04,668 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 130 predicate places. [2022-12-06 00:22:04,669 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:22:04,669 INFO L89 Accepts]: Start accepts. Operand has 160 places, 420 transitions, 7589 flow [2022-12-06 00:22:04,670 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:22:04,670 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:22:04,670 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 420 transitions, 7589 flow [2022-12-06 00:22:04,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 420 transitions, 7589 flow [2022-12-06 00:22:04,827 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][216], [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: 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)), 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: 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: 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: 1441#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 462#true, Black: 153#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|)), 1440#(<= ~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), 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)), 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)))), 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 00:22:04,828 INFO L382 tUnfolder$Statistics]: this new event has 10 ancestors and is cut-off event [2022-12-06 00:22:04,828 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 00:22:04,828 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 00:22:04,828 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 00:22:04,902 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][216], [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)), 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: 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: 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: 1441#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 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|)), 1440#(<= ~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), 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)), 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)), 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 00:22:04,902 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 00:22:04,902 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:22:04,902 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:22:04,903 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:22:04,903 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][216], [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)), 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: 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: 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: 1441#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 9#thread2EXITtrue, Black: 153#true, 462#true, 14#thread3EXITtrue, 1440#(<= ~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), 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: 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)))), 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)), 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 00:22:04,903 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 00:22:04,903 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:04,903 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:22:04,903 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:04,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][216], [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: 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)), 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: 1441#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), Black: 153#true, 462#true, 14#thread3EXITtrue, 1440#(<= ~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), 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: 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)), 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: 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 00:22:04,950 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is not cut-off event [2022-12-06 00:22:04,950 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2022-12-06 00:22:04,950 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2022-12-06 00:22:04,950 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2022-12-06 00:22:05,064 INFO L130 PetriNetUnfolder]: 1766/4181 cut-off events. [2022-12-06 00:22:05,064 INFO L131 PetriNetUnfolder]: For 40473/41089 co-relation queries the response was YES. [2022-12-06 00:22:05,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26325 conditions, 4181 events. 1766/4181 cut-off events. For 40473/41089 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 38080 event pairs, 458 based on Foata normal form. 57/3927 useless extension candidates. Maximal degree in co-relation 26127. Up to 1627 conditions per place. [2022-12-06 00:22:05,127 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 420 transitions, 7589 flow [2022-12-06 00:22:05,128 INFO L188 LiptonReduction]: Number of co-enabled transitions 2332 [2022-12-06 00:22:05,139 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 00:22:05,264 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:22:05,265 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 596 [2022-12-06 00:22:05,265 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 419 transitions, 7587 flow [2022-12-06 00:22:05,265 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 00:22:05,265 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:22:05,265 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 00:22:05,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-06 00:22:05,265 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 00:22:05,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:22:05,266 INFO L85 PathProgramCache]: Analyzing trace with hash -2053398207, now seen corresponding path program 1 times [2022-12-06 00:22:05,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:22:05,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096908690] [2022-12-06 00:22:05,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:22:05,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:22:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:22:05,333 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 00:22:05,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:22:05,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096908690] [2022-12-06 00:22:05,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096908690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:22:05,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:22:05,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:22:05,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213755496] [2022-12-06 00:22:05,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:22:05,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:22:05,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:22:05,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:22:05,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:22:05,335 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-06 00:22:05,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 419 transitions, 7587 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 00:22:05,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:22:05,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-06 00:22:05,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:22:07,222 INFO L130 PetriNetUnfolder]: 7412/11460 cut-off events. [2022-12-06 00:22:07,222 INFO L131 PetriNetUnfolder]: For 137932/137932 co-relation queries the response was YES. [2022-12-06 00:22:07,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82251 conditions, 11460 events. 7412/11460 cut-off events. For 137932/137932 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 73286 event pairs, 1702 based on Foata normal form. 4/11459 useless extension candidates. Maximal degree in co-relation 81705. Up to 5918 conditions per place. [2022-12-06 00:22:07,334 INFO L137 encePairwiseOnDemand]: 53/64 looper letters, 552 selfloop transitions, 23 changer transitions 1/576 dead transitions. [2022-12-06 00:22:07,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 576 transitions, 10853 flow [2022-12-06 00:22:07,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:22:07,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:22:07,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-12-06 00:22:07,336 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43359375 [2022-12-06 00:22:07,336 INFO L175 Difference]: Start difference. First operand has 158 places, 419 transitions, 7587 flow. Second operand 4 states and 111 transitions. [2022-12-06 00:22:07,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 576 transitions, 10853 flow [2022-12-06 00:22:07,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 576 transitions, 10842 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 00:22:07,907 INFO L231 Difference]: Finished difference. Result has 159 places, 425 transitions, 7753 flow [2022-12-06 00:22:07,907 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=7503, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=7753, PETRI_PLACES=159, PETRI_TRANSITIONS=425} [2022-12-06 00:22:07,907 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 129 predicate places. [2022-12-06 00:22:07,907 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:22:07,907 INFO L89 Accepts]: Start accepts. Operand has 159 places, 425 transitions, 7753 flow [2022-12-06 00:22:07,909 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:22:07,909 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:22:07,909 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 425 transitions, 7753 flow [2022-12-06 00:22:07,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 425 transitions, 7753 flow [2022-12-06 00:22:08,147 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][228], [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))))), 1443#true, 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)), 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: 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: 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: 1441#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 9#thread2EXITtrue, 462#true, Black: 153#true, 14#thread3EXITtrue, Black: 1445#(and (<= 0 ~M~0) (<= ~N~0 (+ 2 ~M~0)) (<= ~M~0 ~N~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|)), 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: 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 00:22:08,147 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 00:22:08,148 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:08,148 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:08,148 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:08,180 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][228], [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)), 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: 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: 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: 1441#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 9#thread2EXITtrue, Black: 153#true, 462#true, 14#thread3EXITtrue, Black: 1445#(and (<= 0 ~M~0) (<= ~N~0 (+ 2 ~M~0)) (<= ~M~0 ~N~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|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 1448#(and (<= 0 ~M~0) (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= ~N~0 (+ 2 ~M~0)) (<= ~M~0 ~N~0)), 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), 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: 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)))), 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 00:22:08,181 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 00:22:08,181 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:22:08,181 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:22:08,181 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:22:08,205 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][228], [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))))), 1443#true, 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)), 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: 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: 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: 1441#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 9#thread2EXITtrue, 462#true, Black: 153#true, 14#thread3EXITtrue, Black: 1445#(and (<= 0 ~M~0) (<= ~N~0 (+ 2 ~M~0)) (<= ~M~0 ~N~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|)), 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)), 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: 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: 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 00:22:08,205 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 00:22:08,205 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:08,205 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:08,205 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:08,205 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:08,209 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][228], [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))))), 1443#true, 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)), 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: 1441#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 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: 1445#(and (<= 0 ~M~0) (<= ~N~0 (+ 2 ~M~0)) (<= ~M~0 ~N~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|)), 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 00:22:08,209 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 00:22:08,209 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:08,209 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:08,209 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:08,393 INFO L130 PetriNetUnfolder]: 1774/4174 cut-off events. [2022-12-06 00:22:08,393 INFO L131 PetriNetUnfolder]: For 41393/42059 co-relation queries the response was YES. [2022-12-06 00:22:08,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26383 conditions, 4174 events. 1774/4174 cut-off events. For 41393/42059 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 37797 event pairs, 453 based on Foata normal form. 59/3924 useless extension candidates. Maximal degree in co-relation 26171. Up to 1639 conditions per place. [2022-12-06 00:22:08,448 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 425 transitions, 7753 flow [2022-12-06 00:22:08,448 INFO L188 LiptonReduction]: Number of co-enabled transitions 2432 [2022-12-06 00:22:08,450 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:22:08,450 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 543 [2022-12-06 00:22:08,450 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 425 transitions, 7753 flow [2022-12-06 00:22:08,451 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 00:22:08,451 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:22:08,451 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 00:22:08,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-06 00:22:08,451 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 00:22:08,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:22:08,451 INFO L85 PathProgramCache]: Analyzing trace with hash 396625139, now seen corresponding path program 2 times [2022-12-06 00:22:08,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:22:08,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749203568] [2022-12-06 00:22:08,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:22:08,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:22:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:22:09,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 00:22:09,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:22:09,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749203568] [2022-12-06 00:22:09,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749203568] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:22:09,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044278155] [2022-12-06 00:22:09,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 00:22:09,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:22:09,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:22:09,064 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 00:22:09,067 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 00:22:09,196 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 00:22:09,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:22:09,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 00:22:09,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:22:09,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:22:09,247 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 00:22:09,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:22:09,288 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 00:22:09,402 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:22:09,403 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 00:22:09,440 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 00:22:09,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:22:09,577 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:22:09,578 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 00:22:09,583 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:22:09,583 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 222 [2022-12-06 00:22:09,592 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:22:09,592 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 00:22:10,335 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 00:22:10,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044278155] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:22:10,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:22:10,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 00:22:10,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187975189] [2022-12-06 00:22:10,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:22:10,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 00:22:10,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:22:10,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 00:22:10,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=270, Unknown=5, NotChecked=0, Total=342 [2022-12-06 00:22:10,336 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 62 [2022-12-06 00:22:10,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 425 transitions, 7753 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 00:22:10,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:22:10,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 62 [2022-12-06 00:22:10,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:22:13,138 INFO L130 PetriNetUnfolder]: 7301/11300 cut-off events. [2022-12-06 00:22:13,138 INFO L131 PetriNetUnfolder]: For 158280/160815 co-relation queries the response was YES. [2022-12-06 00:22:13,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87556 conditions, 11300 events. 7301/11300 cut-off events. For 158280/160815 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 73332 event pairs, 2154 based on Foata normal form. 1419/12530 useless extension candidates. Maximal degree in co-relation 86923. Up to 9569 conditions per place. [2022-12-06 00:22:13,275 INFO L137 encePairwiseOnDemand]: 18/62 looper letters, 302 selfloop transitions, 213 changer transitions 5/527 dead transitions. [2022-12-06 00:22:13,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 527 transitions, 9818 flow [2022-12-06 00:22:13,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 00:22:13,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 00:22:13,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 180 transitions. [2022-12-06 00:22:13,279 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26392961876832843 [2022-12-06 00:22:13,279 INFO L175 Difference]: Start difference. First operand has 159 places, 425 transitions, 7753 flow. Second operand 11 states and 180 transitions. [2022-12-06 00:22:13,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 527 transitions, 9818 flow [2022-12-06 00:22:13,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 527 transitions, 9815 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-06 00:22:13,804 INFO L231 Difference]: Finished difference. Result has 170 places, 441 transitions, 8607 flow [2022-12-06 00:22:13,805 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=7750, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=200, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8607, PETRI_PLACES=170, PETRI_TRANSITIONS=441} [2022-12-06 00:22:13,805 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 140 predicate places. [2022-12-06 00:22:13,805 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:22:13,805 INFO L89 Accepts]: Start accepts. Operand has 170 places, 441 transitions, 8607 flow [2022-12-06 00:22:13,807 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:22:13,807 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:22:13,807 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 441 transitions, 8607 flow [2022-12-06 00:22:13,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 441 transitions, 8607 flow [2022-12-06 00:22:14,111 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][234], [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: 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)), 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: 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: 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: 1441#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 9#thread2EXITtrue, Black: 153#true, 462#true, 14#thread3EXITtrue, Black: 1445#(and (<= 0 ~M~0) (<= ~N~0 (+ 2 ~M~0)) (<= ~M~0 ~N~0)), Black: 1495#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1488#(and (= ~A~0.offset 0) (<= (+ ~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) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~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|)), 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|)), 1450#true, 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: 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: 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 00:22:14,111 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 00:22:14,111 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:14,111 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:14,111 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:14,216 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][234], [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)), 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: 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: 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: 1441#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 9#thread2EXITtrue, Black: 153#true, 462#true, 14#thread3EXITtrue, Black: 1445#(and (<= 0 ~M~0) (<= ~N~0 (+ 2 ~M~0)) (<= ~M~0 ~N~0)), Black: 1495#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1488#(and (= ~A~0.offset 0) (<= (+ ~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) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~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|)), 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 1448#(and (<= 0 ~M~0) (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= ~N~0 (+ 2 ~M~0)) (<= ~M~0 ~N~0)), 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|)), 1450#true, 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)), 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: 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)))), 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 00:22:14,216 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 00:22:14,216 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:22:14,216 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:22:14,216 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:22:14,237 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][234], [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)), 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: 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: 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: 1441#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 9#thread2EXITtrue, 462#true, Black: 153#true, 14#thread3EXITtrue, Black: 1445#(and (<= 0 ~M~0) (<= ~N~0 (+ 2 ~M~0)) (<= ~M~0 ~N~0)), Black: 1495#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1488#(and (= ~A~0.offset 0) (<= (+ ~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) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~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|)), 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|)), 1450#true, 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 00:22:14,237 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 00:22:14,237 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:14,237 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:14,237 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:14,237 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:14,240 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][234], [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: 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)), 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: 1441#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 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: 1445#(and (<= 0 ~M~0) (<= ~N~0 (+ 2 ~M~0)) (<= ~M~0 ~N~0)), Black: 1495#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1488#(and (= ~A~0.offset 0) (<= (+ ~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) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~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|)), 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|)), 1450#true, 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, 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: 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: 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 00:22:14,240 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 00:22:14,240 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:14,240 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:14,240 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:14,327 INFO L130 PetriNetUnfolder]: 1836/4345 cut-off events. [2022-12-06 00:22:14,327 INFO L131 PetriNetUnfolder]: For 47631/48305 co-relation queries the response was YES. [2022-12-06 00:22:14,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28496 conditions, 4345 events. 1836/4345 cut-off events. For 47631/48305 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 39801 event pairs, 470 based on Foata normal form. 62/4078 useless extension candidates. Maximal degree in co-relation 28278. Up to 1698 conditions per place. [2022-12-06 00:22:14,388 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 441 transitions, 8607 flow [2022-12-06 00:22:14,388 INFO L188 LiptonReduction]: Number of co-enabled transitions 2556 [2022-12-06 00:22:14,389 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:22:14,390 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 585 [2022-12-06 00:22:14,390 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 441 transitions, 8607 flow [2022-12-06 00:22:14,390 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 00:22:14,390 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:22:14,390 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 00:22:14,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-06 00:22:14,595 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,SelfDestructingSolverStorable44 [2022-12-06 00:22:14,596 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 00:22:14,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:22:14,596 INFO L85 PathProgramCache]: Analyzing trace with hash 462820328, now seen corresponding path program 1 times [2022-12-06 00:22:14,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:22:14,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501750874] [2022-12-06 00:22:14,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:22:14,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:22:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:22:14,967 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 00:22:14,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:22:14,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501750874] [2022-12-06 00:22:14,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501750874] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:22:14,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045140675] [2022-12-06 00:22:14,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:22:14,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:22:14,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:22:14,972 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 00:22:14,974 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 00:22:15,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:22:15,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-06 00:22:15,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:22:15,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:22:15,221 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 00:22:15,223 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 00:22:15,266 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 00:22:15,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:22:15,313 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 00:22:15,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:22:15,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:22:15,409 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:22:15,409 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 54 treesize of output 50 [2022-12-06 00:22:15,497 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 00:22:15,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:22:17,622 WARN L837 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1354 (Array Int Int))) (or (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1354) c_~A~0.base)) (.cse5 (* ~M~0 4))) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse0 (select .cse4 (+ c_~A~0.offset .cse5 4))) (.cse3 (select .cse4 (+ c_~A~0.offset .cse5))) (.cse2 (select .cse4 (+ c_~A~0.offset 4)))) (= (+ .cse0 c_~sum3~0 c_~sum2~0 (* (div (+ .cse1 c_~sum1~0 .cse2) 4294967296) 4294967296) .cse3) (+ .cse1 (* (div (+ .cse0 c_~sum3~0 c_~sum2~0 .cse3) 4294967296) 4294967296) c_~sum1~0 .cse2)))) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0))) is different from false [2022-12-06 00:22:19,651 WARN L837 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1354 (Array Int Int)) (v_ArrVal_1353 (Array Int Int))) (or (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1353))) (let ((.cse5 (* ~M~0 4)) (.cse4 (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1354) c_~A~0.base))) (let ((.cse2 (select .cse4 (+ c_~A~0.offset 4))) (.cse3 (select (select .cse6 c_~A~0.base) c_~A~0.offset)) (.cse0 (select .cse4 (+ c_~A~0.offset .cse5))) (.cse1 (select .cse4 (+ c_~A~0.offset .cse5 4)))) (= (+ (* (div (+ .cse0 c_~sum3~0 .cse1 c_~sum2~0) 4294967296) 4294967296) c_~sum1~0 .cse2 .cse3) (+ (* (div (+ c_~sum1~0 .cse2 .cse3) 4294967296) 4294967296) .cse0 c_~sum3~0 .cse1 c_~sum2~0))))) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0))) is different from false [2022-12-06 00:22:19,689 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 00:22:19,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045140675] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:22:19,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:22:19,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-12-06 00:22:19,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558609348] [2022-12-06 00:22:19,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:22:19,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 00:22:19,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:22:19,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 00:22:19,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=163, Unknown=2, NotChecked=54, Total=272 [2022-12-06 00:22:19,690 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-06 00:22:19,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 441 transitions, 8607 flow. Second operand has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 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 00:22:19,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:22:19,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-06 00:22:19,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:22:22,424 INFO L130 PetriNetUnfolder]: 8050/12457 cut-off events. [2022-12-06 00:22:22,425 INFO L131 PetriNetUnfolder]: For 184480/184480 co-relation queries the response was YES. [2022-12-06 00:22:22,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93864 conditions, 12457 events. 8050/12457 cut-off events. For 184480/184480 co-relation queries the response was YES. Maximal size of possible extension queue 728. Compared 81159 event pairs, 2193 based on Foata normal form. 2/12459 useless extension candidates. Maximal degree in co-relation 93175. Up to 9910 conditions per place. [2022-12-06 00:22:22,540 INFO L137 encePairwiseOnDemand]: 15/62 looper letters, 338 selfloop transitions, 230 changer transitions 10/578 dead transitions. [2022-12-06 00:22:22,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 578 transitions, 11042 flow [2022-12-06 00:22:22,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 00:22:22,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 00:22:22,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 193 transitions. [2022-12-06 00:22:22,541 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2075268817204301 [2022-12-06 00:22:22,549 INFO L175 Difference]: Start difference. First operand has 170 places, 441 transitions, 8607 flow. Second operand 15 states and 193 transitions. [2022-12-06 00:22:22,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 578 transitions, 11042 flow [2022-12-06 00:22:23,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 578 transitions, 10793 flow, removed 44 selfloop flow, removed 5 redundant places. [2022-12-06 00:22:23,129 INFO L231 Difference]: Finished difference. Result has 187 places, 483 transitions, 9934 flow [2022-12-06 00:22:23,129 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=8365, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=9934, PETRI_PLACES=187, PETRI_TRANSITIONS=483} [2022-12-06 00:22:23,130 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 157 predicate places. [2022-12-06 00:22:23,130 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:22:23,130 INFO L89 Accepts]: Start accepts. Operand has 187 places, 483 transitions, 9934 flow [2022-12-06 00:22:23,132 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:22:23,132 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:22:23,132 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 483 transitions, 9934 flow [2022-12-06 00:22:23,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 483 transitions, 9934 flow [2022-12-06 00:22:23,424 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][263], [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: 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: 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)), 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: 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: 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: 1441#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 462#true, Black: 153#true, 14#thread3EXITtrue, Black: 1445#(and (<= 0 ~M~0) (<= ~N~0 (+ 2 ~M~0)) (<= ~M~0 ~N~0)), Black: 1495#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1488#(and (= ~A~0.offset 0) (<= (+ ~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) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 1709#(and (<= ~sum1~0 ~sum3~0) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum2~0 0) (<= ~sum3~0 ~sum1~0) (<= 2 ~N~0) (<= ~N~0 2) (or (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (= (+ ~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))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0))), Black: 1707#(and (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296))) (or (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (= (+ ~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))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0))), Black: 1584#(and (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) (- 8))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum1~0) (= ~sum2~0 0) (= 2 thread1Thread1of1ForFork1_~i~0) (= ~sum3~0 0) (= (* ~N~0 4) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) (- 8))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 1622#(and (= ~sum2~0 0) (or (<= thread3Thread1of1ForFork0_~i~2 1) (and (<= ~sum1~0 ~sum3~0) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (<= ~sum3~0 ~sum1~0))) (<= 2 ~N~0) (<= ~N~0 2)), Black: 1615#(and (= ~A~0.offset 0) (= ~sum2~0 0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) 0))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) 0)) ~sum1~0) (<= 2 ~N~0) (<= ~N~0 2) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread3Thread1of1ForFork0_~i~2 4))) ~sum3~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|)), Black: 1581#true, 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1587#(or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), 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|)), 1450#true, 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)), 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)), 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)), 1672#(or (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (= (+ ~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))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~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: 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 00:22:23,424 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 00:22:23,424 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 00:22:23,424 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 00:22:23,424 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 00:22:23,424 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][288], [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: 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: 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)), 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: 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: 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: 1441#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 1006#true, 462#true, Black: 1445#(and (<= 0 ~M~0) (<= ~N~0 (+ 2 ~M~0)) (<= ~M~0 ~N~0)), 53#L64-5true, Black: 1495#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1488#(and (= ~A~0.offset 0) (<= (+ ~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) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 1709#(and (<= ~sum1~0 ~sum3~0) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum2~0 0) (<= ~sum3~0 ~sum1~0) (<= 2 ~N~0) (<= ~N~0 2) (or (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (= (+ ~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))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0))), Black: 1707#(and (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296))) (or (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (= (+ ~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))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0))), Black: 1584#(and (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) (- 8))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum1~0) (= ~sum2~0 0) (= 2 thread1Thread1of1ForFork1_~i~0) (= ~sum3~0 0) (= (* ~N~0 4) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) (- 8))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 1622#(and (= ~sum2~0 0) (or (<= thread3Thread1of1ForFork0_~i~2 1) (and (<= ~sum1~0 ~sum3~0) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (<= ~sum3~0 ~sum1~0))) (<= 2 ~N~0) (<= ~N~0 2)), Black: 1615#(and (= ~A~0.offset 0) (= ~sum2~0 0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) 0))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) 0)) ~sum1~0) (<= 2 ~N~0) (<= ~N~0 2) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread3Thread1of1ForFork0_~i~2 4))) ~sum3~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|)), Black: 1672#(or (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (= (+ ~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))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)), Black: 1587#(or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), 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|)), 1450#true, 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, 1581#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))), 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: 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: 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: 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 00:22:23,424 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 00:22:23,424 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 00:22:23,424 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 00:22:23,424 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 00:22:23,500 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][263], [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: 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: 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)), 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: 1441#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 9#thread2EXITtrue, Black: 153#true, 462#true, 14#thread3EXITtrue, Black: 1445#(and (<= 0 ~M~0) (<= ~N~0 (+ 2 ~M~0)) (<= ~M~0 ~N~0)), Black: 1495#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1488#(and (= ~A~0.offset 0) (<= (+ ~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) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 1709#(and (<= ~sum1~0 ~sum3~0) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum2~0 0) (<= ~sum3~0 ~sum1~0) (<= 2 ~N~0) (<= ~N~0 2) (or (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (= (+ ~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))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0))), Black: 1707#(and (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296))) (or (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (= (+ ~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))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0))), Black: 1584#(and (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) (- 8))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum1~0) (= ~sum2~0 0) (= 2 thread1Thread1of1ForFork1_~i~0) (= ~sum3~0 0) (= (* ~N~0 4) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) (- 8))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 1622#(and (= ~sum2~0 0) (or (<= thread3Thread1of1ForFork0_~i~2 1) (and (<= ~sum1~0 ~sum3~0) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (<= ~sum3~0 ~sum1~0))) (<= 2 ~N~0) (<= ~N~0 2)), Black: 1615#(and (= ~A~0.offset 0) (= ~sum2~0 0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) 0))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) 0)) ~sum1~0) (<= 2 ~N~0) (<= ~N~0 2) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread3Thread1of1ForFork0_~i~2 4))) ~sum3~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|)), Black: 1581#true, 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1587#(or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), 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|)), 1450#true, 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))), 1672#(or (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (= (+ ~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))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~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 00:22:23,500 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 00:22:23,500 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:22:23,500 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:22:23,500 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:22:23,501 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][263], [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: 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)), 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: 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: 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: 1441#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 9#thread2EXITtrue, 462#true, Black: 153#true, 14#thread3EXITtrue, Black: 1445#(and (<= 0 ~M~0) (<= ~N~0 (+ 2 ~M~0)) (<= ~M~0 ~N~0)), Black: 1495#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1488#(and (= ~A~0.offset 0) (<= (+ ~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) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 1709#(and (<= ~sum1~0 ~sum3~0) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum2~0 0) (<= ~sum3~0 ~sum1~0) (<= 2 ~N~0) (<= ~N~0 2) (or (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (= (+ ~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))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0))), Black: 1707#(and (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296))) (or (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (= (+ ~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))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0))), Black: 1584#(and (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) (- 8))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum1~0) (= ~sum2~0 0) (= 2 thread1Thread1of1ForFork1_~i~0) (= ~sum3~0 0) (= (* ~N~0 4) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) (- 8))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 1622#(and (= ~sum2~0 0) (or (<= thread3Thread1of1ForFork0_~i~2 1) (and (<= ~sum1~0 ~sum3~0) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (<= ~sum3~0 ~sum1~0))) (<= 2 ~N~0) (<= ~N~0 2)), Black: 1615#(and (= ~A~0.offset 0) (= ~sum2~0 0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) 0))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) 0)) ~sum1~0) (<= 2 ~N~0) (<= ~N~0 2) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread3Thread1of1ForFork0_~i~2 4))) ~sum3~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|)), Black: 1581#true, 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1587#(or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), 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|)), 1450#true, 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)), 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)), 1672#(or (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (= (+ ~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))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~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)), 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 00:22:23,501 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 00:22:23,501 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:23,501 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:23,501 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:23,502 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][263], [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: 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)), 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: 1441#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 9#thread2EXITtrue, 462#true, Black: 153#true, 14#thread3EXITtrue, Black: 1445#(and (<= 0 ~M~0) (<= ~N~0 (+ 2 ~M~0)) (<= ~M~0 ~N~0)), Black: 1495#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1488#(and (= ~A~0.offset 0) (<= (+ ~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) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 1709#(and (<= ~sum1~0 ~sum3~0) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum2~0 0) (<= ~sum3~0 ~sum1~0) (<= 2 ~N~0) (<= ~N~0 2) (or (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (= (+ ~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))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0))), Black: 1707#(and (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296))) (or (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (= (+ ~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))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0))), Black: 1584#(and (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) (- 8))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum1~0) (= ~sum2~0 0) (= 2 thread1Thread1of1ForFork1_~i~0) (= ~sum3~0 0) (= (* ~N~0 4) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) (- 8))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 1622#(and (= ~sum2~0 0) (or (<= thread3Thread1of1ForFork0_~i~2 1) (and (<= ~sum1~0 ~sum3~0) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (<= ~sum3~0 ~sum1~0))) (<= 2 ~N~0) (<= ~N~0 2)), Black: 1615#(and (= ~A~0.offset 0) (= ~sum2~0 0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) 0))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) 0)) ~sum1~0) (<= 2 ~N~0) (<= ~N~0 2) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread3Thread1of1ForFork0_~i~2 4))) ~sum3~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|)), Black: 1581#true, 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1587#(or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), 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|)), 1450#true, 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))), 1672#(or (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (= (+ ~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))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~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)), 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 00:22:23,502 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 00:22:23,502 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:23,502 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:23,502 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:23,502 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:23,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][263], [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: 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)), 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: 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: 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: 1441#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 462#true, Black: 153#true, 14#thread3EXITtrue, Black: 1445#(and (<= 0 ~M~0) (<= ~N~0 (+ 2 ~M~0)) (<= ~M~0 ~N~0)), Black: 1495#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1488#(and (= ~A~0.offset 0) (<= (+ ~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) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 1709#(and (<= ~sum1~0 ~sum3~0) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum2~0 0) (<= ~sum3~0 ~sum1~0) (<= 2 ~N~0) (<= ~N~0 2) (or (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (= (+ ~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))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0))), Black: 1707#(and (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296))) (or (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (= (+ ~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))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0))), Black: 1584#(and (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) (- 8))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum1~0) (= ~sum2~0 0) (= 2 thread1Thread1of1ForFork1_~i~0) (= ~sum3~0 0) (= (* ~N~0 4) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) (- 8))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 1622#(and (= ~sum2~0 0) (or (<= thread3Thread1of1ForFork0_~i~2 1) (and (<= ~sum1~0 ~sum3~0) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (<= ~sum3~0 ~sum1~0))) (<= 2 ~N~0) (<= ~N~0 2)), Black: 1615#(and (= ~A~0.offset 0) (= ~sum2~0 0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) 0))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) 0)) ~sum1~0) (<= 2 ~N~0) (<= ~N~0 2) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread3Thread1of1ForFork0_~i~2 4))) ~sum3~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|)), Black: 1581#true, 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1587#(or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), 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|)), 1450#true, 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: 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)), 1672#(or (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (= (+ ~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))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~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: 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 00:22:23,505 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 00:22:23,505 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:22:23,506 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:22:23,506 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:22:23,542 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][263], [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)), 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: 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: 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: 1441#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 9#thread2EXITtrue, Black: 153#true, 462#true, 14#thread3EXITtrue, Black: 1445#(and (<= 0 ~M~0) (<= ~N~0 (+ 2 ~M~0)) (<= ~M~0 ~N~0)), Black: 1495#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1488#(and (= ~A~0.offset 0) (<= (+ ~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) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 1709#(and (<= ~sum1~0 ~sum3~0) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum2~0 0) (<= ~sum3~0 ~sum1~0) (<= 2 ~N~0) (<= ~N~0 2) (or (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (= (+ ~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))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0))), Black: 1707#(and (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296))) (or (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (= (+ ~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))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0))), Black: 1584#(and (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) (- 8))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum1~0) (= ~sum2~0 0) (= 2 thread1Thread1of1ForFork1_~i~0) (= ~sum3~0 0) (= (* ~N~0 4) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) (- 8))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 1622#(and (= ~sum2~0 0) (or (<= thread3Thread1of1ForFork0_~i~2 1) (and (<= ~sum1~0 ~sum3~0) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (<= ~sum3~0 ~sum1~0))) (<= 2 ~N~0) (<= ~N~0 2)), Black: 1615#(and (= ~A~0.offset 0) (= ~sum2~0 0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) 0))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) 0)) ~sum1~0) (<= 2 ~N~0) (<= ~N~0 2) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread3Thread1of1ForFork0_~i~2 4))) ~sum3~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|)), Black: 1581#true, 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1587#(or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), 1448#(and (<= 0 ~M~0) (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= ~N~0 (+ 2 ~M~0)) (<= ~M~0 ~N~0)), 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|)), 1450#true, 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)), 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: 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))), 1672#(or (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (= (+ ~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))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~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, 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 00:22:23,543 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 00:22:23,543 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:22:23,543 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:22:23,543 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 00:22:23,563 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][263], [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: 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)), 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: 1441#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 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: 1445#(and (<= 0 ~M~0) (<= ~N~0 (+ 2 ~M~0)) (<= ~M~0 ~N~0)), Black: 1495#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1488#(and (= ~A~0.offset 0) (<= (+ ~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) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 1709#(and (<= ~sum1~0 ~sum3~0) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum2~0 0) (<= ~sum3~0 ~sum1~0) (<= 2 ~N~0) (<= ~N~0 2) (or (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (= (+ ~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))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0))), Black: 1707#(and (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296))) (or (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (= (+ ~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))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0))), Black: 1584#(and (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) (- 8))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum1~0) (= ~sum2~0 0) (= 2 thread1Thread1of1ForFork1_~i~0) (= ~sum3~0 0) (= (* ~N~0 4) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) (- 8))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 1622#(and (= ~sum2~0 0) (or (<= thread3Thread1of1ForFork0_~i~2 1) (and (<= ~sum1~0 ~sum3~0) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (<= ~sum3~0 ~sum1~0))) (<= 2 ~N~0) (<= ~N~0 2)), Black: 1615#(and (= ~A~0.offset 0) (= ~sum2~0 0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) 0))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) 0)) ~sum1~0) (<= 2 ~N~0) (<= ~N~0 2) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread3Thread1of1ForFork0_~i~2 4))) ~sum3~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|)), Black: 1581#true, 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1587#(or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), 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|)), 1450#true, 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))), 1672#(or (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (= (+ ~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))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~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 00:22:23,563 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 00:22:23,563 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:23,564 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:23,564 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:23,566 INFO L380 tUnfolder$Statistics]: inserting event number 6 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][263], [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)), 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: 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: 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: 1441#(and (= 2 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 2)), 9#thread2EXITtrue, Black: 153#true, 462#true, 14#thread3EXITtrue, Black: 1445#(and (<= 0 ~M~0) (<= ~N~0 (+ 2 ~M~0)) (<= ~M~0 ~N~0)), Black: 1495#(and (= ~sum3~0 0) (<= ~sum2~0 ~sum1~0) (<= ~sum1~0 ~sum2~0)), Black: 1488#(and (= ~A~0.offset 0) (<= (+ ~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) (= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~sum2~0)), Black: 1709#(and (<= ~sum1~0 ~sum3~0) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (= ~sum2~0 0) (<= ~sum3~0 ~sum1~0) (<= 2 ~N~0) (<= ~N~0 2) (or (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (= (+ ~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))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0))), Black: 1707#(and (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296))) (or (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (= (+ ~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))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0))), Black: 1584#(and (= ~A~0.offset 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) (- 8))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))) ~sum1~0) (= ~sum2~0 0) (= 2 thread1Thread1of1ForFork1_~i~0) (= ~sum3~0 0) (= (* ~N~0 4) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) (- 8))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 1622#(and (= ~sum2~0 0) (or (<= thread3Thread1of1ForFork0_~i~2 1) (and (<= ~sum1~0 ~sum3~0) (<= thread3Thread1of1ForFork0_~i~2 ~N~0) (<= ~sum3~0 ~sum1~0))) (<= 2 ~N~0) (<= ~N~0 2)), Black: 1615#(and (= ~A~0.offset 0) (= ~sum2~0 0) (<= ~sum1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) 0))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) 0)) ~sum1~0) (<= 2 ~N~0) (<= ~N~0 2) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (- 4) (* thread3Thread1of1ForFork0_~i~2 4))) ~sum3~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|)), Black: 1581#true, 347#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), Black: 1587#(or (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= (+ ~sum3~0 ~sum2~0 (* (div ~sum1~0 4294967296) 4294967296)) (+ ~sum1~0 (* (div (+ ~sum3~0 ~sum2~0) 4294967296) 4294967296)))), 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|)), 1450#true, 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))), 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))), 1672#(or (not (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (= (+ ~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))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~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 00:22:23,566 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 00:22:23,566 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:23,566 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:23,566 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:23,566 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:23,566 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 00:22:23,665 INFO L130 PetriNetUnfolder]: 1871/4446 cut-off events. [2022-12-06 00:22:23,665 INFO L131 PetriNetUnfolder]: For 58170/58917 co-relation queries the response was YES. [2022-12-06 00:22:23,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31067 conditions, 4446 events. 1871/4446 cut-off events. For 58170/58917 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 41018 event pairs, 476 based on Foata normal form. 70/4183 useless extension candidates. Maximal degree in co-relation 30813. Up to 1721 conditions per place. [2022-12-06 00:22:23,733 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 187 places, 483 transitions, 9934 flow [2022-12-06 00:22:23,733 INFO L188 LiptonReduction]: Number of co-enabled transitions 2846 [2022-12-06 00:22:23,778 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 [592] $Ultimate##0-->L56-5: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_155 2) (< 1 v_~M~0_167) (= (let ((.cse0 (select |v_#memory_int_351| v_~A~0.base_225))) (+ (select .cse0 v_~A~0.offset_225) (select .cse0 (+ v_~A~0.offset_225 4)) v_~sum2~0_171)) v_~sum2~0_169)) InVars {~A~0.base=v_~A~0.base_225, ~A~0.offset=v_~A~0.offset_225, ~M~0=v_~M~0_167, #memory_int=|v_#memory_int_351|, ~sum2~0=v_~sum2~0_171} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_76|, ~A~0.base=v_~A~0.base_225, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_155, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_84|, ~A~0.offset=v_~A~0.offset_225, ~M~0=v_~M~0_167, #memory_int=|v_#memory_int_351|, ~sum2~0=v_~sum2~0_169} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0] [2022-12-06 00:22:23,827 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 00:22:23,865 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 00:22:23,933 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 00:22:23,975 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:22:23,976 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 846 [2022-12-06 00:22:23,976 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 481 transitions, 9998 flow [2022-12-06 00:22:23,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 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 00:22:23,977 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:22:23,977 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 00:22:23,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-06 00:22:24,183 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,SelfDestructingSolverStorable45 [2022-12-06 00:22:24,184 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 00:22:24,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:22:24,184 INFO L85 PathProgramCache]: Analyzing trace with hash 452632521, now seen corresponding path program 1 times [2022-12-06 00:22:24,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:22:24,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378672548] [2022-12-06 00:22:24,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:22:24,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:22:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:22:24,298 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 00:22:24,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:22:24,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378672548] [2022-12-06 00:22:24,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378672548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:22:24,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:22:24,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:22:24,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414148133] [2022-12-06 00:22:24,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:22:24,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:22:24,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:22:24,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:22:24,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:22:24,299 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 65 [2022-12-06 00:22:24,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 481 transitions, 9998 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 00:22:24,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:22:24,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 65 [2022-12-06 00:22:24,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:22:27,327 INFO L130 PetriNetUnfolder]: 9780/15352 cut-off events. [2022-12-06 00:22:27,327 INFO L131 PetriNetUnfolder]: For 261960/261960 co-relation queries the response was YES. [2022-12-06 00:22:27,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122236 conditions, 15352 events. 9780/15352 cut-off events. For 261960/261960 co-relation queries the response was YES. Maximal size of possible extension queue 892. Compared 105292 event pairs, 2725 based on Foata normal form. 126/15478 useless extension candidates. Maximal degree in co-relation 121493. Up to 9663 conditions per place. [2022-12-06 00:22:27,573 INFO L137 encePairwiseOnDemand]: 43/65 looper letters, 377 selfloop transitions, 257 changer transitions 1/635 dead transitions. [2022-12-06 00:22:27,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 635 transitions, 13876 flow [2022-12-06 00:22:27,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:22:27,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:22:27,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2022-12-06 00:22:27,574 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28205128205128205 [2022-12-06 00:22:27,574 INFO L175 Difference]: Start difference. First operand has 185 places, 481 transitions, 9998 flow. Second operand 6 states and 110 transitions. [2022-12-06 00:22:27,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 635 transitions, 13876 flow [2022-12-06 00:22:28,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 635 transitions, 13681 flow, removed 89 selfloop flow, removed 1 redundant places. [2022-12-06 00:22:28,590 INFO L231 Difference]: Finished difference. Result has 192 places, 532 transitions, 11777 flow [2022-12-06 00:22:28,590 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=9825, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=209, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=11777, PETRI_PLACES=192, PETRI_TRANSITIONS=532} [2022-12-06 00:22:28,591 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 162 predicate places. [2022-12-06 00:22:28,591 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:22:28,591 INFO L89 Accepts]: Start accepts. Operand has 192 places, 532 transitions, 11777 flow [2022-12-06 00:22:28,592 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:22:28,592 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:22:28,593 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 532 transitions, 11777 flow [2022-12-06 00:22:28,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 532 transitions, 11777 flow [2022-12-06 00:22:29,259 INFO L130 PetriNetUnfolder]: 2346/5736 cut-off events. [2022-12-06 00:22:29,259 INFO L131 PetriNetUnfolder]: For 85648/86367 co-relation queries the response was YES. [2022-12-06 00:22:29,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41289 conditions, 5736 events. 2346/5736 cut-off events. For 85648/86367 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 56424 event pairs, 653 based on Foata normal form. 43/5376 useless extension candidates. Maximal degree in co-relation 41033. Up to 2131 conditions per place. [2022-12-06 00:22:29,425 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 532 transitions, 11777 flow [2022-12-06 00:22:29,425 INFO L188 LiptonReduction]: Number of co-enabled transitions 3090 [2022-12-06 00:22:29,447 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 00:22:29,510 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 00:22:29,573 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 00:22:29,648 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 00:22:29,675 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 00:22:29,785 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 00:22:29,823 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:22:29,825 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1234 [2022-12-06 00:22:29,825 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 532 transitions, 11853 flow [2022-12-06 00:22:29,825 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 00:22:29,825 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:22:29,825 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 00:22:29,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-06 00:22:29,825 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 00:22:29,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:22:29,826 INFO L85 PathProgramCache]: Analyzing trace with hash 2104065300, now seen corresponding path program 1 times [2022-12-06 00:22:29,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:22:29,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161730477] [2022-12-06 00:22:29,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:22:29,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:22:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:22:29,932 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 00:22:29,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:22:29,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161730477] [2022-12-06 00:22:29,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161730477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:22:29,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:22:29,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:22:29,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768902709] [2022-12-06 00:22:29,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:22:29,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:22:29,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:22:29,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:22:29,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:22:29,933 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 67 [2022-12-06 00:22:29,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 532 transitions, 11853 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 00:22:29,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:22:29,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 67 [2022-12-06 00:22:29,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:22:32,740 INFO L130 PetriNetUnfolder]: 9785/15370 cut-off events. [2022-12-06 00:22:32,740 INFO L131 PetriNetUnfolder]: For 304588/304588 co-relation queries the response was YES. [2022-12-06 00:22:32,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129673 conditions, 15370 events. 9785/15370 cut-off events. For 304588/304588 co-relation queries the response was YES. Maximal size of possible extension queue 914. Compared 105583 event pairs, 4313 based on Foata normal form. 6/15376 useless extension candidates. Maximal degree in co-relation 128437. Up to 10581 conditions per place. [2022-12-06 00:22:33,014 INFO L137 encePairwiseOnDemand]: 64/67 looper letters, 619 selfloop transitions, 1 changer transitions 10/630 dead transitions. [2022-12-06 00:22:33,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 630 transitions, 14646 flow [2022-12-06 00:22:33,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:22:33,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:22:33,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-12-06 00:22:33,016 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39925373134328357 [2022-12-06 00:22:33,016 INFO L175 Difference]: Start difference. First operand has 191 places, 532 transitions, 11853 flow. Second operand 4 states and 107 transitions. [2022-12-06 00:22:33,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 630 transitions, 14646 flow [2022-12-06 00:22:34,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 630 transitions, 14549 flow, removed 38 selfloop flow, removed 2 redundant places. [2022-12-06 00:22:34,205 INFO L231 Difference]: Finished difference. Result has 193 places, 530 transitions, 11703 flow [2022-12-06 00:22:34,206 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=11766, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=11703, PETRI_PLACES=193, PETRI_TRANSITIONS=530} [2022-12-06 00:22:34,206 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 163 predicate places. [2022-12-06 00:22:34,206 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:22:34,206 INFO L89 Accepts]: Start accepts. Operand has 193 places, 530 transitions, 11703 flow [2022-12-06 00:22:34,208 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:22:34,208 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:22:34,208 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 530 transitions, 11703 flow [2022-12-06 00:22:34,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 530 transitions, 11703 flow [2022-12-06 00:22:34,977 INFO L130 PetriNetUnfolder]: 2350/5726 cut-off events. [2022-12-06 00:22:34,977 INFO L131 PetriNetUnfolder]: For 85212/85951 co-relation queries the response was YES. [2022-12-06 00:22:35,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41342 conditions, 5726 events. 2350/5726 cut-off events. For 85212/85951 co-relation queries the response was YES. Maximal size of possible extension queue 669. Compared 56318 event pairs, 660 based on Foata normal form. 45/5367 useless extension candidates. Maximal degree in co-relation 41106. Up to 2152 conditions per place. [2022-12-06 00:22:35,103 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 190 places, 530 transitions, 11703 flow [2022-12-06 00:22:35,103 INFO L188 LiptonReduction]: Number of co-enabled transitions 3080 [2022-12-06 00:22:35,106 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:22:35,107 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 901 [2022-12-06 00:22:35,107 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 530 transitions, 11703 flow [2022-12-06 00:22:35,107 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 00:22:35,107 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:22:35,107 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 00:22:35,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-06 00:22:35,107 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 00:22:35,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:22:35,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1694341722, now seen corresponding path program 1 times [2022-12-06 00:22:35,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:22:35,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155659366] [2022-12-06 00:22:35,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:22:35,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:22:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:22:35,740 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 00:22:35,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:22:35,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155659366] [2022-12-06 00:22:35,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155659366] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:22:35,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926913100] [2022-12-06 00:22:35,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:22:35,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:22:35,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:22:35,742 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 00:22:35,746 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 00:22:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:22:35,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 00:22:35,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:22:36,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:22:36,055 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:22:36,055 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 00:22:36,124 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 00:22:36,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:22:36,245 INFO L321 Elim1Store]: treesize reduction 10, result has 76.7 percent of original size [2022-12-06 00:22:36,246 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 00:22:36,387 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 00:22:36,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926913100] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:22:36,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:22:36,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 16 [2022-12-06 00:22:36,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208657847] [2022-12-06 00:22:36,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:22:36,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 00:22:36,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:22:36,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 00:22:36,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-12-06 00:22:36,389 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-06 00:22:36,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 530 transitions, 11703 flow. Second operand has 18 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 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 00:22:36,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:22:36,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-06 00:22:36,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:22:39,940 INFO L130 PetriNetUnfolder]: 9955/15633 cut-off events. [2022-12-06 00:22:39,940 INFO L131 PetriNetUnfolder]: For 302158/302158 co-relation queries the response was YES. [2022-12-06 00:22:40,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131222 conditions, 15633 events. 9955/15633 cut-off events. For 302158/302158 co-relation queries the response was YES. Maximal size of possible extension queue 899. Compared 107204 event pairs, 4189 based on Foata normal form. 2/15635 useless extension candidates. Maximal degree in co-relation 129855. Up to 15155 conditions per place. [2022-12-06 00:22:40,109 INFO L137 encePairwiseOnDemand]: 21/66 looper letters, 481 selfloop transitions, 153 changer transitions 11/645 dead transitions. [2022-12-06 00:22:40,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 645 transitions, 14175 flow [2022-12-06 00:22:40,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 00:22:40,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 00:22:40,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 174 transitions. [2022-12-06 00:22:40,110 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16477272727272727 [2022-12-06 00:22:40,110 INFO L175 Difference]: Start difference. First operand has 190 places, 530 transitions, 11703 flow. Second operand 16 states and 174 transitions. [2022-12-06 00:22:40,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 645 transitions, 14175 flow [2022-12-06 00:22:41,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 645 transitions, 14168 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 00:22:41,186 INFO L231 Difference]: Finished difference. Result has 209 places, 564 transitions, 12720 flow [2022-12-06 00:22:41,187 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=11698, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=12720, PETRI_PLACES=209, PETRI_TRANSITIONS=564} [2022-12-06 00:22:41,187 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 179 predicate places. [2022-12-06 00:22:41,187 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:22:41,187 INFO L89 Accepts]: Start accepts. Operand has 209 places, 564 transitions, 12720 flow [2022-12-06 00:22:41,189 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:22:41,189 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:22:41,189 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 209 places, 564 transitions, 12720 flow [2022-12-06 00:22:41,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 564 transitions, 12720 flow [2022-12-06 00:22:41,961 INFO L130 PetriNetUnfolder]: 2361/5777 cut-off events. [2022-12-06 00:22:41,961 INFO L131 PetriNetUnfolder]: For 95569/96313 co-relation queries the response was YES. [2022-12-06 00:22:42,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42873 conditions, 5777 events. 2361/5777 cut-off events. For 95569/96313 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 56850 event pairs, 662 based on Foata normal form. 34/5400 useless extension candidates. Maximal degree in co-relation 42673. Up to 2161 conditions per place. [2022-12-06 00:22:42,068 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 564 transitions, 12720 flow [2022-12-06 00:22:42,068 INFO L188 LiptonReduction]: Number of co-enabled transitions 3278 [2022-12-06 00:22:42,070 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [575] $Ultimate##0-->L64-5: Formula: (let ((.cse0 (+ v_~N~0_179 1)) (.cse1 (select |v_#memory_int_290| v_~A~0.base_191))) (and (< v_thread1Thread1of1ForFork1_~i~0_123 .cse0) (< v_thread3Thread1of1ForFork0_~i~2_143 .cse0) (= v_~sum1~0_217 (+ v_~sum1~0_218 (select .cse1 (+ v_~A~0.offset_191 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_123 4))))) (= v_thread1Thread1of1ForFork1_~i~0_123 1) (= v_thread3Thread1of1ForFork0_~i~2_143 (+ v_~M~0_137 1)) (= (+ v_~sum3~0_144 (select .cse1 (+ (* v_thread3Thread1of1ForFork0_~i~2_143 4) v_~A~0.offset_191 (- 4)))) v_~sum3~0_143))) InVars {~A~0.base=v_~A~0.base_191, ~A~0.offset=v_~A~0.offset_191, ~M~0=v_~M~0_137, ~sum1~0=v_~sum1~0_218, #memory_int=|v_#memory_int_290|, ~sum3~0=v_~sum3~0_144, ~N~0=v_~N~0_179} OutVars{~A~0.base=v_~A~0.base_191, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_143, ~sum3~0=v_~sum3~0_143, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_123, ~N~0=v_~N~0_179, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_73|, ~A~0.offset=v_~A~0.offset_191, ~M~0=v_~M~0_137, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_105|, ~sum1~0=v_~sum1~0_217, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_97|, #memory_int=|v_#memory_int_290|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_71|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5] 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 00:22:42,199 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [575] $Ultimate##0-->L64-5: Formula: (let ((.cse0 (+ v_~N~0_179 1)) (.cse1 (select |v_#memory_int_290| v_~A~0.base_191))) (and (< v_thread1Thread1of1ForFork1_~i~0_123 .cse0) (< v_thread3Thread1of1ForFork0_~i~2_143 .cse0) (= v_~sum1~0_217 (+ v_~sum1~0_218 (select .cse1 (+ v_~A~0.offset_191 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_123 4))))) (= v_thread1Thread1of1ForFork1_~i~0_123 1) (= v_thread3Thread1of1ForFork0_~i~2_143 (+ v_~M~0_137 1)) (= (+ v_~sum3~0_144 (select .cse1 (+ (* v_thread3Thread1of1ForFork0_~i~2_143 4) v_~A~0.offset_191 (- 4)))) v_~sum3~0_143))) InVars {~A~0.base=v_~A~0.base_191, ~A~0.offset=v_~A~0.offset_191, ~M~0=v_~M~0_137, ~sum1~0=v_~sum1~0_218, #memory_int=|v_#memory_int_290|, ~sum3~0=v_~sum3~0_144, ~N~0=v_~N~0_179} OutVars{~A~0.base=v_~A~0.base_191, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_143, ~sum3~0=v_~sum3~0_143, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_123, ~N~0=v_~N~0_179, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_73|, ~A~0.offset=v_~A~0.offset_191, ~M~0=v_~M~0_137, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_105|, ~sum1~0=v_~sum1~0_217, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_97|, #memory_int=|v_#memory_int_290|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_71|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5] 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 00:22:42,273 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 00:22:42,477 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [601] $Ultimate##0-->L64-5: Formula: (let ((.cse0 (select |v_#memory_int_369| v_~A~0.base_243))) (and (= v_~sum1~0_323 (+ (select .cse0 (+ v_~A~0.offset_243 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_191 4))) v_~sum1~0_324)) (= v_thread1Thread1of1ForFork1_~i~0_191 1) (< v_thread1Thread1of1ForFork1_~i~0_191 (+ v_~N~0_227 1)) (= v_thread3Thread1of1ForFork0_~i~2_233 (+ v_~M~0_185 1)) (= |v_thread2Thread1of1ForFork2_#res.offset_77| 0) (= (+ v_~sum3~0_201 (select .cse0 (+ v_~A~0.offset_243 (- 4) (* v_thread3Thread1of1ForFork0_~i~2_233 4)))) v_~sum3~0_200) (= |v_thread2Thread1of1ForFork2_#res.base_77| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_171 v_~M~0_185)) (= v_thread2Thread1of1ForFork2_~i~1_171 0))) InVars {~A~0.base=v_~A~0.base_243, ~A~0.offset=v_~A~0.offset_243, ~sum1~0=v_~sum1~0_324, ~M~0=v_~M~0_185, #memory_int=|v_#memory_int_369|, ~sum3~0=v_~sum3~0_201, ~N~0=v_~N~0_227} OutVars{~A~0.base=v_~A~0.base_243, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_233, ~sum3~0=v_~sum3~0_200, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_191, ~N~0=v_~N~0_227, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_114|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_171, ~A~0.offset=v_~A~0.offset_243, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_169|, ~sum1~0=v_~sum1~0_323, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_77|, ~M~0=v_~M~0_185, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_161|, #memory_int=|v_#memory_int_369|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_112|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_77|} 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 00:22:42,577 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [601] $Ultimate##0-->L64-5: Formula: (let ((.cse0 (select |v_#memory_int_369| v_~A~0.base_243))) (and (= v_~sum1~0_323 (+ (select .cse0 (+ v_~A~0.offset_243 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_191 4))) v_~sum1~0_324)) (= v_thread1Thread1of1ForFork1_~i~0_191 1) (< v_thread1Thread1of1ForFork1_~i~0_191 (+ v_~N~0_227 1)) (= v_thread3Thread1of1ForFork0_~i~2_233 (+ v_~M~0_185 1)) (= |v_thread2Thread1of1ForFork2_#res.offset_77| 0) (= (+ v_~sum3~0_201 (select .cse0 (+ v_~A~0.offset_243 (- 4) (* v_thread3Thread1of1ForFork0_~i~2_233 4)))) v_~sum3~0_200) (= |v_thread2Thread1of1ForFork2_#res.base_77| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_171 v_~M~0_185)) (= v_thread2Thread1of1ForFork2_~i~1_171 0))) InVars {~A~0.base=v_~A~0.base_243, ~A~0.offset=v_~A~0.offset_243, ~sum1~0=v_~sum1~0_324, ~M~0=v_~M~0_185, #memory_int=|v_#memory_int_369|, ~sum3~0=v_~sum3~0_201, ~N~0=v_~N~0_227} OutVars{~A~0.base=v_~A~0.base_243, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_233, ~sum3~0=v_~sum3~0_200, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_191, ~N~0=v_~N~0_227, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_114|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_171, ~A~0.offset=v_~A~0.offset_243, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_169|, ~sum1~0=v_~sum1~0_323, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_77|, ~M~0=v_~M~0_185, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_161|, #memory_int=|v_#memory_int_369|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_112|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_77|} 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 [606] L48-5-->L64-5: Formula: (let ((.cse0 (select |v_#memory_int_381| v_~A~0.base_253))) (and (= (+ v_thread1Thread1of1ForFork1_~i~0_205 1) v_thread1Thread1of1ForFork1_~i~0_204) (= v_~sum1~0_345 (+ v_~sum1~0_346 (select .cse0 (+ v_~A~0.offset_253 (* v_thread1Thread1of1ForFork1_~i~0_205 4))))) (< v_thread1Thread1of1ForFork1_~i~0_205 v_~N~0_237) (< v_thread3Thread1of1ForFork0_~i~2_254 v_~N~0_237) (= (+ (select .cse0 (+ (* v_thread3Thread1of1ForFork0_~i~2_254 4) v_~A~0.offset_253)) v_~sum3~0_227) v_~sum3~0_226) (= v_thread3Thread1of1ForFork0_~i~2_253 (+ v_thread3Thread1of1ForFork0_~i~2_254 1)))) InVars {~A~0.base=v_~A~0.base_253, ~A~0.offset=v_~A~0.offset_253, ~sum1~0=v_~sum1~0_346, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_254, #memory_int=|v_#memory_int_381|, ~sum3~0=v_~sum3~0_227, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_205, ~N~0=v_~N~0_237} OutVars{~A~0.base=v_~A~0.base_253, ~A~0.offset=v_~A~0.offset_253, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_182|, ~sum1~0=v_~sum1~0_345, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_174|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_253, #memory_int=|v_#memory_int_381|, ~sum3~0=v_~sum3~0_226, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_204, ~N~0=v_~N~0_237, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_129|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_127|} 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 00:22:42,702 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [601] $Ultimate##0-->L64-5: Formula: (let ((.cse0 (select |v_#memory_int_369| v_~A~0.base_243))) (and (= v_~sum1~0_323 (+ (select .cse0 (+ v_~A~0.offset_243 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_191 4))) v_~sum1~0_324)) (= v_thread1Thread1of1ForFork1_~i~0_191 1) (< v_thread1Thread1of1ForFork1_~i~0_191 (+ v_~N~0_227 1)) (= v_thread3Thread1of1ForFork0_~i~2_233 (+ v_~M~0_185 1)) (= |v_thread2Thread1of1ForFork2_#res.offset_77| 0) (= (+ v_~sum3~0_201 (select .cse0 (+ v_~A~0.offset_243 (- 4) (* v_thread3Thread1of1ForFork0_~i~2_233 4)))) v_~sum3~0_200) (= |v_thread2Thread1of1ForFork2_#res.base_77| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_171 v_~M~0_185)) (= v_thread2Thread1of1ForFork2_~i~1_171 0))) InVars {~A~0.base=v_~A~0.base_243, ~A~0.offset=v_~A~0.offset_243, ~sum1~0=v_~sum1~0_324, ~M~0=v_~M~0_185, #memory_int=|v_#memory_int_369|, ~sum3~0=v_~sum3~0_201, ~N~0=v_~N~0_227} OutVars{~A~0.base=v_~A~0.base_243, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_233, ~sum3~0=v_~sum3~0_200, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_191, ~N~0=v_~N~0_227, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_114|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_171, ~A~0.offset=v_~A~0.offset_243, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_169|, ~sum1~0=v_~sum1~0_323, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_77|, ~M~0=v_~M~0_185, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_161|, #memory_int=|v_#memory_int_369|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_112|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_77|} 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 [607] L48-5-->L48-5: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_208 (+ v_~N~0_239 1)) (= v_~sum1~0_349 (let ((.cse0 (select |v_#memory_int_383| v_~A~0.base_255))) (+ v_~sum1~0_351 (select .cse0 (+ v_~A~0.offset_255 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_208 4))) (select .cse0 (+ v_~A~0.offset_255 (* v_thread1Thread1of1ForFork1_~i~0_210 4)))))) (= v_thread1Thread1of1ForFork1_~i~0_208 (+ 2 v_thread1Thread1of1ForFork1_~i~0_210))) InVars {~A~0.base=v_~A~0.base_255, ~A~0.offset=v_~A~0.offset_255, ~sum1~0=v_~sum1~0_351, #memory_int=|v_#memory_int_383|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_210, ~N~0=v_~N~0_239} OutVars{~A~0.base=v_~A~0.base_255, ~A~0.offset=v_~A~0.offset_255, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_184|, ~sum1~0=v_~sum1~0_349, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_176|, #memory_int=|v_#memory_int_383|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_208, ~N~0=v_~N~0_239} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] [2022-12-06 00:22:42,876 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [595] $Ultimate##0-->L56-5: Formula: (let ((.cse0 (select |v_#memory_int_357| v_~A~0.base_231))) (and (= (+ v_~sum2~0_180 (select .cse0 v_~A~0.offset_231)) v_~sum2~0_179) (= v_thread2Thread1of1ForFork2_~i~1_161 1) (= 0 |v_thread3Thread1of1ForFork0_#res.base_59|) (= v_thread1Thread1of1ForFork1_~i~0_183 1) (not (< v_thread3Thread1of1ForFork0_~i~2_219 v_~N~0_215)) (= |v_thread3Thread1of1ForFork0_#res.offset_59| 0) (< v_thread1Thread1of1ForFork1_~i~0_183 (+ v_~N~0_215 1)) (= v_~M~0_173 v_thread3Thread1of1ForFork0_~i~2_219) (= v_~sum1~0_307 (+ v_~sum1~0_308 (select .cse0 (+ v_~A~0.offset_231 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_183 4))))))) InVars {~A~0.base=v_~A~0.base_231, ~A~0.offset=v_~A~0.offset_231, ~M~0=v_~M~0_173, ~sum1~0=v_~sum1~0_308, #memory_int=|v_#memory_int_357|, ~sum2~0=v_~sum2~0_180, ~N~0=v_~N~0_215} OutVars{~A~0.base=v_~A~0.base_231, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_219, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_183, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_59|, ~sum2~0=v_~sum2~0_179, ~N~0=v_~N~0_215, thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_82|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_161, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_90|, ~A~0.offset=v_~A~0.offset_231, ~M~0=v_~M~0_173, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_161|, ~sum1~0=v_~sum1~0_307, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_153|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_59|, #memory_int=|v_#memory_int_357|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_~i~2, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#res.base, ~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 00:22:42,972 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 00:22:42,972 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1785 [2022-12-06 00:22:42,972 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 564 transitions, 13013 flow [2022-12-06 00:22:42,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 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 00:22:42,973 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:22:42,973 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 00:22:42,978 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 00:22:43,177 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,SelfDestructingSolverStorable48 [2022-12-06 00:22:43,177 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 00:22:43,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:22:43,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1535386000, now seen corresponding path program 1 times [2022-12-06 00:22:43,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:22:43,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855931692] [2022-12-06 00:22:43,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:22:43,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:22:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:22:43,762 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 00:22:43,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:22:43,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855931692] [2022-12-06 00:22:43,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855931692] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:22:43,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506347403] [2022-12-06 00:22:43,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:22:43,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:22:43,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:22:43,764 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 00:22:43,766 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 00:22:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:22:43,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-06 00:22:43,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:22:43,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:22:43,940 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 00:22:43,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-06 00:22:43,946 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 6 treesize of output 5 [2022-12-06 00:22:43,987 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 6 treesize of output 5 [2022-12-06 00:22:44,025 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 6 treesize of output 5 [2022-12-06 00:22:44,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:22:44,132 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:22:44,132 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 00:22:44,207 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 00:22:44,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:22:46,341 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1522 (Array Int Int)) (~M~0 Int)) (or (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1522) c_~A~0.base))) (= (mod (let ((.cse1 (* ~M~0 4))) (+ (select .cse0 (+ c_~A~0.offset .cse1 4)) c_~sum3~0 c_~sum2~0 (select .cse0 (+ c_~A~0.offset .cse1)))) 4294967296) (mod (+ (select .cse0 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 00:22:46,370 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1522 (Array Int Int)) (~M~0 Int) (v_ArrVal_1521 (Array Int Int))) (or (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1522) c_~A~0.base))) (= (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) (mod (+ c_~sum1~0 (select .cse0 (+ c_~A~0.offset 4)) (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 00:22:46,384 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 00:22:46,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506347403] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:22:46,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:22:46,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 00:22:46,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458307204] [2022-12-06 00:22:46,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:22:46,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 00:22:46,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:22:46,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 00:22:46,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=206, Unknown=2, NotChecked=62, Total=342 [2022-12-06 00:22:46,385 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 75 [2022-12-06 00:22:46,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 564 transitions, 13013 flow. Second operand has 19 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 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 00:22:46,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:22:46,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 75 [2022-12-06 00:22:46,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:22:50,161 INFO L130 PetriNetUnfolder]: 10167/15972 cut-off events. [2022-12-06 00:22:50,162 INFO L131 PetriNetUnfolder]: For 338090/338090 co-relation queries the response was YES. [2022-12-06 00:22:50,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137784 conditions, 15972 events. 10167/15972 cut-off events. For 338090/338090 co-relation queries the response was YES. Maximal size of possible extension queue 947. Compared 110246 event pairs, 4101 based on Foata normal form. 4/15976 useless extension candidates. Maximal degree in co-relation 137004. Up to 15348 conditions per place. [2022-12-06 00:22:50,488 INFO L137 encePairwiseOnDemand]: 21/75 looper letters, 514 selfloop transitions, 177 changer transitions 10/701 dead transitions. [2022-12-06 00:22:50,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 701 transitions, 16136 flow [2022-12-06 00:22:50,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 00:22:50,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 00:22:50,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 199 transitions. [2022-12-06 00:22:50,489 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1768888888888889 [2022-12-06 00:22:50,489 INFO L175 Difference]: Start difference. First operand has 209 places, 564 transitions, 13013 flow. Second operand 15 states and 199 transitions. [2022-12-06 00:22:50,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 701 transitions, 16136 flow [2022-12-06 00:22:52,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 701 transitions, 15867 flow, removed 120 selfloop flow, removed 2 redundant places. [2022-12-06 00:22:52,217 INFO L231 Difference]: Finished difference. Result has 225 places, 601 transitions, 13990 flow [2022-12-06 00:22:52,217 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=12682, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=13990, PETRI_PLACES=225, PETRI_TRANSITIONS=601} [2022-12-06 00:22:52,218 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 195 predicate places. [2022-12-06 00:22:52,218 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:22:52,218 INFO L89 Accepts]: Start accepts. Operand has 225 places, 601 transitions, 13990 flow [2022-12-06 00:22:52,220 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:22:52,220 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:22:52,220 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 225 places, 601 transitions, 13990 flow [2022-12-06 00:22:52,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 601 transitions, 13990 flow [2022-12-06 00:22:53,039 INFO L130 PetriNetUnfolder]: 2394/5892 cut-off events. [2022-12-06 00:22:53,039 INFO L131 PetriNetUnfolder]: For 113142/113940 co-relation queries the response was YES. [2022-12-06 00:22:53,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45961 conditions, 5892 events. 2394/5892 cut-off events. For 113142/113940 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 58580 event pairs, 673 based on Foata normal form. 42/5517 useless extension candidates. Maximal degree in co-relation 45752. Up to 2173 conditions per place. [2022-12-06 00:22:53,156 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 601 transitions, 13990 flow [2022-12-06 00:22:53,157 INFO L188 LiptonReduction]: Number of co-enabled transitions 3434 [2022-12-06 00:22:53,161 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:22:53,161 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 943 [2022-12-06 00:22:53,161 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 601 transitions, 13990 flow [2022-12-06 00:22:53,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 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 00:22:53,161 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:22:53,161 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 00:22:53,167 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 00:22:53,367 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,SelfDestructingSolverStorable49 [2022-12-06 00:22:53,367 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 00:22:53,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:22:53,367 INFO L85 PathProgramCache]: Analyzing trace with hash 519353206, now seen corresponding path program 1 times [2022-12-06 00:22:53,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:22:53,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014938207] [2022-12-06 00:22:53,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:22:53,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:22:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:22:53,432 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 00:22:53,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:22:53,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014938207] [2022-12-06 00:22:53,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014938207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:22:53,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:22:53,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:22:53,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444234475] [2022-12-06 00:22:53,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:22:53,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:22:53,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:22:53,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:22:53,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:22:53,434 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 72 [2022-12-06 00:22:53,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 601 transitions, 13990 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 00:22:53,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:22:53,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 72 [2022-12-06 00:22:53,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:22:56,926 INFO L130 PetriNetUnfolder]: 9920/15844 cut-off events. [2022-12-06 00:22:56,926 INFO L131 PetriNetUnfolder]: For 395700/397001 co-relation queries the response was YES. [2022-12-06 00:22:57,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143044 conditions, 15844 events. 9920/15844 cut-off events. For 395700/397001 co-relation queries the response was YES. Maximal size of possible extension queue 1027. Compared 114110 event pairs, 4342 based on Foata normal form. 698/16302 useless extension candidates. Maximal degree in co-relation 142239. Up to 7295 conditions per place. [2022-12-06 00:22:57,160 INFO L137 encePairwiseOnDemand]: 61/72 looper letters, 712 selfloop transitions, 10 changer transitions 1/734 dead transitions. [2022-12-06 00:22:57,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 734 transitions, 17787 flow [2022-12-06 00:22:57,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:22:57,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:22:57,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2022-12-06 00:22:57,161 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-06 00:22:57,161 INFO L175 Difference]: Start difference. First operand has 223 places, 601 transitions, 13990 flow. Second operand 4 states and 128 transitions. [2022-12-06 00:22:57,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 734 transitions, 17787 flow [2022-12-06 00:22:58,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 734 transitions, 17382 flow, removed 166 selfloop flow, removed 5 redundant places. [2022-12-06 00:22:58,805 INFO L231 Difference]: Finished difference. Result has 222 places, 594 transitions, 13506 flow [2022-12-06 00:22:58,805 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=13494, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=13506, PETRI_PLACES=222, PETRI_TRANSITIONS=594} [2022-12-06 00:22:58,805 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 192 predicate places. [2022-12-06 00:22:58,805 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:22:58,805 INFO L89 Accepts]: Start accepts. Operand has 222 places, 594 transitions, 13506 flow [2022-12-06 00:22:58,809 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:22:58,809 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:22:58,809 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 222 places, 594 transitions, 13506 flow [2022-12-06 00:22:58,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 221 places, 594 transitions, 13506 flow [2022-12-06 00:22:59,699 INFO L130 PetriNetUnfolder]: 2458/6137 cut-off events. [2022-12-06 00:22:59,699 INFO L131 PetriNetUnfolder]: For 114852/115638 co-relation queries the response was YES. [2022-12-06 00:22:59,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47411 conditions, 6137 events. 2458/6137 cut-off events. For 114852/115638 co-relation queries the response was YES. Maximal size of possible extension queue 728. Compared 62195 event pairs, 695 based on Foata normal form. 41/5744 useless extension candidates. Maximal degree in co-relation 47201. Up to 2248 conditions per place. [2022-12-06 00:22:59,804 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 221 places, 594 transitions, 13506 flow [2022-12-06 00:22:59,804 INFO L188 LiptonReduction]: Number of co-enabled transitions 3406 [2022-12-06 00:22:59,809 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:22:59,809 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1004 [2022-12-06 00:22:59,809 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 594 transitions, 13506 flow [2022-12-06 00:22:59,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 00:22:59,809 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:22:59,810 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 00:22:59,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-06 00:22:59,810 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 00:22:59,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:22:59,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1220804560, now seen corresponding path program 1 times [2022-12-06 00:22:59,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:22:59,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111878103] [2022-12-06 00:22:59,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:22:59,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:22:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:22:59,858 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 00:22:59,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:22:59,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111878103] [2022-12-06 00:22:59,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111878103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:22:59,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:22:59,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:22:59,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136858647] [2022-12-06 00:22:59,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:22:59,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:22:59,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:22:59,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:22:59,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:22:59,860 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-06 00:22:59,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 594 transitions, 13506 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 00:22:59,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:22:59,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-06 00:22:59,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:23:03,304 INFO L130 PetriNetUnfolder]: 10646/16795 cut-off events. [2022-12-06 00:23:03,304 INFO L131 PetriNetUnfolder]: For 390152/390152 co-relation queries the response was YES. [2022-12-06 00:23:03,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149090 conditions, 16795 events. 10646/16795 cut-off events. For 390152/390152 co-relation queries the response was YES. Maximal size of possible extension queue 1016. Compared 117984 event pairs, 2681 based on Foata normal form. 76/16871 useless extension candidates. Maximal degree in co-relation 148284. Up to 6749 conditions per place. [2022-12-06 00:23:03,511 INFO L137 encePairwiseOnDemand]: 56/72 looper letters, 720 selfloop transitions, 49 changer transitions 1/770 dead transitions. [2022-12-06 00:23:03,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 770 transitions, 17861 flow [2022-12-06 00:23:03,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:23:03,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:23:03,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2022-12-06 00:23:03,512 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3638888888888889 [2022-12-06 00:23:03,512 INFO L175 Difference]: Start difference. First operand has 221 places, 594 transitions, 13506 flow. Second operand 5 states and 131 transitions. [2022-12-06 00:23:03,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 770 transitions, 17861 flow [2022-12-06 00:23:05,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 770 transitions, 17848 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 00:23:05,289 INFO L231 Difference]: Finished difference. Result has 224 places, 596 transitions, 13752 flow [2022-12-06 00:23:05,290 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=13449, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=13752, PETRI_PLACES=224, PETRI_TRANSITIONS=596} [2022-12-06 00:23:05,290 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 194 predicate places. [2022-12-06 00:23:05,290 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:23:05,290 INFO L89 Accepts]: Start accepts. Operand has 224 places, 596 transitions, 13752 flow [2022-12-06 00:23:05,292 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:23:05,292 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:23:05,292 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 224 places, 596 transitions, 13752 flow [2022-12-06 00:23:05,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 224 places, 596 transitions, 13752 flow [2022-12-06 00:23:06,117 INFO L130 PetriNetUnfolder]: 2477/6171 cut-off events. [2022-12-06 00:23:06,117 INFO L131 PetriNetUnfolder]: For 128060/128843 co-relation queries the response was YES. [2022-12-06 00:23:06,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48442 conditions, 6171 events. 2477/6171 cut-off events. For 128060/128843 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 62649 event pairs, 703 based on Foata normal form. 41/5768 useless extension candidates. Maximal degree in co-relation 48231. Up to 2275 conditions per place. [2022-12-06 00:23:06,229 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 224 places, 596 transitions, 13752 flow [2022-12-06 00:23:06,230 INFO L188 LiptonReduction]: Number of co-enabled transitions 3422 [2022-12-06 00:23:06,234 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:23:06,234 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 944 [2022-12-06 00:23:06,234 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 596 transitions, 13752 flow [2022-12-06 00:23:06,234 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 00:23:06,234 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:23:06,234 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 00:23:06,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-06 00:23:06,235 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 00:23:06,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:23:06,235 INFO L85 PathProgramCache]: Analyzing trace with hash 552434898, now seen corresponding path program 2 times [2022-12-06 00:23:06,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:23:06,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564835451] [2022-12-06 00:23:06,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:23:06,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:23:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:23:06,943 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 00:23:06,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:23:06,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564835451] [2022-12-06 00:23:06,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564835451] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:23:06,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318458963] [2022-12-06 00:23:06,944 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 00:23:06,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:23:06,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:23:06,945 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 00:23:06,947 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 00:23:07,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 00:23:07,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:23:07,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-06 00:23:07,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:23:07,239 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 00:23:07,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:23:07,241 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 00:23:07,244 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:23:07,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 17 [2022-12-06 00:23:07,270 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 00:23:07,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:23:07,336 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:23:07,336 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 57 [2022-12-06 00:23:07,608 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 00:23:07,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318458963] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:23:07,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:23:07,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 13 [2022-12-06 00:23:07,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197725309] [2022-12-06 00:23:07,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:23:07,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 00:23:07,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:23:07,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 00:23:07,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-12-06 00:23:07,609 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 71 [2022-12-06 00:23:07,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 596 transitions, 13752 flow. Second operand has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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 00:23:07,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:23:07,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 71 [2022-12-06 00:23:07,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:23:11,685 INFO L130 PetriNetUnfolder]: 10644/16783 cut-off events. [2022-12-06 00:23:11,685 INFO L131 PetriNetUnfolder]: For 426641/426641 co-relation queries the response was YES. [2022-12-06 00:23:11,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150715 conditions, 16783 events. 10644/16783 cut-off events. For 426641/426641 co-relation queries the response was YES. Maximal size of possible extension queue 1026. Compared 117503 event pairs, 4484 based on Foata normal form. 2/16785 useless extension candidates. Maximal degree in co-relation 149908. Up to 16260 conditions per place. [2022-12-06 00:23:11,876 INFO L137 encePairwiseOnDemand]: 22/71 looper letters, 508 selfloop transitions, 161 changer transitions 6/675 dead transitions. [2022-12-06 00:23:11,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 675 transitions, 15903 flow [2022-12-06 00:23:11,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 00:23:11,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 00:23:11,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 164 transitions. [2022-12-06 00:23:11,877 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19248826291079812 [2022-12-06 00:23:11,877 INFO L175 Difference]: Start difference. First operand has 224 places, 596 transitions, 13752 flow. Second operand 12 states and 164 transitions. [2022-12-06 00:23:11,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 675 transitions, 15903 flow [2022-12-06 00:23:13,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 675 transitions, 15863 flow, removed 20 selfloop flow, removed 0 redundant places. [2022-12-06 00:23:13,804 INFO L231 Difference]: Finished difference. Result has 236 places, 597 transitions, 14106 flow [2022-12-06 00:23:13,804 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=13719, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=14106, PETRI_PLACES=236, PETRI_TRANSITIONS=597} [2022-12-06 00:23:13,805 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 206 predicate places. [2022-12-06 00:23:13,805 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:23:13,805 INFO L89 Accepts]: Start accepts. Operand has 236 places, 597 transitions, 14106 flow [2022-12-06 00:23:13,807 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:23:13,807 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:23:13,807 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 236 places, 597 transitions, 14106 flow [2022-12-06 00:23:13,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 236 places, 597 transitions, 14106 flow [2022-12-06 00:23:14,704 INFO L130 PetriNetUnfolder]: 2468/6167 cut-off events. [2022-12-06 00:23:14,704 INFO L131 PetriNetUnfolder]: For 123493/124303 co-relation queries the response was YES. [2022-12-06 00:23:14,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48017 conditions, 6167 events. 2468/6167 cut-off events. For 123493/124303 co-relation queries the response was YES. Maximal size of possible extension queue 686. Compared 62521 event pairs, 697 based on Foata normal form. 42/5762 useless extension candidates. Maximal degree in co-relation 47799. Up to 2253 conditions per place. [2022-12-06 00:23:14,796 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 236 places, 597 transitions, 14106 flow [2022-12-06 00:23:14,797 INFO L188 LiptonReduction]: Number of co-enabled transitions 3436 [2022-12-06 00:23:14,833 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 [614] L48-5-->L48-5: Formula: (and (= (+ 2 v_thread1Thread1of1ForFork1_~i~0_242) v_thread1Thread1of1ForFork1_~i~0_240) (= (let ((.cse0 (select |v_#memory_int_404| v_~A~0.base_269))) (+ v_~sum1~0_397 (select .cse0 (+ v_~A~0.offset_269 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_240 4))) (select .cse0 (+ v_~A~0.offset_269 (* v_thread1Thread1of1ForFork1_~i~0_242 4))))) v_~sum1~0_395) (< v_thread1Thread1of1ForFork1_~i~0_240 (+ v_~N~0_253 1))) InVars {~A~0.base=v_~A~0.base_269, ~A~0.offset=v_~A~0.offset_269, ~sum1~0=v_~sum1~0_397, #memory_int=|v_#memory_int_404|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_242, ~N~0=v_~N~0_253} OutVars{~A~0.base=v_~A~0.base_269, ~A~0.offset=v_~A~0.offset_269, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_214|, ~sum1~0=v_~sum1~0_395, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_206|, #memory_int=|v_#memory_int_404|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_240, ~N~0=v_~N~0_253} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] [2022-12-06 00:23:14,876 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 00:23:14,921 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:23:14,922 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1117 [2022-12-06 00:23:14,922 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 597 transitions, 14156 flow [2022-12-06 00:23:14,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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 00:23:14,922 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:23:14,922 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 00:23:14,927 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 00:23:15,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:23:15,127 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 00:23:15,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:23:15,128 INFO L85 PathProgramCache]: Analyzing trace with hash 396970509, now seen corresponding path program 2 times [2022-12-06 00:23:15,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:23:15,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518173679] [2022-12-06 00:23:15,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:23:15,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:23:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:23:15,177 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 00:23:15,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:23:15,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518173679] [2022-12-06 00:23:15,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518173679] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:23:15,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:23:15,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:23:15,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722474603] [2022-12-06 00:23:15,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:23:15,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:23:15,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:23:15,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:23:15,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:23:15,179 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 73 [2022-12-06 00:23:15,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 597 transitions, 14156 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 00:23:15,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:23:15,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 73 [2022-12-06 00:23:15,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:23:18,852 INFO L130 PetriNetUnfolder]: 11010/17195 cut-off events. [2022-12-06 00:23:18,853 INFO L131 PetriNetUnfolder]: For 426350/426350 co-relation queries the response was YES. [2022-12-06 00:23:18,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153692 conditions, 17195 events. 11010/17195 cut-off events. For 426350/426350 co-relation queries the response was YES. Maximal size of possible extension queue 992. Compared 119422 event pairs, 2372 based on Foata normal form. 130/17325 useless extension candidates. Maximal degree in co-relation 152806. Up to 7201 conditions per place. [2022-12-06 00:23:19,063 INFO L137 encePairwiseOnDemand]: 32/73 looper letters, 482 selfloop transitions, 262 changer transitions 12/756 dead transitions. [2022-12-06 00:23:19,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 756 transitions, 18495 flow [2022-12-06 00:23:19,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:23:19,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:23:19,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2022-12-06 00:23:19,065 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2482876712328767 [2022-12-06 00:23:19,065 INFO L175 Difference]: Start difference. First operand has 236 places, 597 transitions, 14156 flow. Second operand 8 states and 145 transitions. [2022-12-06 00:23:19,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 756 transitions, 18495 flow [2022-12-06 00:23:20,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 756 transitions, 18069 flow, removed 27 selfloop flow, removed 9 redundant places. [2022-12-06 00:23:20,830 INFO L231 Difference]: Finished difference. Result has 239 places, 616 transitions, 15309 flow [2022-12-06 00:23:20,830 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=13609, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=236, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=15309, PETRI_PLACES=239, PETRI_TRANSITIONS=616} [2022-12-06 00:23:20,830 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 209 predicate places. [2022-12-06 00:23:20,830 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:23:20,830 INFO L89 Accepts]: Start accepts. Operand has 239 places, 616 transitions, 15309 flow [2022-12-06 00:23:20,833 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:23:20,833 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:23:20,833 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 239 places, 616 transitions, 15309 flow [2022-12-06 00:23:20,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 239 places, 616 transitions, 15309 flow [2022-12-06 00:23:21,692 INFO L130 PetriNetUnfolder]: 2504/6131 cut-off events. [2022-12-06 00:23:21,692 INFO L131 PetriNetUnfolder]: For 136353/137135 co-relation queries the response was YES. [2022-12-06 00:23:21,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50480 conditions, 6131 events. 2504/6131 cut-off events. For 136353/137135 co-relation queries the response was YES. Maximal size of possible extension queue 682. Compared 61373 event pairs, 744 based on Foata normal form. 62/5748 useless extension candidates. Maximal degree in co-relation 50253. Up to 2311 conditions per place. [2022-12-06 00:23:21,951 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 239 places, 616 transitions, 15309 flow [2022-12-06 00:23:21,952 INFO L188 LiptonReduction]: Number of co-enabled transitions 3646 [2022-12-06 00:23:21,955 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:23:21,957 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1127 [2022-12-06 00:23:21,957 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 616 transitions, 15309 flow [2022-12-06 00:23:21,957 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 00:23:21,957 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:23:21,958 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:23:21,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-06 00:23:21,958 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 00:23:21,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:23:21,958 INFO L85 PathProgramCache]: Analyzing trace with hash -10762417, now seen corresponding path program 1 times [2022-12-06 00:23:21,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:23:21,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287430294] [2022-12-06 00:23:21,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:23:21,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:23:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:23:22,007 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 00:23:22,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:23:22,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287430294] [2022-12-06 00:23:22,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287430294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:23:22,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:23:22,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:23:22,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056144228] [2022-12-06 00:23:22,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:23:22,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:23:22,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:23:22,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:23:22,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:23:22,008 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 73 [2022-12-06 00:23:22,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 616 transitions, 15309 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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 00:23:22,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:23:22,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 73 [2022-12-06 00:23:22,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:23:25,501 INFO L130 PetriNetUnfolder]: 10143/16026 cut-off events. [2022-12-06 00:23:25,501 INFO L131 PetriNetUnfolder]: For 472757/474129 co-relation queries the response was YES. [2022-12-06 00:23:25,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152752 conditions, 16026 events. 10143/16026 cut-off events. For 472757/474129 co-relation queries the response was YES. Maximal size of possible extension queue 1042. Compared 114042 event pairs, 3295 based on Foata normal form. 655/16488 useless extension candidates. Maximal degree in co-relation 151703. Up to 10935 conditions per place. [2022-12-06 00:23:25,685 INFO L137 encePairwiseOnDemand]: 51/73 looper letters, 784 selfloop transitions, 27 changer transitions 0/827 dead transitions. [2022-12-06 00:23:25,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 827 transitions, 21230 flow [2022-12-06 00:23:25,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:23:25,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:23:25,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2022-12-06 00:23:25,686 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36712328767123287 [2022-12-06 00:23:25,686 INFO L175 Difference]: Start difference. First operand has 239 places, 616 transitions, 15309 flow. Second operand 5 states and 134 transitions. [2022-12-06 00:23:25,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 827 transitions, 21230 flow [2022-12-06 00:23:27,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 827 transitions, 20756 flow, removed 236 selfloop flow, removed 1 redundant places. [2022-12-06 00:23:27,468 INFO L231 Difference]: Finished difference. Result has 244 places, 618 transitions, 15031 flow [2022-12-06 00:23:27,469 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=14909, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=15031, PETRI_PLACES=244, PETRI_TRANSITIONS=618} [2022-12-06 00:23:27,469 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 214 predicate places. [2022-12-06 00:23:27,469 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:23:27,469 INFO L89 Accepts]: Start accepts. Operand has 244 places, 618 transitions, 15031 flow [2022-12-06 00:23:27,471 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:23:27,472 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:23:27,472 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 618 transitions, 15031 flow [2022-12-06 00:23:27,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 244 places, 618 transitions, 15031 flow [2022-12-06 00:23:28,293 INFO L130 PetriNetUnfolder]: 2482/6094 cut-off events. [2022-12-06 00:23:28,294 INFO L131 PetriNetUnfolder]: For 133862/134615 co-relation queries the response was YES. [2022-12-06 00:23:28,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50308 conditions, 6094 events. 2482/6094 cut-off events. For 133862/134615 co-relation queries the response was YES. Maximal size of possible extension queue 713. Compared 61227 event pairs, 749 based on Foata normal form. 53/5712 useless extension candidates. Maximal degree in co-relation 50042. Up to 2321 conditions per place. [2022-12-06 00:23:28,404 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 244 places, 618 transitions, 15031 flow [2022-12-06 00:23:28,404 INFO L188 LiptonReduction]: Number of co-enabled transitions 3786 [2022-12-06 00:23:28,407 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:23:28,408 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 939 [2022-12-06 00:23:28,408 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 618 transitions, 15031 flow [2022-12-06 00:23:28,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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 00:23:28,408 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:23:28,408 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 00:23:28,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-06 00:23:28,409 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 00:23:28,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:23:28,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1400502564, now seen corresponding path program 1 times [2022-12-06 00:23:28,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:23:28,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635081864] [2022-12-06 00:23:28,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:23:28,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:23:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:23:28,476 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 00:23:28,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:23:28,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635081864] [2022-12-06 00:23:28,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635081864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:23:28,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:23:28,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:23:28,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916812465] [2022-12-06 00:23:28,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:23:28,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:23:28,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:23:28,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:23:28,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:23:28,477 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-06 00:23:28,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 618 transitions, 15031 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 00:23:28,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:23:28,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-06 00:23:28,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:23:32,270 INFO L130 PetriNetUnfolder]: 10891/16986 cut-off events. [2022-12-06 00:23:32,271 INFO L131 PetriNetUnfolder]: For 476401/476401 co-relation queries the response was YES. [2022-12-06 00:23:32,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160755 conditions, 16986 events. 10891/16986 cut-off events. For 476401/476401 co-relation queries the response was YES. Maximal size of possible extension queue 976. Compared 118205 event pairs, 2140 based on Foata normal form. 14/17000 useless extension candidates. Maximal degree in co-relation 159835. Up to 6561 conditions per place. [2022-12-06 00:23:32,500 INFO L137 encePairwiseOnDemand]: 58/72 looper letters, 820 selfloop transitions, 35 changer transitions 5/860 dead transitions. [2022-12-06 00:23:32,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 860 transitions, 21098 flow [2022-12-06 00:23:32,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:23:32,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:23:32,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-12-06 00:23:32,501 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2022-12-06 00:23:32,502 INFO L175 Difference]: Start difference. First operand has 244 places, 618 transitions, 15031 flow. Second operand 5 states and 129 transitions. [2022-12-06 00:23:32,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 860 transitions, 21098 flow [2022-12-06 00:23:34,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 860 transitions, 21079 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:23:34,281 INFO L231 Difference]: Finished difference. Result has 248 places, 627 transitions, 15249 flow [2022-12-06 00:23:34,281 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=14978, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=591, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=15249, PETRI_PLACES=248, PETRI_TRANSITIONS=627} [2022-12-06 00:23:34,282 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 218 predicate places. [2022-12-06 00:23:34,282 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:23:34,282 INFO L89 Accepts]: Start accepts. Operand has 248 places, 627 transitions, 15249 flow [2022-12-06 00:23:34,284 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:23:34,284 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:23:34,284 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 248 places, 627 transitions, 15249 flow [2022-12-06 00:23:34,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 627 transitions, 15249 flow [2022-12-06 00:23:35,082 INFO L130 PetriNetUnfolder]: 2490/6099 cut-off events. [2022-12-06 00:23:35,082 INFO L131 PetriNetUnfolder]: For 142160/142871 co-relation queries the response was YES. [2022-12-06 00:23:35,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51461 conditions, 6099 events. 2490/6099 cut-off events. For 142160/142871 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 60871 event pairs, 747 based on Foata normal form. 48/5703 useless extension candidates. Maximal degree in co-relation 51192. Up to 2322 conditions per place. [2022-12-06 00:23:35,324 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 248 places, 627 transitions, 15249 flow [2022-12-06 00:23:35,324 INFO L188 LiptonReduction]: Number of co-enabled transitions 3886 [2022-12-06 00:23:35,342 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:23:35,356 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1074 [2022-12-06 00:23:35,356 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 627 transitions, 15249 flow [2022-12-06 00:23:35,356 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 00:23:35,356 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:23:35,356 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 00:23:35,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-06 00:23:35,357 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 00:23:35,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:23:35,357 INFO L85 PathProgramCache]: Analyzing trace with hash 894334991, now seen corresponding path program 1 times [2022-12-06 00:23:35,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:23:35,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573228936] [2022-12-06 00:23:35,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:23:35,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:23:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:23:35,432 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 00:23:35,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:23:35,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573228936] [2022-12-06 00:23:35,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573228936] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:23:35,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090921450] [2022-12-06 00:23:35,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:23:35,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:23:35,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:23:35,449 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 00:23:35,450 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 00:23:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:23:35,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 00:23:35,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:23:35,614 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 00:23:35,614 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 00:23:35,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090921450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:23:35,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 00:23:35,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-12-06 00:23:35,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827416741] [2022-12-06 00:23:35,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:23:35,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:23:35,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:23:35,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:23:35,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:23:35,615 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-06 00:23:35,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 627 transitions, 15249 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 00:23:35,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:23:35,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-06 00:23:35,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:23:39,236 INFO L130 PetriNetUnfolder]: 9700/15557 cut-off events. [2022-12-06 00:23:39,236 INFO L131 PetriNetUnfolder]: For 462544/462544 co-relation queries the response was YES. [2022-12-06 00:23:39,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148651 conditions, 15557 events. 9700/15557 cut-off events. For 462544/462544 co-relation queries the response was YES. Maximal size of possible extension queue 944. Compared 111068 event pairs, 2564 based on Foata normal form. 793/16350 useless extension candidates. Maximal degree in co-relation 147588. Up to 5328 conditions per place. [2022-12-06 00:23:39,437 INFO L137 encePairwiseOnDemand]: 55/72 looper letters, 545 selfloop transitions, 139 changer transitions 14/698 dead transitions. [2022-12-06 00:23:39,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 698 transitions, 17857 flow [2022-12-06 00:23:39,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:23:39,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:23:39,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2022-12-06 00:23:39,439 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-06 00:23:39,439 INFO L175 Difference]: Start difference. First operand has 248 places, 627 transitions, 15249 flow. Second operand 5 states and 135 transitions. [2022-12-06 00:23:39,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 698 transitions, 17857 flow [2022-12-06 00:23:41,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 698 transitions, 17784 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:23:41,525 INFO L231 Difference]: Finished difference. Result has 251 places, 596 transitions, 15140 flow [2022-12-06 00:23:41,526 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=14356, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=15140, PETRI_PLACES=251, PETRI_TRANSITIONS=596} [2022-12-06 00:23:41,526 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 221 predicate places. [2022-12-06 00:23:41,526 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:23:41,526 INFO L89 Accepts]: Start accepts. Operand has 251 places, 596 transitions, 15140 flow [2022-12-06 00:23:41,528 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:23:41,528 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:23:41,529 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 251 places, 596 transitions, 15140 flow [2022-12-06 00:23:41,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 251 places, 596 transitions, 15140 flow [2022-12-06 00:23:42,358 INFO L130 PetriNetUnfolder]: 2232/5650 cut-off events. [2022-12-06 00:23:42,358 INFO L131 PetriNetUnfolder]: For 141482/142067 co-relation queries the response was YES. [2022-12-06 00:23:42,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48275 conditions, 5650 events. 2232/5650 cut-off events. For 141482/142067 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 57021 event pairs, 717 based on Foata normal form. 44/5274 useless extension candidates. Maximal degree in co-relation 48003. Up to 2231 conditions per place. [2022-12-06 00:23:42,472 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 251 places, 596 transitions, 15140 flow [2022-12-06 00:23:42,473 INFO L188 LiptonReduction]: Number of co-enabled transitions 3558 [2022-12-06 00:23:42,477 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:23:42,477 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 951 [2022-12-06 00:23:42,477 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 596 transitions, 15140 flow [2022-12-06 00:23:42,477 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 00:23:42,477 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:23:42,478 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 00:23:42,482 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 00:23:42,682 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,SelfDestructingSolverStorable56 [2022-12-06 00:23:42,682 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 00:23:42,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:23:42,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1630963525, now seen corresponding path program 3 times [2022-12-06 00:23:42,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:23:42,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470475658] [2022-12-06 00:23:42,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:23:42,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:23:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:23:42,721 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 00:23:42,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:23:42,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470475658] [2022-12-06 00:23:42,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470475658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:23:42,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:23:42,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:23:42,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634607091] [2022-12-06 00:23:42,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:23:42,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:23:42,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:23:42,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:23:42,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:23:42,723 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 69 [2022-12-06 00:23:42,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 596 transitions, 15140 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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 00:23:42,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:23:42,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 69 [2022-12-06 00:23:42,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:23:45,953 INFO L130 PetriNetUnfolder]: 8152/13586 cut-off events. [2022-12-06 00:23:45,953 INFO L131 PetriNetUnfolder]: For 462930/464010 co-relation queries the response was YES. [2022-12-06 00:23:46,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132653 conditions, 13586 events. 8152/13586 cut-off events. For 462930/464010 co-relation queries the response was YES. Maximal size of possible extension queue 916. Compared 101981 event pairs, 2516 based on Foata normal form. 1129/14529 useless extension candidates. Maximal degree in co-relation 131598. Up to 7517 conditions per place. [2022-12-06 00:23:46,106 INFO L137 encePairwiseOnDemand]: 46/69 looper letters, 651 selfloop transitions, 54 changer transitions 43/764 dead transitions. [2022-12-06 00:23:46,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 764 transitions, 20241 flow [2022-12-06 00:23:46,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:23:46,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:23:46,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2022-12-06 00:23:46,107 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3526570048309179 [2022-12-06 00:23:46,107 INFO L175 Difference]: Start difference. First operand has 251 places, 596 transitions, 15140 flow. Second operand 6 states and 146 transitions. [2022-12-06 00:23:46,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 764 transitions, 20241 flow [2022-12-06 00:23:47,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 764 transitions, 20127 flow, removed 41 selfloop flow, removed 2 redundant places. [2022-12-06 00:23:47,756 INFO L231 Difference]: Finished difference. Result has 256 places, 523 transitions, 13283 flow [2022-12-06 00:23:47,757 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=14391, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=13283, PETRI_PLACES=256, PETRI_TRANSITIONS=523} [2022-12-06 00:23:47,757 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 226 predicate places. [2022-12-06 00:23:47,757 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:23:47,758 INFO L89 Accepts]: Start accepts. Operand has 256 places, 523 transitions, 13283 flow [2022-12-06 00:23:47,760 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:23:47,760 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:23:47,760 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 256 places, 523 transitions, 13283 flow [2022-12-06 00:23:47,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 255 places, 523 transitions, 13283 flow [2022-12-06 00:23:48,432 INFO L130 PetriNetUnfolder]: 1967/5122 cut-off events. [2022-12-06 00:23:48,433 INFO L131 PetriNetUnfolder]: For 133914/134386 co-relation queries the response was YES. [2022-12-06 00:23:48,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44118 conditions, 5122 events. 1967/5122 cut-off events. For 133914/134386 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 51752 event pairs, 711 based on Foata normal form. 46/4777 useless extension candidates. Maximal degree in co-relation 43842. Up to 2145 conditions per place. [2022-12-06 00:23:48,538 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 255 places, 523 transitions, 13283 flow [2022-12-06 00:23:48,538 INFO L188 LiptonReduction]: Number of co-enabled transitions 3116 [2022-12-06 00:23:48,542 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [577] L56-5-->L48-5: Formula: (let ((.cse0 (select |v_#memory_int_296| v_~A~0.base_195))) (and (= v_~sum2~0_145 (+ (select .cse0 (+ (* v_thread2Thread1of1ForFork2_~i~1_115 4) v_~A~0.offset_195)) v_~sum2~0_146)) (< v_thread1Thread1of1ForFork1_~i~0_129 v_~N~0_181) (< v_thread2Thread1of1ForFork2_~i~1_115 v_~M~0_141) (= (+ v_thread2Thread1of1ForFork2_~i~1_115 1) v_thread2Thread1of1ForFork2_~i~1_114) (= v_thread1Thread1of1ForFork1_~i~0_128 (+ v_thread1Thread1of1ForFork1_~i~0_129 1)) (= (+ (select .cse0 (+ v_~A~0.offset_195 (* v_thread1Thread1of1ForFork1_~i~0_129 4))) v_~sum1~0_226) v_~sum1~0_225))) InVars {~A~0.base=v_~A~0.base_195, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_115, ~A~0.offset=v_~A~0.offset_195, ~sum1~0=v_~sum1~0_226, ~M~0=v_~M~0_141, #memory_int=|v_#memory_int_296|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_129, ~sum2~0=v_~sum2~0_146, ~N~0=v_~N~0_181} OutVars{~A~0.base=v_~A~0.base_195, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_128, ~sum2~0=v_~sum2~0_145, ~N~0=v_~N~0_181, thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_58|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_114, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_66|, ~A~0.offset=v_~A~0.offset_195, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_110|, ~sum1~0=v_~sum1~0_225, ~M~0=v_~M~0_141, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_102|, #memory_int=|v_#memory_int_296|} 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 [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 00:23:48,688 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [603] $Ultimate##0-->L56-5: Formula: (let ((.cse0 (select |v_#memory_int_375| v_~A~0.base_247))) (and (= v_~sum3~0_212 (+ (select .cse0 (+ (* v_thread3Thread1of1ForFork0_~i~2_245 4) v_~A~0.offset_247 (- 4))) v_~sum3~0_213)) (= v_~sum1~0_331 (+ (select .cse0 (+ v_~A~0.offset_247 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_196 4))) v_~sum1~0_332)) (= v_thread1Thread1of1ForFork1_~i~0_196 1) (< v_thread3Thread1of1ForFork0_~i~2_245 (+ v_~N~0_231 1)) (= v_~sum2~0_191 (+ v_~sum2~0_192 (select .cse0 v_~A~0.offset_247))) (= (+ v_~M~0_189 1) v_thread3Thread1of1ForFork0_~i~2_245) (= v_thread2Thread1of1ForFork2_~i~1_179 1) (< 0 v_~M~0_189))) InVars {~A~0.base=v_~A~0.base_247, ~A~0.offset=v_~A~0.offset_247, ~M~0=v_~M~0_189, ~sum1~0=v_~sum1~0_332, #memory_int=|v_#memory_int_375|, ~sum3~0=v_~sum3~0_213, ~sum2~0=v_~sum2~0_192, ~N~0=v_~N~0_231} OutVars{~A~0.base=v_~A~0.base_247, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_245, ~sum3~0=v_~sum3~0_212, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_196, ~sum2~0=v_~sum2~0_191, ~N~0=v_~N~0_231, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_121|, thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_89|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_179, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_97|, ~A~0.offset=v_~A~0.offset_247, ~M~0=v_~M~0_189, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_174|, ~sum1~0=v_~sum1~0_331, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_166|, #memory_int=|v_#memory_int_375|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_119|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread1Thread1of1ForFork1_~i~0, ~sum2~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5] 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 00:23:48,772 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [603] $Ultimate##0-->L56-5: Formula: (let ((.cse0 (select |v_#memory_int_375| v_~A~0.base_247))) (and (= v_~sum3~0_212 (+ (select .cse0 (+ (* v_thread3Thread1of1ForFork0_~i~2_245 4) v_~A~0.offset_247 (- 4))) v_~sum3~0_213)) (= v_~sum1~0_331 (+ (select .cse0 (+ v_~A~0.offset_247 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_196 4))) v_~sum1~0_332)) (= v_thread1Thread1of1ForFork1_~i~0_196 1) (< v_thread3Thread1of1ForFork0_~i~2_245 (+ v_~N~0_231 1)) (= v_~sum2~0_191 (+ v_~sum2~0_192 (select .cse0 v_~A~0.offset_247))) (= (+ v_~M~0_189 1) v_thread3Thread1of1ForFork0_~i~2_245) (= v_thread2Thread1of1ForFork2_~i~1_179 1) (< 0 v_~M~0_189))) InVars {~A~0.base=v_~A~0.base_247, ~A~0.offset=v_~A~0.offset_247, ~M~0=v_~M~0_189, ~sum1~0=v_~sum1~0_332, #memory_int=|v_#memory_int_375|, ~sum3~0=v_~sum3~0_213, ~sum2~0=v_~sum2~0_192, ~N~0=v_~N~0_231} OutVars{~A~0.base=v_~A~0.base_247, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_245, ~sum3~0=v_~sum3~0_212, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_196, ~sum2~0=v_~sum2~0_191, ~N~0=v_~N~0_231, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_121|, thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_89|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_179, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_97|, ~A~0.offset=v_~A~0.offset_247, ~M~0=v_~M~0_189, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_174|, ~sum1~0=v_~sum1~0_331, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_166|, #memory_int=|v_#memory_int_375|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_119|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread1Thread1of1ForFork1_~i~0, ~sum2~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5] 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 00:23:48,859 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] $Ultimate##0-->L64-5: Formula: (let ((.cse0 (select |v_#memory_int_377| v_~A~0.base_249)) (.cse2 (+ v_~N~0_233 1))) (and (= v_thread1Thread1of1ForFork1_~i~0_198 1) (= v_~sum3~0_216 (let ((.cse1 (* v_thread3Thread1of1ForFork0_~i~2_247 4))) (+ (select .cse0 (+ v_~A~0.offset_249 (- 4) .cse1)) (select .cse0 (+ v_~A~0.offset_249 .cse1 (- 8))) v_~sum3~0_218))) (= (+ v_~M~0_191 2) v_thread3Thread1of1ForFork0_~i~2_247) (= v_~sum1~0_335 (+ v_~sum1~0_336 (select .cse0 (+ v_~A~0.offset_249 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_198 4))))) (< v_thread1Thread1of1ForFork1_~i~0_198 .cse2) (< v_thread3Thread1of1ForFork0_~i~2_247 .cse2))) InVars {~A~0.base=v_~A~0.base_249, ~A~0.offset=v_~A~0.offset_249, ~M~0=v_~M~0_191, ~sum1~0=v_~sum1~0_336, #memory_int=|v_#memory_int_377|, ~sum3~0=v_~sum3~0_218, ~N~0=v_~N~0_233} OutVars{~A~0.base=v_~A~0.base_249, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_247, ~sum3~0=v_~sum3~0_216, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_198, ~N~0=v_~N~0_233, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_123|, ~A~0.offset=v_~A~0.offset_249, ~M~0=v_~M~0_191, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_176|, ~sum1~0=v_~sum1~0_335, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_168|, #memory_int=|v_#memory_int_377|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_121|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5] 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 00:23:48,927 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] $Ultimate##0-->L64-5: Formula: (let ((.cse0 (select |v_#memory_int_377| v_~A~0.base_249)) (.cse2 (+ v_~N~0_233 1))) (and (= v_thread1Thread1of1ForFork1_~i~0_198 1) (= v_~sum3~0_216 (let ((.cse1 (* v_thread3Thread1of1ForFork0_~i~2_247 4))) (+ (select .cse0 (+ v_~A~0.offset_249 (- 4) .cse1)) (select .cse0 (+ v_~A~0.offset_249 .cse1 (- 8))) v_~sum3~0_218))) (= (+ v_~M~0_191 2) v_thread3Thread1of1ForFork0_~i~2_247) (= v_~sum1~0_335 (+ v_~sum1~0_336 (select .cse0 (+ v_~A~0.offset_249 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_198 4))))) (< v_thread1Thread1of1ForFork1_~i~0_198 .cse2) (< v_thread3Thread1of1ForFork0_~i~2_247 .cse2))) InVars {~A~0.base=v_~A~0.base_249, ~A~0.offset=v_~A~0.offset_249, ~M~0=v_~M~0_191, ~sum1~0=v_~sum1~0_336, #memory_int=|v_#memory_int_377|, ~sum3~0=v_~sum3~0_218, ~N~0=v_~N~0_233} OutVars{~A~0.base=v_~A~0.base_249, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_247, ~sum3~0=v_~sum3~0_216, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_198, ~N~0=v_~N~0_233, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_123|, ~A~0.offset=v_~A~0.offset_249, ~M~0=v_~M~0_191, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_176|, ~sum1~0=v_~sum1~0_335, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_168|, #memory_int=|v_#memory_int_377|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_121|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_~i~2, ~sum3~0, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5] 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 00:23:49,002 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:23:49,002 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1245 [2022-12-06 00:23:49,002 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 523 transitions, 13517 flow [2022-12-06 00:23:49,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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 00:23:49,002 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:23:49,002 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 00:23:49,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-06 00:23:49,003 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 00:23:49,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:23:49,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1308155873, now seen corresponding path program 1 times [2022-12-06 00:23:49,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:23:49,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059498798] [2022-12-06 00:23:49,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:23:49,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:23:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:23:49,036 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 00:23:49,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:23:49,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059498798] [2022-12-06 00:23:49,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059498798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:23:49,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:23:49,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:23:49,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609036413] [2022-12-06 00:23:49,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:23:49,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:23:49,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:23:49,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:23:49,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:23:49,038 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-06 00:23:49,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 523 transitions, 13517 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 00:23:49,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:23:49,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-06 00:23:49,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:23:52,238 INFO L130 PetriNetUnfolder]: 8521/13835 cut-off events. [2022-12-06 00:23:52,238 INFO L131 PetriNetUnfolder]: For 453170/453170 co-relation queries the response was YES. [2022-12-06 00:23:52,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135520 conditions, 13835 events. 8521/13835 cut-off events. For 453170/453170 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 98316 event pairs, 4087 based on Foata normal form. 26/13861 useless extension candidates. Maximal degree in co-relation 135250. Up to 8230 conditions per place. [2022-12-06 00:23:52,500 INFO L137 encePairwiseOnDemand]: 56/72 looper letters, 558 selfloop transitions, 19 changer transitions 8/585 dead transitions. [2022-12-06 00:23:52,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 585 transitions, 15393 flow [2022-12-06 00:23:52,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:23:52,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:23:52,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-12-06 00:23:52,501 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2022-12-06 00:23:52,501 INFO L175 Difference]: Start difference. First operand has 255 places, 523 transitions, 13517 flow. Second operand 5 states and 129 transitions. [2022-12-06 00:23:52,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 585 transitions, 15393 flow [2022-12-06 00:23:54,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 585 transitions, 15148 flow, removed 49 selfloop flow, removed 10 redundant places. [2022-12-06 00:23:54,545 INFO L231 Difference]: Finished difference. Result has 249 places, 506 transitions, 12759 flow [2022-12-06 00:23:54,545 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=12861, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=12759, PETRI_PLACES=249, PETRI_TRANSITIONS=506} [2022-12-06 00:23:54,545 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 219 predicate places. [2022-12-06 00:23:54,545 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:23:54,546 INFO L89 Accepts]: Start accepts. Operand has 249 places, 506 transitions, 12759 flow [2022-12-06 00:23:54,548 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:23:54,548 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:23:54,548 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 249 places, 506 transitions, 12759 flow [2022-12-06 00:23:54,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 244 places, 506 transitions, 12759 flow [2022-12-06 00:23:55,310 INFO L130 PetriNetUnfolder]: 1940/5042 cut-off events. [2022-12-06 00:23:55,310 INFO L131 PetriNetUnfolder]: For 124671/125121 co-relation queries the response was YES. [2022-12-06 00:23:55,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43214 conditions, 5042 events. 1940/5042 cut-off events. For 124671/125121 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 50702 event pairs, 708 based on Foata normal form. 43/4705 useless extension candidates. Maximal degree in co-relation 42943. Up to 2134 conditions per place. [2022-12-06 00:23:55,398 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 244 places, 506 transitions, 12759 flow [2022-12-06 00:23:55,399 INFO L188 LiptonReduction]: Number of co-enabled transitions 3036 [2022-12-06 00:23:55,402 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:23:55,403 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 858 [2022-12-06 00:23:55,403 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 506 transitions, 12759 flow [2022-12-06 00:23:55,403 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 00:23:55,403 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:23:55,403 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 00:23:55,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-06 00:23:55,404 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 00:23:55,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:23:55,404 INFO L85 PathProgramCache]: Analyzing trace with hash 302763311, now seen corresponding path program 1 times [2022-12-06 00:23:55,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:23:55,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240273272] [2022-12-06 00:23:55,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:23:55,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:23:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:23:55,637 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 00:23:55,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:23:55,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240273272] [2022-12-06 00:23:55,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240273272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:23:55,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:23:55,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:23:55,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737570189] [2022-12-06 00:23:55,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:23:55,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:23:55,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:23:55,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:23:55,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:23:55,638 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-06 00:23:55,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 506 transitions, 12759 flow. Second operand has 6 states, 5 states have (on average 3.6) 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 00:23:55,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:23:55,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-06 00:23:55,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:23:58,833 INFO L130 PetriNetUnfolder]: 8477/13738 cut-off events. [2022-12-06 00:23:58,833 INFO L131 PetriNetUnfolder]: For 418968/418968 co-relation queries the response was YES. [2022-12-06 00:23:58,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134089 conditions, 13738 events. 8477/13738 cut-off events. For 418968/418968 co-relation queries the response was YES. Maximal size of possible extension queue 878. Compared 97012 event pairs, 4177 based on Foata normal form. 1/13739 useless extension candidates. Maximal degree in co-relation 133020. Up to 13428 conditions per place. [2022-12-06 00:23:59,012 INFO L137 encePairwiseOnDemand]: 26/66 looper letters, 452 selfloop transitions, 109 changer transitions 1/562 dead transitions. [2022-12-06 00:23:59,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 562 transitions, 14582 flow [2022-12-06 00:23:59,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:23:59,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:23:59,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2022-12-06 00:23:59,013 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2777777777777778 [2022-12-06 00:23:59,013 INFO L175 Difference]: Start difference. First operand has 244 places, 506 transitions, 12759 flow. Second operand 6 states and 110 transitions. [2022-12-06 00:23:59,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 562 transitions, 14582 flow [2022-12-06 00:24:00,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 562 transitions, 14537 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 00:24:00,745 INFO L231 Difference]: Finished difference. Result has 248 places, 509 transitions, 13119 flow [2022-12-06 00:24:00,745 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=12717, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=13119, PETRI_PLACES=248, PETRI_TRANSITIONS=509} [2022-12-06 00:24:00,746 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 218 predicate places. [2022-12-06 00:24:00,746 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:24:00,746 INFO L89 Accepts]: Start accepts. Operand has 248 places, 509 transitions, 13119 flow [2022-12-06 00:24:00,748 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:24:00,748 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:24:00,748 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 248 places, 509 transitions, 13119 flow [2022-12-06 00:24:00,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 509 transitions, 13119 flow [2022-12-06 00:24:01,517 INFO L130 PetriNetUnfolder]: 1946/5006 cut-off events. [2022-12-06 00:24:01,517 INFO L131 PetriNetUnfolder]: For 123978/124427 co-relation queries the response was YES. [2022-12-06 00:24:01,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43631 conditions, 5006 events. 1946/5006 cut-off events. For 123978/124427 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 50031 event pairs, 711 based on Foata normal form. 55/4679 useless extension candidates. Maximal degree in co-relation 43357. Up to 2125 conditions per place. [2022-12-06 00:24:01,615 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 248 places, 509 transitions, 13119 flow [2022-12-06 00:24:01,615 INFO L188 LiptonReduction]: Number of co-enabled transitions 3060 [2022-12-06 00:24:01,625 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 00:24:01,681 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [605] $Ultimate##0-->L48-5: Formula: (let ((.cse0 (select |v_#memory_int_379| v_~A~0.base_251))) (and (= v_thread3Thread1of1ForFork0_~i~2_251 (+ v_~M~0_193 1)) (< v_thread3Thread1of1ForFork0_~i~2_251 (+ v_~N~0_235 1)) (= v_~sum1~0_339 (+ v_~sum1~0_341 (select .cse0 (+ v_~A~0.offset_251 4)) (select .cse0 v_~A~0.offset_251))) (< 1 v_~N~0_235) (= 2 v_thread1Thread1of1ForFork1_~i~0_200) (= (+ v_~sum3~0_223 (select .cse0 (+ v_~A~0.offset_251 (- 4) (* v_thread3Thread1of1ForFork0_~i~2_251 4)))) v_~sum3~0_222))) InVars {~A~0.base=v_~A~0.base_251, ~A~0.offset=v_~A~0.offset_251, ~sum1~0=v_~sum1~0_341, ~M~0=v_~M~0_193, #memory_int=|v_#memory_int_379|, ~sum3~0=v_~sum3~0_223, ~N~0=v_~N~0_235} OutVars{~A~0.base=v_~A~0.base_251, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_251, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_200, ~sum3~0=v_~sum3~0_222, ~N~0=v_~N~0_235, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_127|, ~A~0.offset=v_~A~0.offset_251, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_178|, ~sum1~0=v_~sum1~0_339, ~M~0=v_~M~0_193, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_170|, #memory_int=|v_#memory_int_379|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_125|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_~i~2, thread1Thread1of1ForFork1_~i~0, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5] 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 00:24:01,752 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [605] $Ultimate##0-->L48-5: Formula: (let ((.cse0 (select |v_#memory_int_379| v_~A~0.base_251))) (and (= v_thread3Thread1of1ForFork0_~i~2_251 (+ v_~M~0_193 1)) (< v_thread3Thread1of1ForFork0_~i~2_251 (+ v_~N~0_235 1)) (= v_~sum1~0_339 (+ v_~sum1~0_341 (select .cse0 (+ v_~A~0.offset_251 4)) (select .cse0 v_~A~0.offset_251))) (< 1 v_~N~0_235) (= 2 v_thread1Thread1of1ForFork1_~i~0_200) (= (+ v_~sum3~0_223 (select .cse0 (+ v_~A~0.offset_251 (- 4) (* v_thread3Thread1of1ForFork0_~i~2_251 4)))) v_~sum3~0_222))) InVars {~A~0.base=v_~A~0.base_251, ~A~0.offset=v_~A~0.offset_251, ~sum1~0=v_~sum1~0_341, ~M~0=v_~M~0_193, #memory_int=|v_#memory_int_379|, ~sum3~0=v_~sum3~0_223, ~N~0=v_~N~0_235} OutVars{~A~0.base=v_~A~0.base_251, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_251, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_200, ~sum3~0=v_~sum3~0_222, ~N~0=v_~N~0_235, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_127|, ~A~0.offset=v_~A~0.offset_251, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_178|, ~sum1~0=v_~sum1~0_339, ~M~0=v_~M~0_193, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_170|, #memory_int=|v_#memory_int_379|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_125|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_~i~2, thread1Thread1of1ForFork1_~i~0, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5] 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 00:24:01,825 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [605] $Ultimate##0-->L48-5: Formula: (let ((.cse0 (select |v_#memory_int_379| v_~A~0.base_251))) (and (= v_thread3Thread1of1ForFork0_~i~2_251 (+ v_~M~0_193 1)) (< v_thread3Thread1of1ForFork0_~i~2_251 (+ v_~N~0_235 1)) (= v_~sum1~0_339 (+ v_~sum1~0_341 (select .cse0 (+ v_~A~0.offset_251 4)) (select .cse0 v_~A~0.offset_251))) (< 1 v_~N~0_235) (= 2 v_thread1Thread1of1ForFork1_~i~0_200) (= (+ v_~sum3~0_223 (select .cse0 (+ v_~A~0.offset_251 (- 4) (* v_thread3Thread1of1ForFork0_~i~2_251 4)))) v_~sum3~0_222))) InVars {~A~0.base=v_~A~0.base_251, ~A~0.offset=v_~A~0.offset_251, ~sum1~0=v_~sum1~0_341, ~M~0=v_~M~0_193, #memory_int=|v_#memory_int_379|, ~sum3~0=v_~sum3~0_223, ~N~0=v_~N~0_235} OutVars{~A~0.base=v_~A~0.base_251, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_251, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_200, ~sum3~0=v_~sum3~0_222, ~N~0=v_~N~0_235, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_127|, ~A~0.offset=v_~A~0.offset_251, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_178|, ~sum1~0=v_~sum1~0_339, ~M~0=v_~M~0_193, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_170|, #memory_int=|v_#memory_int_379|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_125|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_~i~2, thread1Thread1of1ForFork1_~i~0, ~sum3~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5] and [623] L64-5-->L56-5: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_215 1) (not (< v_thread3Thread1of1ForFork0_~i~2_297 v_~N~0_271)) (< 0 v_~M~0_219) (= 0 |v_thread3Thread1of1ForFork0_#res.base_77|) (= |v_thread3Thread1of1ForFork0_#res.offset_77| 0) (= v_~sum2~0_227 (+ (select (select |v_#memory_int_422| v_~A~0.base_287) v_~A~0.offset_287) v_~sum2~0_228))) InVars {~A~0.base=v_~A~0.base_287, ~A~0.offset=v_~A~0.offset_287, ~M~0=v_~M~0_219, #memory_int=|v_#memory_int_422|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_297, ~sum2~0=v_~sum2~0_228, ~N~0=v_~N~0_271} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_111|, ~A~0.base=v_~A~0.base_287, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_215, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_119|, ~A~0.offset=v_~A~0.offset_287, ~M~0=v_~M~0_219, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_77|, #memory_int=|v_#memory_int_422|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_297, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_77|, ~sum2~0=v_~sum2~0_227, ~N~0=v_~N~0_271} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base, ~sum2~0] [2022-12-06 00:24:01,975 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:24:01,976 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1230 [2022-12-06 00:24:01,976 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 508 transitions, 13215 flow [2022-12-06 00:24:01,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) 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 00:24:01,976 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:24:01,976 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 00:24:01,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-12-06 00:24:01,976 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 00:24:01,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:24:01,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1489137960, now seen corresponding path program 1 times [2022-12-06 00:24:01,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:24:01,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722469964] [2022-12-06 00:24:01,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:24:01,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:24:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:24:02,041 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 00:24:02,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:24:02,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722469964] [2022-12-06 00:24:02,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722469964] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:24:02,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:24:02,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:24:02,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518909749] [2022-12-06 00:24:02,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:24:02,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:24:02,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:24:02,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:24:02,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:24:02,050 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-06 00:24:02,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 508 transitions, 13215 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 00:24:02,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:24:02,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-06 00:24:02,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:24:05,129 INFO L130 PetriNetUnfolder]: 8455/13724 cut-off events. [2022-12-06 00:24:05,129 INFO L131 PetriNetUnfolder]: For 426469/426469 co-relation queries the response was YES. [2022-12-06 00:24:05,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134319 conditions, 13724 events. 8455/13724 cut-off events. For 426469/426469 co-relation queries the response was YES. Maximal size of possible extension queue 837. Compared 97274 event pairs, 4240 based on Foata normal form. 62/13786 useless extension candidates. Maximal degree in co-relation 133245. Up to 8499 conditions per place. [2022-12-06 00:24:05,288 INFO L137 encePairwiseOnDemand]: 63/69 looper letters, 545 selfloop transitions, 3 changer transitions 4/552 dead transitions. [2022-12-06 00:24:05,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 552 transitions, 14852 flow [2022-12-06 00:24:05,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:24:05,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:24:05,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-12-06 00:24:05,289 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4057971014492754 [2022-12-06 00:24:05,289 INFO L175 Difference]: Start difference. First operand has 247 places, 508 transitions, 13215 flow. Second operand 4 states and 112 transitions. [2022-12-06 00:24:05,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 552 transitions, 14852 flow [2022-12-06 00:24:07,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 552 transitions, 14684 flow, removed 23 selfloop flow, removed 2 redundant places. [2022-12-06 00:24:07,075 INFO L231 Difference]: Finished difference. Result has 249 places, 499 transitions, 12743 flow [2022-12-06 00:24:07,076 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=12898, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=500, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=12743, PETRI_PLACES=249, PETRI_TRANSITIONS=499} [2022-12-06 00:24:07,076 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 219 predicate places. [2022-12-06 00:24:07,076 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:24:07,076 INFO L89 Accepts]: Start accepts. Operand has 249 places, 499 transitions, 12743 flow [2022-12-06 00:24:07,078 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:24:07,078 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:24:07,079 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 249 places, 499 transitions, 12743 flow [2022-12-06 00:24:07,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 499 transitions, 12743 flow [2022-12-06 00:24:07,875 INFO L130 PetriNetUnfolder]: 1932/5006 cut-off events. [2022-12-06 00:24:07,875 INFO L131 PetriNetUnfolder]: For 123204/123685 co-relation queries the response was YES. [2022-12-06 00:24:07,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43242 conditions, 5006 events. 1932/5006 cut-off events. For 123204/123685 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 50172 event pairs, 697 based on Foata normal form. 45/4680 useless extension candidates. Maximal degree in co-relation 42969. Up to 2105 conditions per place. [2022-12-06 00:24:07,984 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 248 places, 499 transitions, 12743 flow [2022-12-06 00:24:07,984 INFO L188 LiptonReduction]: Number of co-enabled transitions 2982 [2022-12-06 00:24:07,994 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [620] $Ultimate##0-->L48-5: Formula: (let ((.cse1 (select |v_#memory_int_416| v_~A~0.base_281))) (let ((.cse0 (select .cse1 v_~A~0.offset_281))) (and (= v_~sum1~0_421 (+ v_~sum1~0_423 .cse0 (select .cse1 (+ v_~A~0.offset_281 4)))) (= (+ v_~sum3~0_269 (select .cse1 (+ v_~A~0.offset_281 (- 4) (* v_thread3Thread1of1ForFork0_~i~2_291 4)))) v_~sum3~0_268) (= v_thread2Thread1of1ForFork2_~i~1_211 1) (< v_thread3Thread1of1ForFork0_~i~2_291 (+ v_~N~0_265 1)) (= (+ .cse0 v_~sum2~0_220) v_~sum2~0_219) (= v_thread3Thread1of1ForFork0_~i~2_291 (+ v_~M~0_213 1)) (= 2 v_thread1Thread1of1ForFork1_~i~0_262) (< 0 v_~M~0_213)))) InVars {~A~0.base=v_~A~0.base_281, ~A~0.offset=v_~A~0.offset_281, ~sum1~0=v_~sum1~0_423, ~M~0=v_~M~0_213, #memory_int=|v_#memory_int_416|, ~sum3~0=v_~sum3~0_269, ~sum2~0=v_~sum2~0_220, ~N~0=v_~N~0_265} OutVars{~A~0.base=v_~A~0.base_281, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_291, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_262, ~sum3~0=v_~sum3~0_268, ~sum2~0=v_~sum2~0_219, ~N~0=v_~N~0_265, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_155|, thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_107|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_211, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_115|, ~A~0.offset=v_~A~0.offset_281, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_228|, ~sum1~0=v_~sum1~0_421, ~M~0=v_~M~0_213, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_220|, #memory_int=|v_#memory_int_416|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_153|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_~i~2, thread1Thread1of1ForFork1_~i~0, ~sum3~0, ~sum2~0, thread3Thread1of1ForFork0_#t~mem6, thread3Thread1of1ForFork0_#t~post5] 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 00:24:08,081 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:24:08,082 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1006 [2022-12-06 00:24:08,082 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 498 transitions, 12733 flow [2022-12-06 00:24:08,082 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 00:24:08,082 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:24:08,082 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 00:24:08,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-12-06 00:24:08,082 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 00:24:08,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:24:08,083 INFO L85 PathProgramCache]: Analyzing trace with hash 2116915678, now seen corresponding path program 1 times [2022-12-06 00:24:08,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:24:08,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635122760] [2022-12-06 00:24:08,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:24:08,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:24:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:24:08,434 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 00:24:08,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:24:08,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635122760] [2022-12-06 00:24:08,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635122760] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:24:08,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:24:08,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:24:08,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679408678] [2022-12-06 00:24:08,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:24:08,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:24:08,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:24:08,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:24:08,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:24:08,436 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 67 [2022-12-06 00:24:08,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 498 transitions, 12733 flow. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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 00:24:08,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:24:08,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 67 [2022-12-06 00:24:08,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:24:11,426 INFO L130 PetriNetUnfolder]: 8391/13592 cut-off events. [2022-12-06 00:24:11,427 INFO L131 PetriNetUnfolder]: For 408791/408791 co-relation queries the response was YES. [2022-12-06 00:24:11,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133057 conditions, 13592 events. 8391/13592 cut-off events. For 408791/408791 co-relation queries the response was YES. Maximal size of possible extension queue 853. Compared 95695 event pairs, 4169 based on Foata normal form. 1/13593 useless extension candidates. Maximal degree in co-relation 131986. Up to 13323 conditions per place. [2022-12-06 00:24:11,621 INFO L137 encePairwiseOnDemand]: 27/67 looper letters, 437 selfloop transitions, 104 changer transitions 8/549 dead transitions. [2022-12-06 00:24:11,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 549 transitions, 14477 flow [2022-12-06 00:24:11,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:24:11,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:24:11,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2022-12-06 00:24:11,625 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31343283582089554 [2022-12-06 00:24:11,625 INFO L175 Difference]: Start difference. First operand has 247 places, 498 transitions, 12733 flow. Second operand 5 states and 105 transitions. [2022-12-06 00:24:11,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 549 transitions, 14477 flow [2022-12-06 00:24:13,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 549 transitions, 14285 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-12-06 00:24:13,210 INFO L231 Difference]: Finished difference. Result has 248 places, 499 transitions, 12860 flow [2022-12-06 00:24:13,210 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=12543, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=12860, PETRI_PLACES=248, PETRI_TRANSITIONS=499} [2022-12-06 00:24:13,210 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 218 predicate places. [2022-12-06 00:24:13,210 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:24:13,211 INFO L89 Accepts]: Start accepts. Operand has 248 places, 499 transitions, 12860 flow [2022-12-06 00:24:13,212 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:24:13,212 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:24:13,212 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 248 places, 499 transitions, 12860 flow [2022-12-06 00:24:13,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 499 transitions, 12860 flow [2022-12-06 00:24:13,847 INFO L130 PetriNetUnfolder]: 1931/4958 cut-off events. [2022-12-06 00:24:13,847 INFO L131 PetriNetUnfolder]: For 122426/122881 co-relation queries the response was YES. [2022-12-06 00:24:13,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43188 conditions, 4958 events. 1931/4958 cut-off events. For 122426/122881 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 49305 event pairs, 702 based on Foata normal form. 54/4638 useless extension candidates. Maximal degree in co-relation 42909. Up to 2091 conditions per place. [2022-12-06 00:24:13,954 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 248 places, 499 transitions, 12860 flow [2022-12-06 00:24:13,954 INFO L188 LiptonReduction]: Number of co-enabled transitions 2982 [2022-12-06 00:24:13,959 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:24:13,959 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 749 [2022-12-06 00:24:13,959 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 499 transitions, 12860 flow [2022-12-06 00:24:13,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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 00:24:13,959 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:24:13,959 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 00:24:13,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-12-06 00:24:13,960 INFO L420 AbstractCegarLoop]: === Iteration 63 === 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 00:24:13,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:24:13,960 INFO L85 PathProgramCache]: Analyzing trace with hash -586902770, now seen corresponding path program 1 times [2022-12-06 00:24:13,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:24:13,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566381359] [2022-12-06 00:24:13,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:24:13,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:24:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:24:13,990 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 00:24:13,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:24:13,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566381359] [2022-12-06 00:24:13,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566381359] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:24:13,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:24:13,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:24:13,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536659606] [2022-12-06 00:24:13,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:24:13,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:24:13,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:24:13,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:24:13,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:24:13,992 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 67 [2022-12-06 00:24:13,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 499 transitions, 12860 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 00:24:13,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:24:13,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 67 [2022-12-06 00:24:13,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:24:16,797 INFO L130 PetriNetUnfolder]: 7645/12613 cut-off events. [2022-12-06 00:24:16,797 INFO L131 PetriNetUnfolder]: For 396272/397338 co-relation queries the response was YES. [2022-12-06 00:24:16,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125098 conditions, 12613 events. 7645/12613 cut-off events. For 396272/397338 co-relation queries the response was YES. Maximal size of possible extension queue 860. Compared 92053 event pairs, 3856 based on Foata normal form. 582/12988 useless extension candidates. Maximal degree in co-relation 124189. Up to 7859 conditions per place. [2022-12-06 00:24:16,967 INFO L137 encePairwiseOnDemand]: 65/67 looper letters, 518 selfloop transitions, 1 changer transitions 0/535 dead transitions. [2022-12-06 00:24:16,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 535 transitions, 14388 flow [2022-12-06 00:24:16,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:24:16,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:24:16,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2022-12-06 00:24:16,968 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48756218905472637 [2022-12-06 00:24:16,968 INFO L175 Difference]: Start difference. First operand has 248 places, 499 transitions, 12860 flow. Second operand 3 states and 98 transitions. [2022-12-06 00:24:16,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 535 transitions, 14388 flow [2022-12-06 00:24:18,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 535 transitions, 14097 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-06 00:24:18,328 INFO L231 Difference]: Finished difference. Result has 246 places, 498 transitions, 12517 flow [2022-12-06 00:24:18,329 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=12515, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=12517, PETRI_PLACES=246, PETRI_TRANSITIONS=498} [2022-12-06 00:24:18,329 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 216 predicate places. [2022-12-06 00:24:18,329 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:24:18,329 INFO L89 Accepts]: Start accepts. Operand has 246 places, 498 transitions, 12517 flow [2022-12-06 00:24:18,331 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:24:18,331 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:24:18,333 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 246 places, 498 transitions, 12517 flow [2022-12-06 00:24:18,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 246 places, 498 transitions, 12517 flow [2022-12-06 00:24:19,078 INFO L130 PetriNetUnfolder]: 1916/4959 cut-off events. [2022-12-06 00:24:19,078 INFO L131 PetriNetUnfolder]: For 118389/118861 co-relation queries the response was YES. [2022-12-06 00:24:19,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42463 conditions, 4959 events. 1916/4959 cut-off events. For 118389/118861 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 49579 event pairs, 700 based on Foata normal form. 44/4643 useless extension candidates. Maximal degree in co-relation 42225. Up to 2110 conditions per place. [2022-12-06 00:24:19,156 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 246 places, 498 transitions, 12517 flow [2022-12-06 00:24:19,156 INFO L188 LiptonReduction]: Number of co-enabled transitions 2980 [2022-12-06 00:24:19,159 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:24:19,159 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 830 [2022-12-06 00:24:19,160 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 498 transitions, 12517 flow [2022-12-06 00:24:19,160 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 00:24:19,160 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:24:19,160 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 00:24:19,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-12-06 00:24:19,160 INFO L420 AbstractCegarLoop]: === Iteration 64 === 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 00:24:19,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:24:19,160 INFO L85 PathProgramCache]: Analyzing trace with hash 531260263, now seen corresponding path program 3 times [2022-12-06 00:24:19,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:24:19,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334576049] [2022-12-06 00:24:19,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:24:19,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:24:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:24:19,210 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 00:24:19,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:24:19,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334576049] [2022-12-06 00:24:19,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334576049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:24:19,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:24:19,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:24:19,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62206674] [2022-12-06 00:24:19,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:24:19,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:24:19,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:24:19,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:24:19,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:24:19,211 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-06 00:24:19,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 498 transitions, 12517 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 00:24:19,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:24:19,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-06 00:24:19,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:24:22,141 INFO L130 PetriNetUnfolder]: 8175/13127 cut-off events. [2022-12-06 00:24:22,141 INFO L131 PetriNetUnfolder]: For 391050/391050 co-relation queries the response was YES. [2022-12-06 00:24:22,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129003 conditions, 13127 events. 8175/13127 cut-off events. For 391050/391050 co-relation queries the response was YES. Maximal size of possible extension queue 814. Compared 91039 event pairs, 2602 based on Foata normal form. 132/13259 useless extension candidates. Maximal degree in co-relation 128111. Up to 7987 conditions per place. [2022-12-06 00:24:22,313 INFO L137 encePairwiseOnDemand]: 43/66 looper letters, 298 selfloop transitions, 272 changer transitions 11/581 dead transitions. [2022-12-06 00:24:22,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 581 transitions, 15140 flow [2022-12-06 00:24:22,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:24:22,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:24:22,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2022-12-06 00:24:22,314 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2601010101010101 [2022-12-06 00:24:22,314 INFO L175 Difference]: Start difference. First operand has 246 places, 498 transitions, 12517 flow. Second operand 6 states and 103 transitions. [2022-12-06 00:24:22,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 581 transitions, 15140 flow [2022-12-06 00:24:23,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 581 transitions, 15095 flow, removed 22 selfloop flow, removed 1 redundant places. [2022-12-06 00:24:23,814 INFO L231 Difference]: Finished difference. Result has 252 places, 495 transitions, 13178 flow [2022-12-06 00:24:23,815 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=12472, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=267, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=13178, PETRI_PLACES=252, PETRI_TRANSITIONS=495} [2022-12-06 00:24:23,817 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 222 predicate places. [2022-12-06 00:24:23,818 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:24:23,818 INFO L89 Accepts]: Start accepts. Operand has 252 places, 495 transitions, 13178 flow [2022-12-06 00:24:23,820 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:24:23,820 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:24:23,820 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 252 places, 495 transitions, 13178 flow [2022-12-06 00:24:23,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 252 places, 495 transitions, 13178 flow [2022-12-06 00:24:24,521 INFO L130 PetriNetUnfolder]: 1894/4752 cut-off events. [2022-12-06 00:24:24,521 INFO L131 PetriNetUnfolder]: For 128487/128901 co-relation queries the response was YES. [2022-12-06 00:24:24,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43136 conditions, 4752 events. 1894/4752 cut-off events. For 128487/128901 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 46344 event pairs, 681 based on Foata normal form. 56/4452 useless extension candidates. Maximal degree in co-relation 42896. Up to 2021 conditions per place. [2022-12-06 00:24:24,611 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 252 places, 495 transitions, 13178 flow [2022-12-06 00:24:24,611 INFO L188 LiptonReduction]: Number of co-enabled transitions 2982 [2022-12-06 00:24:24,614 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:24:24,615 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 797 [2022-12-06 00:24:24,615 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 495 transitions, 13178 flow [2022-12-06 00:24:24,615 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 00:24:24,615 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:24:24,615 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 00:24:24,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-12-06 00:24:24,615 INFO L420 AbstractCegarLoop]: === Iteration 65 === 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 00:24:24,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:24:24,616 INFO L85 PathProgramCache]: Analyzing trace with hash 175108820, now seen corresponding path program 1 times [2022-12-06 00:24:24,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:24:24,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775230819] [2022-12-06 00:24:24,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:24:24,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:24:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:24:24,918 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 00:24:24,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:24:24,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775230819] [2022-12-06 00:24:24,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775230819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:24:24,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:24:24,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:24:24,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325807542] [2022-12-06 00:24:24,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:24:24,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:24:24,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:24:24,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:24:24,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:24:24,920 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-06 00:24:24,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 495 transitions, 13178 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 00:24:24,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:24:24,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-06 00:24:24,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:24:27,925 INFO L130 PetriNetUnfolder]: 8141/13056 cut-off events. [2022-12-06 00:24:27,926 INFO L131 PetriNetUnfolder]: For 432501/432501 co-relation queries the response was YES. [2022-12-06 00:24:28,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132522 conditions, 13056 events. 8141/13056 cut-off events. For 432501/432501 co-relation queries the response was YES. Maximal size of possible extension queue 784. Compared 89939 event pairs, 2960 based on Foata normal form. 1/13057 useless extension candidates. Maximal degree in co-relation 131628. Up to 12609 conditions per place. [2022-12-06 00:24:28,109 INFO L137 encePairwiseOnDemand]: 19/66 looper letters, 424 selfloop transitions, 142 changer transitions 2/568 dead transitions. [2022-12-06 00:24:28,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 568 transitions, 15155 flow [2022-12-06 00:24:28,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:24:28,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:24:28,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2022-12-06 00:24:28,110 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26515151515151514 [2022-12-06 00:24:28,110 INFO L175 Difference]: Start difference. First operand has 252 places, 495 transitions, 13178 flow. Second operand 8 states and 140 transitions. [2022-12-06 00:24:28,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 568 transitions, 15155 flow [2022-12-06 00:24:29,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 568 transitions, 14623 flow, removed 58 selfloop flow, removed 4 redundant places. [2022-12-06 00:24:29,934 INFO L231 Difference]: Finished difference. Result has 256 places, 496 transitions, 13096 flow [2022-12-06 00:24:29,935 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=12664, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=13096, PETRI_PLACES=256, PETRI_TRANSITIONS=496} [2022-12-06 00:24:29,935 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 226 predicate places. [2022-12-06 00:24:29,935 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:24:29,935 INFO L89 Accepts]: Start accepts. Operand has 256 places, 496 transitions, 13096 flow [2022-12-06 00:24:29,938 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:24:29,938 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:24:29,938 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 256 places, 496 transitions, 13096 flow [2022-12-06 00:24:29,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 256 places, 496 transitions, 13096 flow [2022-12-06 00:24:30,655 INFO L130 PetriNetUnfolder]: 1885/4741 cut-off events. [2022-12-06 00:24:30,656 INFO L131 PetriNetUnfolder]: For 112561/112988 co-relation queries the response was YES. [2022-12-06 00:24:30,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41515 conditions, 4741 events. 1885/4741 cut-off events. For 112561/112988 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 46289 event pairs, 674 based on Foata normal form. 55/4432 useless extension candidates. Maximal degree in co-relation 41267. Up to 2004 conditions per place. [2022-12-06 00:24:30,749 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 256 places, 496 transitions, 13096 flow [2022-12-06 00:24:30,749 INFO L188 LiptonReduction]: Number of co-enabled transitions 2990 [2022-12-06 00:24:30,752 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:24:30,752 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 817 [2022-12-06 00:24:30,752 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 496 transitions, 13096 flow [2022-12-06 00:24:30,752 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 00:24:30,752 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:24:30,753 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 00:24:30,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-12-06 00:24:30,753 INFO L420 AbstractCegarLoop]: === Iteration 66 === 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 00:24:30,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:24:30,753 INFO L85 PathProgramCache]: Analyzing trace with hash 871586244, now seen corresponding path program 2 times [2022-12-06 00:24:30,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:24:30,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729166490] [2022-12-06 00:24:30,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:24:30,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:24:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:24:31,182 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 00:24:31,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:24:31,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729166490] [2022-12-06 00:24:31,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729166490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:24:31,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:24:31,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:24:31,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289106749] [2022-12-06 00:24:31,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:24:31,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:24:31,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:24:31,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:24:31,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:24:31,183 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-06 00:24:31,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 496 transitions, 13096 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 00:24:31,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:24:31,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-06 00:24:31,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:24:34,467 INFO L130 PetriNetUnfolder]: 8259/13256 cut-off events. [2022-12-06 00:24:34,468 INFO L131 PetriNetUnfolder]: For 401738/401738 co-relation queries the response was YES. [2022-12-06 00:24:34,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130524 conditions, 13256 events. 8259/13256 cut-off events. For 401738/401738 co-relation queries the response was YES. Maximal size of possible extension queue 859. Compared 92352 event pairs, 3200 based on Foata normal form. 1/13257 useless extension candidates. Maximal degree in co-relation 129525. Up to 12676 conditions per place. [2022-12-06 00:24:34,625 INFO L137 encePairwiseOnDemand]: 22/66 looper letters, 451 selfloop transitions, 130 changer transitions 3/584 dead transitions. [2022-12-06 00:24:34,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 584 transitions, 15350 flow [2022-12-06 00:24:34,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:24:34,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:24:34,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2022-12-06 00:24:34,626 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24579124579124578 [2022-12-06 00:24:34,626 INFO L175 Difference]: Start difference. First operand has 256 places, 496 transitions, 13096 flow. Second operand 9 states and 146 transitions. [2022-12-06 00:24:34,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 584 transitions, 15350 flow [2022-12-06 00:24:36,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 584 transitions, 15194 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-06 00:24:36,086 INFO L231 Difference]: Finished difference. Result has 263 places, 505 transitions, 13551 flow [2022-12-06 00:24:36,087 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=12940, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13551, PETRI_PLACES=263, PETRI_TRANSITIONS=505} [2022-12-06 00:24:36,087 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 233 predicate places. [2022-12-06 00:24:36,087 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:24:36,087 INFO L89 Accepts]: Start accepts. Operand has 263 places, 505 transitions, 13551 flow [2022-12-06 00:24:36,089 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:24:36,089 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:24:36,089 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 263 places, 505 transitions, 13551 flow [2022-12-06 00:24:36,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 505 transitions, 13551 flow [2022-12-06 00:24:36,815 INFO L130 PetriNetUnfolder]: 1892/4834 cut-off events. [2022-12-06 00:24:36,815 INFO L131 PetriNetUnfolder]: For 118539/119060 co-relation queries the response was YES. [2022-12-06 00:24:36,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42390 conditions, 4834 events. 1892/4834 cut-off events. For 118539/119060 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 47887 event pairs, 670 based on Foata normal form. 49/4518 useless extension candidates. Maximal degree in co-relation 42032. Up to 2018 conditions per place. [2022-12-06 00:24:36,907 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 263 places, 505 transitions, 13551 flow [2022-12-06 00:24:36,907 INFO L188 LiptonReduction]: Number of co-enabled transitions 3078 [2022-12-06 00:24:36,991 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [597] $Ultimate##0-->L64-5: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_165 0) (= |v_thread2Thread1of1ForFork2_#res.offset_71| 0) (= |v_thread2Thread1of1ForFork2_#res.base_71| 0) (= v_thread3Thread1of1ForFork0_~i~2_223 (+ v_~M~0_177 1)) (< v_thread3Thread1of1ForFork0_~i~2_223 (+ v_~N~0_219 1)) (= (+ (select (select |v_#memory_int_361| v_~A~0.base_235) (+ (* v_thread3Thread1of1ForFork0_~i~2_223 4) v_~A~0.offset_235 (- 4))) v_~sum3~0_197) v_~sum3~0_196) (not (< v_thread2Thread1of1ForFork2_~i~1_165 v_~M~0_177))) InVars {~A~0.base=v_~A~0.base_235, ~A~0.offset=v_~A~0.offset_235, ~M~0=v_~M~0_177, #memory_int=|v_#memory_int_361|, ~sum3~0=v_~sum3~0_197, ~N~0=v_~N~0_219} OutVars{~A~0.base=v_~A~0.base_235, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_165, ~A~0.offset=v_~A~0.offset_235, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_71|, ~M~0=v_~M~0_177, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_223, #memory_int=|v_#memory_int_361|, ~sum3~0=v_~sum3~0_196, ~N~0=v_~N~0_219, thread3Thread1of1ForFork0_#t~mem6=|v_thread3Thread1of1ForFork0_#t~mem6_112|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_110|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_71|} 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 00:24:37,084 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [598] $Ultimate##0-->L48-5: Formula: (and (= v_~sum1~0_311 (let ((.cse0 (select |v_#memory_int_363| v_~A~0.base_237))) (+ v_~sum1~0_312 (select .cse0 (+ v_~A~0.offset_237 4)) (select .cse0 v_~A~0.offset_237)))) (not (< v_thread2Thread1of1ForFork2_~i~1_167 v_~M~0_179)) (= |v_thread2Thread1of1ForFork2_#res.offset_73| 0) (= v_thread2Thread1of1ForFork2_~i~1_167 0) (= 2 v_thread1Thread1of1ForFork1_~i~0_185) (= v_~M~0_179 v_thread3Thread1of1ForFork0_~i~2_227) (= |v_thread2Thread1of1ForFork2_#res.base_73| 0) (< 1 v_~N~0_221)) InVars {~A~0.base=v_~A~0.base_237, ~A~0.offset=v_~A~0.offset_237, ~sum1~0=v_~sum1~0_312, ~M~0=v_~M~0_179, #memory_int=|v_#memory_int_363|, ~N~0=v_~N~0_221} OutVars{~A~0.base=v_~A~0.base_237, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_227, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_185, ~N~0=v_~N~0_221, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_167, ~A~0.offset=v_~A~0.offset_237, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_163|, ~sum1~0=v_~sum1~0_311, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_73|, ~M~0=v_~M~0_179, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_155|, #memory_int=|v_#memory_int_363|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_73|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread2Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_~i~2, thread1Thread1of1ForFork1_~i~0, 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 00:24:37,190 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [599] $Ultimate##0-->L48-5: Formula: (and (not (< v_thread2Thread1of1ForFork2_~i~1_169 v_~M~0_181)) (= v_thread2Thread1of1ForFork2_~i~1_169 0) (= v_~sum1~0_315 (let ((.cse0 (select |v_#memory_int_365| v_~A~0.base_239)) (.cse1 (* v_thread1Thread1of1ForFork1_~i~0_187 4))) (+ (select .cse0 (+ v_~A~0.offset_239 .cse1 (- 4))) v_~sum1~0_316 (select .cse0 (+ v_~A~0.offset_239 .cse1 (- 8)))))) (= v_~M~0_181 v_thread3Thread1of1ForFork0_~i~2_229) (< v_thread1Thread1of1ForFork1_~i~0_187 (+ v_~N~0_223 1)) (= 2 v_thread1Thread1of1ForFork1_~i~0_187) (= |v_thread2Thread1of1ForFork2_#res.offset_75| 0) (= |v_thread2Thread1of1ForFork2_#res.base_75| 0)) InVars {~A~0.base=v_~A~0.base_239, ~A~0.offset=v_~A~0.offset_239, ~sum1~0=v_~sum1~0_316, ~M~0=v_~M~0_181, #memory_int=|v_#memory_int_365|, ~N~0=v_~N~0_223} OutVars{~A~0.base=v_~A~0.base_239, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_229, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_187, ~N~0=v_~N~0_223, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_169, ~A~0.offset=v_~A~0.offset_239, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_165|, ~sum1~0=v_~sum1~0_315, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_75|, ~M~0=v_~M~0_181, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_157|, #memory_int=|v_#memory_int_365|, 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, thread1Thread1of1ForFork1_~i~0, 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 00:24:37,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-12-06 00:24:37,564 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IndexOutOfBoundsException: Index 18 out of bounds for length 18 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 00:24:37,566 INFO L158 Benchmark]: Toolchain (without parser) took 212311.32ms. Allocated memory was 179.3MB in the beginning and 7.0GB in the end (delta: 6.8GB). Free memory was 154.5MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2022-12-06 00:24:37,566 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 179.3MB. Free memory is still 155.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 00:24:37,566 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.47ms. Allocated memory is still 179.3MB. Free memory was 154.5MB in the beginning and 143.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 00:24:37,566 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.79ms. Allocated memory is still 179.3MB. Free memory was 143.0MB in the beginning and 141.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 00:24:37,567 INFO L158 Benchmark]: Boogie Preprocessor took 48.34ms. Allocated memory is still 179.3MB. Free memory was 141.3MB in the beginning and 139.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:24:37,567 INFO L158 Benchmark]: RCFGBuilder took 378.48ms. Allocated memory is still 179.3MB. Free memory was 139.5MB in the beginning and 124.1MB in the end (delta: 15.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-12-06 00:24:37,567 INFO L158 Benchmark]: TraceAbstraction took 211554.00ms. Allocated memory was 179.3MB in the beginning and 7.0GB in the end (delta: 6.8GB). Free memory was 123.5MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2022-12-06 00:24:37,568 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.12ms. Allocated memory is still 179.3MB. Free memory is still 155.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 275.47ms. Allocated memory is still 179.3MB. Free memory was 154.5MB in the beginning and 143.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.79ms. Allocated memory is still 179.3MB. Free memory was 143.0MB in the beginning and 141.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.34ms. Allocated memory is still 179.3MB. Free memory was 141.3MB in the beginning and 139.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 378.48ms. Allocated memory is still 179.3MB. Free memory was 139.5MB in the beginning and 124.1MB in the end (delta: 15.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 211554.00ms. Allocated memory was 179.3MB in the beginning and 7.0GB in the end (delta: 6.8GB). Free memory was 123.5MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 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: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, 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: 1.8s, 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.0s, 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.3s, 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.7s, 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.9s, 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.7s, 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, 159 PlacesBefore, 159 PlacesAfterwards, 425 TransitionsBefore, 425 TransitionsAfterwards, 2432 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, 170 PlacesBefore, 170 PlacesAfterwards, 441 TransitionsBefore, 441 TransitionsAfterwards, 2556 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.2s, 187 PlacesBefore, 185 PlacesAfterwards, 483 TransitionsBefore, 481 TransitionsAfterwards, 2846 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 11, 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: 11, independent: 4, independent conditional: 4, 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): 214, Positive cache size: 214, Positive conditional cache size: 189, Positive unconditional cache size: 25, 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, 191 PlacesBefore, 191 PlacesAfterwards, 532 TransitionsBefore, 532 TransitionsAfterwards, 3090 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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: 2, independent unconditional: 5, 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: 2, independent unconditional: 5, 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: 7, independent: 5, independent conditional: 0, independent unconditional: 5, 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): 216, Positive cache size: 216, Positive conditional cache size: 191, Positive unconditional cache size: 25, 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: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 190 PlacesBefore, 190 PlacesAfterwards, 530 TransitionsBefore, 530 TransitionsAfterwards, 3080 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): 216, Positive cache size: 216, Positive conditional cache size: 191, Positive unconditional cache size: 25, 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, 209 PlacesBefore, 209 PlacesAfterwards, 564 TransitionsBefore, 564 TransitionsAfterwards, 3278 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 15, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 246, Positive cache size: 246, Positive conditional cache size: 221, Positive unconditional cache size: 25, 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, 223 PlacesBefore, 223 PlacesAfterwards, 601 TransitionsBefore, 601 TransitionsAfterwards, 3434 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): 246, Positive cache size: 246, Positive conditional cache size: 221, Positive unconditional cache size: 25, 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, 594 TransitionsBefore, 594 TransitionsAfterwards, 3406 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): 246, Positive cache size: 246, Positive conditional cache size: 221, Positive unconditional cache size: 25, 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, 596 TransitionsBefore, 596 TransitionsAfterwards, 3422 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): 246, Positive cache size: 246, Positive conditional cache size: 221, Positive unconditional cache size: 25, 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, 236 PlacesBefore, 236 PlacesAfterwards, 597 TransitionsBefore, 597 TransitionsAfterwards, 3436 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 274, Positive cache size: 274, Positive conditional cache size: 249, Positive unconditional cache size: 25, 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, 239 PlacesBefore, 239 PlacesAfterwards, 616 TransitionsBefore, 616 TransitionsAfterwards, 3646 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): 274, Positive cache size: 274, Positive conditional cache size: 249, Positive unconditional cache size: 25, 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, 244 PlacesBefore, 244 PlacesAfterwards, 618 TransitionsBefore, 618 TransitionsAfterwards, 3786 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): 274, Positive cache size: 274, Positive conditional cache size: 249, Positive unconditional cache size: 25, 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, 248 PlacesBefore, 248 PlacesAfterwards, 627 TransitionsBefore, 627 TransitionsAfterwards, 3886 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): 274, Positive cache size: 274, Positive conditional cache size: 249, Positive unconditional cache size: 25, 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, 251 PlacesBefore, 251 PlacesAfterwards, 596 TransitionsBefore, 596 TransitionsAfterwards, 3558 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): 274, Positive cache size: 274, Positive conditional cache size: 249, Positive unconditional cache size: 25, 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.5s, 255 PlacesBefore, 255 PlacesAfterwards, 523 TransitionsBefore, 523 TransitionsAfterwards, 3116 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 15, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 285, Positive cache size: 285, Positive conditional cache size: 260, Positive unconditional cache size: 25, 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, 244 PlacesBefore, 244 PlacesAfterwards, 506 TransitionsBefore, 506 TransitionsAfterwards, 3036 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): 285, Positive cache size: 285, Positive conditional cache size: 260, Positive unconditional cache size: 25, 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.4s, 248 PlacesBefore, 247 PlacesAfterwards, 509 TransitionsBefore, 508 TransitionsAfterwards, 3060 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 16, 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: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 16, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 297, Positive cache size: 297, Positive conditional cache size: 272, Positive unconditional cache size: 25, 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, 248 PlacesBefore, 247 PlacesAfterwards, 499 TransitionsBefore, 498 TransitionsAfterwards, 2982 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: 0, 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: 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] , Statistics on independence cache: Total cache size (in pairs): 297, Positive cache size: 297, Positive conditional cache size: 272, Positive unconditional cache size: 25, 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, 248 PlacesBefore, 248 PlacesAfterwards, 499 TransitionsBefore, 499 TransitionsAfterwards, 2982 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): 297, Positive cache size: 297, Positive conditional cache size: 272, Positive unconditional cache size: 25, 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, 246 PlacesBefore, 246 PlacesAfterwards, 498 TransitionsBefore, 498 TransitionsAfterwards, 2980 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): 297, Positive cache size: 297, Positive conditional cache size: 272, Positive unconditional cache size: 25, 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, 252 PlacesBefore, 252 PlacesAfterwards, 495 TransitionsBefore, 495 TransitionsAfterwards, 2982 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): 297, Positive cache size: 297, Positive conditional cache size: 272, Positive unconditional cache size: 25, 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, 256 PlacesBefore, 256 PlacesAfterwards, 496 TransitionsBefore, 496 TransitionsAfterwards, 2990 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): 297, Positive cache size: 297, Positive conditional cache size: 272, Positive unconditional cache size: 25, 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 - ExceptionOrErrorResult: IndexOutOfBoundsException: Index 18 out of bounds for length 18 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IndexOutOfBoundsException: Index 18 out of bounds for length 18: java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 00:24:37,615 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...