/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-RepeatedSemanticLbeWithPredicates.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 05:36:56,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:36:56,423 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:36:56,465 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:36:56,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:36:56,466 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:36:56,467 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:36:56,468 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:36:56,469 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:36:56,470 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:36:56,471 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:36:56,477 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:36:56,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:36:56,479 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:36:56,480 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:36:56,480 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:36:56,481 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:36:56,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:36:56,482 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:36:56,483 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:36:56,484 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:36:56,490 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:36:56,493 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:36:56,494 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:36:56,500 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:36:56,500 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:36:56,501 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:36:56,501 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:36:56,501 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:36:56,502 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:36:56,502 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:36:56,502 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:36:56,503 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:36:56,503 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:36:56,504 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:36:56,504 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:36:56,505 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:36:56,505 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:36:56,505 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:36:56,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:36:56,506 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:36:56,509 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:36:56,536 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:36:56,536 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:36:56,537 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:36:56,537 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:36:56,537 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:36:56,538 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:36:56,538 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:36:56,538 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:36:56,538 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:36:56,538 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:36:56,539 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:36:56,539 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:36:56,539 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:36:56,539 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:36:56,539 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:36:56,539 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:36:56,540 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:36:56,540 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:36:56,540 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:36:56,540 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:36:56,540 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:36:56,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:36:56,540 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:36:56,540 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:36:56,540 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:36:56,540 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:36:56,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:36:56,541 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:36:56,541 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 05:36:56,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:36:56,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:36:56,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:36:56,842 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:36:56,842 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:36:56,843 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 05:36:58,068 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:36:58,299 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:36:58,301 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2022-12-06 05:36:58,326 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44d22fcfd/949f389430f540fdb99f2e18f967f99e/FLAG41673002f [2022-12-06 05:36:58,337 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44d22fcfd/949f389430f540fdb99f2e18f967f99e [2022-12-06 05:36:58,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:36:58,340 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:36:58,341 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:36:58,341 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:36:58,343 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:36:58,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:36:58" (1/1) ... [2022-12-06 05:36:58,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f0dff64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:58, skipping insertion in model container [2022-12-06 05:36:58,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:36:58" (1/1) ... [2022-12-06 05:36:58,348 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:36:58,365 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:36:58,505 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 05:36:58,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:36:58,523 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:36:58,551 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 05:36:58,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:36:58,565 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:36:58,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:58 WrapperNode [2022-12-06 05:36:58,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:36:58,566 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:36:58,566 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:36:58,566 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:36:58,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:58" (1/1) ... [2022-12-06 05:36:58,576 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:58" (1/1) ... [2022-12-06 05:36:58,595 INFO L138 Inliner]: procedures = 25, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2022-12-06 05:36:58,595 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:36:58,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:36:58,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:36:58,596 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:36:58,603 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:58" (1/1) ... [2022-12-06 05:36:58,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:58" (1/1) ... [2022-12-06 05:36:58,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:58" (1/1) ... [2022-12-06 05:36:58,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:58" (1/1) ... [2022-12-06 05:36:58,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:58" (1/1) ... [2022-12-06 05:36:58,612 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:58" (1/1) ... [2022-12-06 05:36:58,613 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:58" (1/1) ... [2022-12-06 05:36:58,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:58" (1/1) ... [2022-12-06 05:36:58,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:36:58,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:36:58,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:36:58,619 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:36:58,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:58" (1/1) ... [2022-12-06 05:36:58,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:36:58,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:36:58,646 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 05:36:58,652 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 05:36:58,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:36:58,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:36:58,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:36:58,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:36:58,674 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:36:58,675 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:36:58,675 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:36:58,675 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:36:58,675 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:36:58,675 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:36:58,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:36:58,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:36:58,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:36:58,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:36:58,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:36:58,676 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 05:36:58,765 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:36:58,766 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:36:59,009 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:36:59,017 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:36:59,017 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 05:36:59,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:36:59 BoogieIcfgContainer [2022-12-06 05:36:59,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:36:59,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:36:59,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:36:59,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:36:59,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:36:58" (1/3) ... [2022-12-06 05:36:59,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51fc05db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:36:59, skipping insertion in model container [2022-12-06 05:36:59,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:58" (2/3) ... [2022-12-06 05:36:59,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51fc05db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:36:59, skipping insertion in model container [2022-12-06 05:36:59,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:36:59" (3/3) ... [2022-12-06 05:36:59,024 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2022-12-06 05:36:59,036 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:36:59,036 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:36:59,036 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:36:59,116 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 05:36:59,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 148 transitions, 320 flow [2022-12-06 05:36:59,227 INFO L130 PetriNetUnfolder]: 12/145 cut-off events. [2022-12-06 05:36:59,228 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:36:59,232 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 05:36:59,232 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 148 transitions, 320 flow [2022-12-06 05:36:59,235 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 135 transitions, 288 flow [2022-12-06 05:36:59,236 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:59,252 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 135 transitions, 288 flow [2022-12-06 05:36:59,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 135 transitions, 288 flow [2022-12-06 05:36:59,309 INFO L130 PetriNetUnfolder]: 12/135 cut-off events. [2022-12-06 05:36:59,310 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:36:59,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 05:36:59,313 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 135 transitions, 288 flow [2022-12-06 05:36:59,313 INFO L188 LiptonReduction]: Number of co-enabled transitions 1728 [2022-12-06 05:37:03,468 INFO L203 LiptonReduction]: Total number of compositions: 111 [2022-12-06 05:37:03,478 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:37:03,483 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;@13704171, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:37:03,483 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 05:37:03,487 INFO L130 PetriNetUnfolder]: 4/23 cut-off events. [2022-12-06 05:37:03,487 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:37:03,487 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:03,488 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 05:37:03,488 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 05:37:03,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:03,495 INFO L85 PathProgramCache]: Analyzing trace with hash 2027454459, now seen corresponding path program 1 times [2022-12-06 05:37:03,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:03,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990675571] [2022-12-06 05:37:03,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:03,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:03,905 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 05:37:03,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:03,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990675571] [2022-12-06 05:37:03,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990675571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:03,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:03,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 05:37:03,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25890079] [2022-12-06 05:37:03,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:03,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:37:03,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:03,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:37:03,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:37:03,931 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2022-12-06 05:37:03,932 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 05:37:03,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:03,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2022-12-06 05:37:03,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:04,003 INFO L130 PetriNetUnfolder]: 360/508 cut-off events. [2022-12-06 05:37:04,004 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-12-06 05:37:04,005 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 05:37:04,007 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 32 selfloop transitions, 4 changer transitions 1/40 dead transitions. [2022-12-06 05:37:04,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 40 transitions, 187 flow [2022-12-06 05:37:04,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:37:04,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:37:04,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-06 05:37:04,015 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6527777777777778 [2022-12-06 05:37:04,016 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 66 flow. Second operand 3 states and 47 transitions. [2022-12-06 05:37:04,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 40 transitions, 187 flow [2022-12-06 05:37:04,019 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 05:37:04,020 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 80 flow [2022-12-06 05:37:04,021 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 05:37:04,023 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2022-12-06 05:37:04,023 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:04,024 INFO L89 Accepts]: Start accepts. Operand has 27 places, 27 transitions, 80 flow [2022-12-06 05:37:04,025 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:04,026 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:04,026 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 27 transitions, 80 flow [2022-12-06 05:37:04,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 27 transitions, 80 flow [2022-12-06 05:37:04,031 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 05:37:04,031 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-06 05:37:04,031 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 05:37:04,031 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 05:37:04,031 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 05:37:04,032 INFO L130 PetriNetUnfolder]: 23/64 cut-off events. [2022-12-06 05:37:04,032 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:37:04,033 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 05:37:04,033 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 27 transitions, 80 flow [2022-12-06 05:37:04,033 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 05:37:04,034 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:04,035 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 05:37:04,035 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 80 flow [2022-12-06 05:37:04,035 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 05:37:04,035 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:04,035 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 05:37:04,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:37:04,035 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 05:37:04,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:04,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1702965316, now seen corresponding path program 1 times [2022-12-06 05:37:04,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:04,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478449232] [2022-12-06 05:37:04,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:04,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:04,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:04,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:04,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478449232] [2022-12-06 05:37:04,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478449232] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:04,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:04,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:37:04,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925589898] [2022-12-06 05:37:04,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:04,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:37:04,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:04,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:37:04,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:37:04,163 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 05:37:04,163 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 05:37:04,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:04,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 05:37:04,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:04,300 INFO L130 PetriNetUnfolder]: 663/975 cut-off events. [2022-12-06 05:37:04,300 INFO L131 PetriNetUnfolder]: For 287/287 co-relation queries the response was YES. [2022-12-06 05:37:04,302 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 05:37:04,306 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 64 selfloop transitions, 5 changer transitions 0/71 dead transitions. [2022-12-06 05:37:04,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 71 transitions, 348 flow [2022-12-06 05:37:04,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:37:04,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:37:04,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-12-06 05:37:04,307 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2022-12-06 05:37:04,307 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 80 flow. Second operand 6 states and 73 transitions. [2022-12-06 05:37:04,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 71 transitions, 348 flow [2022-12-06 05:37:04,308 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 05:37:04,309 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 115 flow [2022-12-06 05:37:04,309 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 05:37:04,310 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2022-12-06 05:37:04,310 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:04,310 INFO L89 Accepts]: Start accepts. Operand has 35 places, 31 transitions, 115 flow [2022-12-06 05:37:04,311 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:04,311 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:04,311 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 31 transitions, 115 flow [2022-12-06 05:37:04,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 115 flow [2022-12-06 05:37:04,317 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 05:37:04,317 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2022-12-06 05:37:04,317 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 05:37:04,317 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-12-06 05:37:04,317 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 05:37:04,318 INFO L130 PetriNetUnfolder]: 30/102 cut-off events. [2022-12-06 05:37:04,318 INFO L131 PetriNetUnfolder]: For 6/7 co-relation queries the response was YES. [2022-12-06 05:37:04,319 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 05:37:04,319 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 31 transitions, 115 flow [2022-12-06 05:37:04,320 INFO L188 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-06 05:37:06,073 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:06,074 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1764 [2022-12-06 05:37:06,074 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 121 flow [2022-12-06 05:37:06,074 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 05:37:06,074 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:06,074 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 05:37:06,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:37:06,074 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 05:37:06,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:06,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1920480195, now seen corresponding path program 1 times [2022-12-06 05:37:06,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:06,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596515144] [2022-12-06 05:37:06,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:06,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:06,124 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 05:37:06,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:06,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596515144] [2022-12-06 05:37:06,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596515144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:06,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:06,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:37:06,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810502928] [2022-12-06 05:37:06,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:06,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:37:06,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:06,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:37:06,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:37:06,126 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 05:37:06,126 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 05:37:06,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:06,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 05:37:06,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:06,230 INFO L130 PetriNetUnfolder]: 483/758 cut-off events. [2022-12-06 05:37:06,231 INFO L131 PetriNetUnfolder]: For 432/460 co-relation queries the response was YES. [2022-12-06 05:37:06,231 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 05:37:06,234 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 51 selfloop transitions, 2 changer transitions 1/57 dead transitions. [2022-12-06 05:37:06,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 57 transitions, 301 flow [2022-12-06 05:37:06,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:37:06,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:37:06,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-06 05:37:06,235 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5576923076923077 [2022-12-06 05:37:06,235 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 121 flow. Second operand 4 states and 58 transitions. [2022-12-06 05:37:06,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 57 transitions, 301 flow [2022-12-06 05:37:06,237 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 05:37:06,238 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 122 flow [2022-12-06 05:37:06,238 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 05:37:06,238 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2022-12-06 05:37:06,238 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:06,238 INFO L89 Accepts]: Start accepts. Operand has 40 places, 31 transitions, 122 flow [2022-12-06 05:37:06,239 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:06,239 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:06,239 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 31 transitions, 122 flow [2022-12-06 05:37:06,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 122 flow [2022-12-06 05:37:06,245 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 05:37:06,245 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-06 05:37:06,245 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 05:37:06,245 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 05:37:06,245 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 05:37:06,246 INFO L130 PetriNetUnfolder]: 24/89 cut-off events. [2022-12-06 05:37:06,246 INFO L131 PetriNetUnfolder]: For 14/15 co-relation queries the response was YES. [2022-12-06 05:37:06,246 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 05:37:06,247 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 122 flow [2022-12-06 05:37:06,247 INFO L188 LiptonReduction]: Number of co-enabled transitions 254 [2022-12-06 05:37:06,248 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:06,248 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 05:37:06,249 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 122 flow [2022-12-06 05:37:06,249 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 05:37:06,249 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:06,249 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 05:37:06,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:37:06,249 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 05:37:06,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:06,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1884357865, now seen corresponding path program 1 times [2022-12-06 05:37:06,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:06,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660586439] [2022-12-06 05:37:06,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:06,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:06,349 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 05:37:06,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:06,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660586439] [2022-12-06 05:37:06,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660586439] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:06,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:06,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:37:06,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029729022] [2022-12-06 05:37:06,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:06,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:37:06,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:06,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:37:06,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:37:06,352 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 05:37:06,352 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 05:37:06,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:06,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 05:37:06,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:06,427 INFO L130 PetriNetUnfolder]: 483/740 cut-off events. [2022-12-06 05:37:06,427 INFO L131 PetriNetUnfolder]: For 490/515 co-relation queries the response was YES. [2022-12-06 05:37:06,429 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 05:37:06,431 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 26 selfloop transitions, 0 changer transitions 26/53 dead transitions. [2022-12-06 05:37:06,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 282 flow [2022-12-06 05:37:06,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:37:06,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:37:06,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-06 05:37:06,433 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.53 [2022-12-06 05:37:06,433 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 122 flow. Second operand 4 states and 53 transitions. [2022-12-06 05:37:06,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 282 flow [2022-12-06 05:37:06,436 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 05:37:06,437 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 91 flow [2022-12-06 05:37:06,438 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 05:37:06,439 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2022-12-06 05:37:06,439 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:06,439 INFO L89 Accepts]: Start accepts. Operand has 42 places, 27 transitions, 91 flow [2022-12-06 05:37:06,440 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:06,440 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:06,440 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 27 transitions, 91 flow [2022-12-06 05:37:06,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 27 transitions, 91 flow [2022-12-06 05:37:06,444 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 05:37:06,444 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-06 05:37:06,444 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 05:37:06,444 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 05:37:06,444 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 05:37:06,445 INFO L130 PetriNetUnfolder]: 23/64 cut-off events. [2022-12-06 05:37:06,445 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:37:06,446 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 05:37:06,446 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 27 transitions, 91 flow [2022-12-06 05:37:06,446 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 05:37:06,447 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:06,454 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 05:37:06,455 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 91 flow [2022-12-06 05:37:06,455 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 05:37:06,455 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:06,455 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 05:37:06,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:37:06,455 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 05:37:06,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:06,456 INFO L85 PathProgramCache]: Analyzing trace with hash 484914264, now seen corresponding path program 1 times [2022-12-06 05:37:06,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:06,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092989588] [2022-12-06 05:37:06,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:06,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:06,591 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 05:37:06,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:06,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092989588] [2022-12-06 05:37:06,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092989588] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:06,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:06,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:37:06,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352995949] [2022-12-06 05:37:06,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:06,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:37:06,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:06,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:37:06,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:37:06,593 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 05:37:06,593 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 05:37:06,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:06,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 05:37:06,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:06,774 INFO L130 PetriNetUnfolder]: 544/798 cut-off events. [2022-12-06 05:37:06,774 INFO L131 PetriNetUnfolder]: For 456/456 co-relation queries the response was YES. [2022-12-06 05:37:06,775 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 05:37:06,778 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 58 selfloop transitions, 8 changer transitions 0/67 dead transitions. [2022-12-06 05:37:06,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 67 transitions, 361 flow [2022-12-06 05:37:06,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:37:06,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:37:06,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-12-06 05:37:06,779 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-06 05:37:06,779 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 91 flow. Second operand 6 states and 64 transitions. [2022-12-06 05:37:06,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 67 transitions, 361 flow [2022-12-06 05:37:06,781 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 05:37:06,782 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 133 flow [2022-12-06 05:37:06,782 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 05:37:06,782 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2022-12-06 05:37:06,782 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:06,783 INFO L89 Accepts]: Start accepts. Operand has 36 places, 32 transitions, 133 flow [2022-12-06 05:37:06,783 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:06,783 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:06,783 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 32 transitions, 133 flow [2022-12-06 05:37:06,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 133 flow [2022-12-06 05:37:06,788 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 05:37:06,788 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-06 05:37:06,788 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 05:37:06,788 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 05:37:06,788 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 05:37:06,788 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 05:37:06,788 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-06 05:37:06,788 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 05:37:06,788 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 05:37:06,788 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 05:37:06,788 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 05:37:06,790 INFO L130 PetriNetUnfolder]: 29/84 cut-off events. [2022-12-06 05:37:06,790 INFO L131 PetriNetUnfolder]: For 11/17 co-relation queries the response was YES. [2022-12-06 05:37:06,790 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 05:37:06,791 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 32 transitions, 133 flow [2022-12-06 05:37:06,791 INFO L188 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-06 05:37:06,863 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:37:06,864 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 05:37:06,864 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 115 flow [2022-12-06 05:37:06,864 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 05:37:06,864 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:06,864 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 05:37:06,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:37:06,864 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 05:37:06,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:06,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1369268887, now seen corresponding path program 1 times [2022-12-06 05:37:06,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:06,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587895176] [2022-12-06 05:37:06,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:06,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:06,949 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 05:37:06,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:06,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587895176] [2022-12-06 05:37:06,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587895176] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:06,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:06,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:37:06,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546260726] [2022-12-06 05:37:06,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:06,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:37:06,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:06,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:37:06,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:37:06,951 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 05:37:06,951 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 05:37:06,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:06,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 05:37:06,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:07,078 INFO L130 PetriNetUnfolder]: 550/824 cut-off events. [2022-12-06 05:37:07,078 INFO L131 PetriNetUnfolder]: For 1083/1083 co-relation queries the response was YES. [2022-12-06 05:37:07,079 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 05:37:07,082 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 59 selfloop transitions, 11 changer transitions 1/72 dead transitions. [2022-12-06 05:37:07,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 72 transitions, 427 flow [2022-12-06 05:37:07,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:37:07,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:37:07,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-12-06 05:37:07,083 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46794871794871795 [2022-12-06 05:37:07,084 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 115 flow. Second operand 6 states and 73 transitions. [2022-12-06 05:37:07,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 72 transitions, 427 flow [2022-12-06 05:37:07,085 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 05:37:07,086 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 179 flow [2022-12-06 05:37:07,086 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 05:37:07,086 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2022-12-06 05:37:07,087 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:07,087 INFO L89 Accepts]: Start accepts. Operand has 40 places, 36 transitions, 179 flow [2022-12-06 05:37:07,087 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:07,087 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:07,087 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 36 transitions, 179 flow [2022-12-06 05:37:07,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 36 transitions, 179 flow [2022-12-06 05:37:07,093 INFO L130 PetriNetUnfolder]: 25/83 cut-off events. [2022-12-06 05:37:07,093 INFO L131 PetriNetUnfolder]: For 47/48 co-relation queries the response was YES. [2022-12-06 05:37:07,094 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 05:37:07,094 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 36 transitions, 179 flow [2022-12-06 05:37:07,094 INFO L188 LiptonReduction]: Number of co-enabled transitions 292 [2022-12-06 05:37:07,095 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [369] $Ultimate##0-->L64-5: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2] and [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 05:37:07,113 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 05:37:07,135 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:07,136 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 05:37:07,136 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 189 flow [2022-12-06 05:37:07,136 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 05:37:07,136 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:07,136 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 05:37:07,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:37:07,136 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 05:37:07,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:07,137 INFO L85 PathProgramCache]: Analyzing trace with hash 81363167, now seen corresponding path program 2 times [2022-12-06 05:37:07,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:07,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980305163] [2022-12-06 05:37:07,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:07,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:07,219 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 05:37:07,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:07,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980305163] [2022-12-06 05:37:07,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980305163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:07,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:07,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:37:07,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216618353] [2022-12-06 05:37:07,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:07,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:37:07,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:07,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:37:07,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:37:07,221 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 05:37:07,221 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 05:37:07,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:07,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 05:37:07,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:07,364 INFO L130 PetriNetUnfolder]: 598/875 cut-off events. [2022-12-06 05:37:07,364 INFO L131 PetriNetUnfolder]: For 1655/1655 co-relation queries the response was YES. [2022-12-06 05:37:07,365 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 05:37:07,369 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 49 selfloop transitions, 11 changer transitions 0/61 dead transitions. [2022-12-06 05:37:07,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 61 transitions, 408 flow [2022-12-06 05:37:07,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:37:07,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:37:07,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-06 05:37:07,370 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40714285714285714 [2022-12-06 05:37:07,370 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 189 flow. Second operand 5 states and 57 transitions. [2022-12-06 05:37:07,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 61 transitions, 408 flow [2022-12-06 05:37:07,381 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 05:37:07,382 INFO L231 Difference]: Finished difference. Result has 43 places, 40 transitions, 227 flow [2022-12-06 05:37:07,382 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 05:37:07,383 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2022-12-06 05:37:07,383 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:07,383 INFO L89 Accepts]: Start accepts. Operand has 43 places, 40 transitions, 227 flow [2022-12-06 05:37:07,383 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:07,383 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:07,384 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 40 transitions, 227 flow [2022-12-06 05:37:07,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 40 transitions, 227 flow [2022-12-06 05:37:07,392 INFO L130 PetriNetUnfolder]: 40/108 cut-off events. [2022-12-06 05:37:07,392 INFO L131 PetriNetUnfolder]: For 128/139 co-relation queries the response was YES. [2022-12-06 05:37:07,392 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 05:37:07,393 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 40 transitions, 227 flow [2022-12-06 05:37:07,393 INFO L188 LiptonReduction]: Number of co-enabled transitions 330 [2022-12-06 05:37:07,466 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:07,466 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 05:37:07,466 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 40 transitions, 245 flow [2022-12-06 05:37:07,467 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 05:37:07,467 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:07,467 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 05:37:07,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:37:07,467 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 05:37:07,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:07,468 INFO L85 PathProgramCache]: Analyzing trace with hash -882476984, now seen corresponding path program 1 times [2022-12-06 05:37:07,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:07,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905212148] [2022-12-06 05:37:07,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:07,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:07,556 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 05:37:07,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:07,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905212148] [2022-12-06 05:37:07,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905212148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:07,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:07,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:37:07,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033519215] [2022-12-06 05:37:07,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:07,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:37:07,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:07,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:37:07,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:37:07,562 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 05:37:07,562 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 05:37:07,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:07,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 05:37:07,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:07,660 INFO L130 PetriNetUnfolder]: 603/898 cut-off events. [2022-12-06 05:37:07,660 INFO L131 PetriNetUnfolder]: For 1957/1979 co-relation queries the response was YES. [2022-12-06 05:37:07,661 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 05:37:07,664 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 55 selfloop transitions, 4 changer transitions 0/61 dead transitions. [2022-12-06 05:37:07,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 61 transitions, 510 flow [2022-12-06 05:37:07,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:37:07,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:37:07,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-06 05:37:07,665 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4112903225806452 [2022-12-06 05:37:07,666 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 245 flow. Second operand 4 states and 51 transitions. [2022-12-06 05:37:07,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 61 transitions, 510 flow [2022-12-06 05:37:07,668 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 05:37:07,669 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 234 flow [2022-12-06 05:37:07,670 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 05:37:07,672 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2022-12-06 05:37:07,672 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:07,672 INFO L89 Accepts]: Start accepts. Operand has 43 places, 41 transitions, 234 flow [2022-12-06 05:37:07,673 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:07,673 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:07,673 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 41 transitions, 234 flow [2022-12-06 05:37:07,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 41 transitions, 234 flow [2022-12-06 05:37:07,680 INFO L130 PetriNetUnfolder]: 36/100 cut-off events. [2022-12-06 05:37:07,680 INFO L131 PetriNetUnfolder]: For 130/159 co-relation queries the response was YES. [2022-12-06 05:37:07,681 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 05:37:07,681 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 41 transitions, 234 flow [2022-12-06 05:37:07,681 INFO L188 LiptonReduction]: Number of co-enabled transitions 310 [2022-12-06 05:37:07,720 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 05:37:07,763 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:37:07,764 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-06 05:37:07,764 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 238 flow [2022-12-06 05:37:07,764 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 05:37:07,764 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:07,764 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 05:37:07,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:37:07,764 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 05:37:07,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:07,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1423117007, now seen corresponding path program 1 times [2022-12-06 05:37:07,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:07,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096933570] [2022-12-06 05:37:07,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:07,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:08,627 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 05:37:08,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:08,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096933570] [2022-12-06 05:37:08,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096933570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:08,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:08,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:37:08,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558660869] [2022-12-06 05:37:08,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:08,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:37:08,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:08,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:37:08,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:37:08,628 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 05:37:08,628 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 05:37:08,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:08,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 05:37:08,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:08,891 INFO L130 PetriNetUnfolder]: 669/1008 cut-off events. [2022-12-06 05:37:08,891 INFO L131 PetriNetUnfolder]: For 2478/2478 co-relation queries the response was YES. [2022-12-06 05:37:08,892 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 05:37:08,896 INFO L137 encePairwiseOnDemand]: 18/33 looper letters, 74 selfloop transitions, 26 changer transitions 5/105 dead transitions. [2022-12-06 05:37:08,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 105 transitions, 793 flow [2022-12-06 05:37:08,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:37:08,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:37:08,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-12-06 05:37:08,898 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41125541125541126 [2022-12-06 05:37:08,898 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 238 flow. Second operand 7 states and 95 transitions. [2022-12-06 05:37:08,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 105 transitions, 793 flow [2022-12-06 05:37:08,901 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 05:37:08,904 INFO L231 Difference]: Finished difference. Result has 49 places, 59 transitions, 458 flow [2022-12-06 05:37:08,904 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 05:37:08,904 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 19 predicate places. [2022-12-06 05:37:08,905 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:08,905 INFO L89 Accepts]: Start accepts. Operand has 49 places, 59 transitions, 458 flow [2022-12-06 05:37:08,906 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:08,907 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:08,907 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 59 transitions, 458 flow [2022-12-06 05:37:08,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 59 transitions, 458 flow [2022-12-06 05:37:08,916 INFO L130 PetriNetUnfolder]: 57/159 cut-off events. [2022-12-06 05:37:08,916 INFO L131 PetriNetUnfolder]: For 412/468 co-relation queries the response was YES. [2022-12-06 05:37:08,916 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 05:37:08,917 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 59 transitions, 458 flow [2022-12-06 05:37:08,917 INFO L188 LiptonReduction]: Number of co-enabled transitions 396 [2022-12-06 05:37:11,364 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:11,365 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2460 [2022-12-06 05:37:11,365 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 59 transitions, 466 flow [2022-12-06 05:37:11,365 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 05:37:11,365 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:11,365 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 05:37:11,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 05:37:11,365 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 05:37:11,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:11,366 INFO L85 PathProgramCache]: Analyzing trace with hash -955963427, now seen corresponding path program 1 times [2022-12-06 05:37:11,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:11,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791865922] [2022-12-06 05:37:11,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:11,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:11,753 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 05:37:11,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:11,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791865922] [2022-12-06 05:37:11,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791865922] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:11,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:11,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:37:11,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847339648] [2022-12-06 05:37:11,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:11,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:37:11,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:11,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:37:11,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:37:11,756 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-06 05:37:11,757 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 05:37:11,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:11,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-06 05:37:11,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:11,946 INFO L130 PetriNetUnfolder]: 798/1216 cut-off events. [2022-12-06 05:37:11,947 INFO L131 PetriNetUnfolder]: For 3685/3797 co-relation queries the response was YES. [2022-12-06 05:37:11,949 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 05:37:11,954 INFO L137 encePairwiseOnDemand]: 17/35 looper letters, 73 selfloop transitions, 25 changer transitions 5/105 dead transitions. [2022-12-06 05:37:11,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 105 transitions, 908 flow [2022-12-06 05:37:11,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:37:11,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:37:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-06 05:37:11,955 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49714285714285716 [2022-12-06 05:37:11,955 INFO L175 Difference]: Start difference. First operand has 49 places, 59 transitions, 466 flow. Second operand 5 states and 87 transitions. [2022-12-06 05:37:11,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 105 transitions, 908 flow [2022-12-06 05:37:11,962 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 05:37:11,963 INFO L231 Difference]: Finished difference. Result has 55 places, 68 transitions, 593 flow [2022-12-06 05:37:11,964 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 05:37:11,964 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 25 predicate places. [2022-12-06 05:37:11,964 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:11,964 INFO L89 Accepts]: Start accepts. Operand has 55 places, 68 transitions, 593 flow [2022-12-06 05:37:11,966 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:11,966 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:11,966 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 68 transitions, 593 flow [2022-12-06 05:37:11,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 68 transitions, 593 flow [2022-12-06 05:37:11,978 INFO L130 PetriNetUnfolder]: 73/207 cut-off events. [2022-12-06 05:37:11,978 INFO L131 PetriNetUnfolder]: For 705/772 co-relation queries the response was YES. [2022-12-06 05:37:11,979 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 05:37:11,980 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 68 transitions, 593 flow [2022-12-06 05:37:11,980 INFO L188 LiptonReduction]: Number of co-enabled transitions 484 [2022-12-06 05:37:11,981 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:11,981 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 05:37:11,981 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 68 transitions, 593 flow [2022-12-06 05:37:11,981 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 05:37:11,981 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:11,981 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 05:37:11,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 05:37:11,982 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 05:37:11,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:11,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1359502275, now seen corresponding path program 1 times [2022-12-06 05:37:11,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:11,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426526997] [2022-12-06 05:37:11,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:11,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:12,379 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 05:37:12,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:12,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426526997] [2022-12-06 05:37:12,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426526997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:12,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:12,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:37:12,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44107280] [2022-12-06 05:37:12,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:12,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:37:12,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:12,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:37:12,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:37:12,380 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 05:37:12,380 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 05:37:12,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:12,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 05:37:12,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:12,565 INFO L130 PetriNetUnfolder]: 940/1438 cut-off events. [2022-12-06 05:37:12,566 INFO L131 PetriNetUnfolder]: For 5156/5300 co-relation queries the response was YES. [2022-12-06 05:37:12,568 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 05:37:12,574 INFO L137 encePairwiseOnDemand]: 18/34 looper letters, 74 selfloop transitions, 32 changer transitions 4/112 dead transitions. [2022-12-06 05:37:12,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 112 transitions, 1059 flow [2022-12-06 05:37:12,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:37:12,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:37:12,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-12-06 05:37:12,575 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5058823529411764 [2022-12-06 05:37:12,575 INFO L175 Difference]: Start difference. First operand has 54 places, 68 transitions, 593 flow. Second operand 5 states and 86 transitions. [2022-12-06 05:37:12,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 112 transitions, 1059 flow [2022-12-06 05:37:12,586 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 05:37:12,587 INFO L231 Difference]: Finished difference. Result has 57 places, 76 transitions, 755 flow [2022-12-06 05:37:12,587 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 05:37:12,587 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 27 predicate places. [2022-12-06 05:37:12,587 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:12,588 INFO L89 Accepts]: Start accepts. Operand has 57 places, 76 transitions, 755 flow [2022-12-06 05:37:12,589 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:12,589 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:12,589 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 76 transitions, 755 flow [2022-12-06 05:37:12,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 76 transitions, 755 flow [2022-12-06 05:37:12,604 INFO L130 PetriNetUnfolder]: 83/246 cut-off events. [2022-12-06 05:37:12,604 INFO L131 PetriNetUnfolder]: For 1063/1133 co-relation queries the response was YES. [2022-12-06 05:37:12,605 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 05:37:12,606 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 76 transitions, 755 flow [2022-12-06 05:37:12,606 INFO L188 LiptonReduction]: Number of co-enabled transitions 568 [2022-12-06 05:37:12,608 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:12,609 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 05:37:12,609 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 76 transitions, 755 flow [2022-12-06 05:37:12,609 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 05:37:12,609 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:12,609 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 05:37:12,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 05:37:12,609 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 05:37:12,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:12,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1164826203, now seen corresponding path program 1 times [2022-12-06 05:37:12,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:12,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549192697] [2022-12-06 05:37:12,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:12,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:13,129 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 05:37:13,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:13,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549192697] [2022-12-06 05:37:13,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549192697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:13,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:13,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:37:13,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526921969] [2022-12-06 05:37:13,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:13,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:37:13,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:13,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:37:13,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:37:13,131 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 05:37:13,132 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 05:37:13,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:13,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 05:37:13,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:13,391 INFO L130 PetriNetUnfolder]: 1066/1629 cut-off events. [2022-12-06 05:37:13,392 INFO L131 PetriNetUnfolder]: For 7283/7436 co-relation queries the response was YES. [2022-12-06 05:37:13,394 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 05:37:13,404 INFO L137 encePairwiseOnDemand]: 20/34 looper letters, 88 selfloop transitions, 22 changer transitions 3/115 dead transitions. [2022-12-06 05:37:13,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 115 transitions, 1179 flow [2022-12-06 05:37:13,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:37:13,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:37:13,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-12-06 05:37:13,405 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4019607843137255 [2022-12-06 05:37:13,405 INFO L175 Difference]: Start difference. First operand has 57 places, 76 transitions, 755 flow. Second operand 6 states and 82 transitions. [2022-12-06 05:37:13,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 115 transitions, 1179 flow [2022-12-06 05:37:13,429 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 05:37:13,433 INFO L231 Difference]: Finished difference. Result has 62 places, 83 transitions, 829 flow [2022-12-06 05:37:13,433 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 05:37:13,434 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 32 predicate places. [2022-12-06 05:37:13,434 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:13,434 INFO L89 Accepts]: Start accepts. Operand has 62 places, 83 transitions, 829 flow [2022-12-06 05:37:13,435 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:13,435 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:13,435 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 83 transitions, 829 flow [2022-12-06 05:37:13,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 83 transitions, 829 flow [2022-12-06 05:37:13,452 INFO L130 PetriNetUnfolder]: 99/286 cut-off events. [2022-12-06 05:37:13,452 INFO L131 PetriNetUnfolder]: For 1184/1261 co-relation queries the response was YES. [2022-12-06 05:37:13,453 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 05:37:13,454 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 83 transitions, 829 flow [2022-12-06 05:37:13,454 INFO L188 LiptonReduction]: Number of co-enabled transitions 630 [2022-12-06 05:37:13,455 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:13,456 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 05:37:13,456 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 83 transitions, 829 flow [2022-12-06 05:37:13,456 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 05:37:13,456 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:13,456 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 05:37:13,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 05:37:13,457 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 05:37:13,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:13,457 INFO L85 PathProgramCache]: Analyzing trace with hash 293782741, now seen corresponding path program 1 times [2022-12-06 05:37:13,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:13,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492368094] [2022-12-06 05:37:13,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:13,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:14,032 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 05:37:14,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:14,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492368094] [2022-12-06 05:37:14,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492368094] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:14,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:14,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:37:14,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959428669] [2022-12-06 05:37:14,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:14,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:37:14,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:14,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:37:14,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:37:14,034 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 05:37:14,034 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 05:37:14,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:14,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 05:37:14,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:14,373 INFO L130 PetriNetUnfolder]: 1244/1882 cut-off events. [2022-12-06 05:37:14,374 INFO L131 PetriNetUnfolder]: For 8495/8495 co-relation queries the response was YES. [2022-12-06 05:37:14,377 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 05:37:14,393 INFO L137 encePairwiseOnDemand]: 21/34 looper letters, 103 selfloop transitions, 23 changer transitions 5/131 dead transitions. [2022-12-06 05:37:14,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 131 transitions, 1363 flow [2022-12-06 05:37:14,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:37:14,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:37:14,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2022-12-06 05:37:14,394 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36134453781512604 [2022-12-06 05:37:14,394 INFO L175 Difference]: Start difference. First operand has 62 places, 83 transitions, 829 flow. Second operand 7 states and 86 transitions. [2022-12-06 05:37:14,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 131 transitions, 1363 flow [2022-12-06 05:37:14,410 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 05:37:14,412 INFO L231 Difference]: Finished difference. Result has 69 places, 92 transitions, 936 flow [2022-12-06 05:37:14,412 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 05:37:14,413 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 39 predicate places. [2022-12-06 05:37:14,413 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:14,413 INFO L89 Accepts]: Start accepts. Operand has 69 places, 92 transitions, 936 flow [2022-12-06 05:37:14,414 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:14,414 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:14,414 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 92 transitions, 936 flow [2022-12-06 05:37:14,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 92 transitions, 936 flow [2022-12-06 05:37:14,432 INFO L130 PetriNetUnfolder]: 106/301 cut-off events. [2022-12-06 05:37:14,432 INFO L131 PetriNetUnfolder]: For 1344/1437 co-relation queries the response was YES. [2022-12-06 05:37:14,433 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 05:37:14,435 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 92 transitions, 936 flow [2022-12-06 05:37:14,435 INFO L188 LiptonReduction]: Number of co-enabled transitions 690 [2022-12-06 05:37:14,442 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 05:37:14,489 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 05:37:14,567 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 05:37:14,632 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:37:14,633 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 220 [2022-12-06 05:37:14,633 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 91 transitions, 952 flow [2022-12-06 05:37:14,633 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 05:37:14,633 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:14,633 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 05:37:14,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 05:37:14,633 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 05:37:14,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:14,633 INFO L85 PathProgramCache]: Analyzing trace with hash 791534071, now seen corresponding path program 2 times [2022-12-06 05:37:14,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:14,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667727240] [2022-12-06 05:37:14,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:14,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:14,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:15,078 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 05:37:15,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:15,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667727240] [2022-12-06 05:37:15,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667727240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:15,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:15,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:37:15,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612882421] [2022-12-06 05:37:15,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:15,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:37:15,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:15,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:37:15,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:37:15,080 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 37 [2022-12-06 05:37:15,080 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 05:37:15,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:15,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 37 [2022-12-06 05:37:15,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:15,345 INFO L130 PetriNetUnfolder]: 1238/1890 cut-off events. [2022-12-06 05:37:15,345 INFO L131 PetriNetUnfolder]: For 9733/9886 co-relation queries the response was YES. [2022-12-06 05:37:15,348 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 05:37:15,354 INFO L137 encePairwiseOnDemand]: 22/37 looper letters, 86 selfloop transitions, 39 changer transitions 4/131 dead transitions. [2022-12-06 05:37:15,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 131 transitions, 1418 flow [2022-12-06 05:37:15,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:37:15,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:37:15,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2022-12-06 05:37:15,355 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4810810810810811 [2022-12-06 05:37:15,355 INFO L175 Difference]: Start difference. First operand has 68 places, 91 transitions, 952 flow. Second operand 5 states and 89 transitions. [2022-12-06 05:37:15,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 131 transitions, 1418 flow [2022-12-06 05:37:15,374 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 05:37:15,376 INFO L231 Difference]: Finished difference. Result has 70 places, 94 transitions, 1023 flow [2022-12-06 05:37:15,376 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 05:37:15,376 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 40 predicate places. [2022-12-06 05:37:15,376 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:15,376 INFO L89 Accepts]: Start accepts. Operand has 70 places, 94 transitions, 1023 flow [2022-12-06 05:37:15,378 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:15,378 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:15,378 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 94 transitions, 1023 flow [2022-12-06 05:37:15,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 94 transitions, 1023 flow [2022-12-06 05:37:15,398 INFO L130 PetriNetUnfolder]: 120/342 cut-off events. [2022-12-06 05:37:15,398 INFO L131 PetriNetUnfolder]: For 1669/1752 co-relation queries the response was YES. [2022-12-06 05:37:15,399 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 05:37:15,401 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 94 transitions, 1023 flow [2022-12-06 05:37:15,401 INFO L188 LiptonReduction]: Number of co-enabled transitions 718 [2022-12-06 05:37:15,402 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:15,403 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 05:37:15,403 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 94 transitions, 1023 flow [2022-12-06 05:37:15,403 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 05:37:15,403 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:15,403 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 05:37:15,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 05:37:15,404 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 05:37:15,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:15,404 INFO L85 PathProgramCache]: Analyzing trace with hash -2044737383, now seen corresponding path program 1 times [2022-12-06 05:37:15,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:15,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331709365] [2022-12-06 05:37:15,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:15,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:15,444 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 05:37:15,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:15,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331709365] [2022-12-06 05:37:15,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331709365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:15,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:15,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:37:15,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871850744] [2022-12-06 05:37:15,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:15,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:37:15,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:15,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:37:15,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:37:15,446 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 37 [2022-12-06 05:37:15,446 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 05:37:15,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:15,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 37 [2022-12-06 05:37:15,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:15,672 INFO L130 PetriNetUnfolder]: 1586/2424 cut-off events. [2022-12-06 05:37:15,673 INFO L131 PetriNetUnfolder]: For 13935/14022 co-relation queries the response was YES. [2022-12-06 05:37:15,677 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 05:37:15,684 INFO L137 encePairwiseOnDemand]: 34/37 looper letters, 114 selfloop transitions, 1 changer transitions 0/117 dead transitions. [2022-12-06 05:37:15,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 117 transitions, 1396 flow [2022-12-06 05:37:15,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:37:15,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:37:15,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-12-06 05:37:15,685 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6126126126126126 [2022-12-06 05:37:15,685 INFO L175 Difference]: Start difference. First operand has 70 places, 94 transitions, 1023 flow. Second operand 3 states and 68 transitions. [2022-12-06 05:37:15,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 117 transitions, 1396 flow [2022-12-06 05:37:15,699 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 05:37:15,701 INFO L231 Difference]: Finished difference. Result has 69 places, 92 transitions, 940 flow [2022-12-06 05:37:15,701 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 05:37:15,701 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 39 predicate places. [2022-12-06 05:37:15,701 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:15,701 INFO L89 Accepts]: Start accepts. Operand has 69 places, 92 transitions, 940 flow [2022-12-06 05:37:15,702 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:15,702 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:15,702 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 92 transitions, 940 flow [2022-12-06 05:37:15,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 92 transitions, 940 flow [2022-12-06 05:37:15,725 INFO L130 PetriNetUnfolder]: 139/407 cut-off events. [2022-12-06 05:37:15,725 INFO L131 PetriNetUnfolder]: For 1506/1589 co-relation queries the response was YES. [2022-12-06 05:37:15,726 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 05:37:15,728 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 92 transitions, 940 flow [2022-12-06 05:37:15,728 INFO L188 LiptonReduction]: Number of co-enabled transitions 710 [2022-12-06 05:37:15,728 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:15,729 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 05:37:15,729 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 92 transitions, 940 flow [2022-12-06 05:37:15,729 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 05:37:15,729 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:15,729 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 05:37:15,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 05:37:15,729 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 05:37:15,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:15,730 INFO L85 PathProgramCache]: Analyzing trace with hash 998026839, now seen corresponding path program 2 times [2022-12-06 05:37:15,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:15,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103813723] [2022-12-06 05:37:15,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:15,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:16,201 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 05:37:16,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:16,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103813723] [2022-12-06 05:37:16,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103813723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:16,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:16,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:37:16,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641885213] [2022-12-06 05:37:16,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:16,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:37:16,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:16,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:37:16,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:37:16,204 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 05:37:16,204 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 05:37:16,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:16,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 05:37:16,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:16,555 INFO L130 PetriNetUnfolder]: 1702/2557 cut-off events. [2022-12-06 05:37:16,555 INFO L131 PetriNetUnfolder]: For 12270/12270 co-relation queries the response was YES. [2022-12-06 05:37:16,562 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 05:37:16,572 INFO L137 encePairwiseOnDemand]: 23/35 looper letters, 99 selfloop transitions, 21 changer transitions 7/127 dead transitions. [2022-12-06 05:37:16,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 127 transitions, 1382 flow [2022-12-06 05:37:16,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:37:16,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:37:16,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-12-06 05:37:16,574 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3142857142857143 [2022-12-06 05:37:16,574 INFO L175 Difference]: Start difference. First operand has 69 places, 92 transitions, 940 flow. Second operand 7 states and 77 transitions. [2022-12-06 05:37:16,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 127 transitions, 1382 flow [2022-12-06 05:37:16,606 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 05:37:16,609 INFO L231 Difference]: Finished difference. Result has 76 places, 96 transitions, 1027 flow [2022-12-06 05:37:16,609 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 05:37:16,610 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 46 predicate places. [2022-12-06 05:37:16,611 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:16,611 INFO L89 Accepts]: Start accepts. Operand has 76 places, 96 transitions, 1027 flow [2022-12-06 05:37:16,612 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:16,612 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:16,612 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 96 transitions, 1027 flow [2022-12-06 05:37:16,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 96 transitions, 1027 flow [2022-12-06 05:37:16,646 INFO L130 PetriNetUnfolder]: 144/421 cut-off events. [2022-12-06 05:37:16,647 INFO L131 PetriNetUnfolder]: For 1715/1798 co-relation queries the response was YES. [2022-12-06 05:37:16,649 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 05:37:16,652 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 96 transitions, 1027 flow [2022-12-06 05:37:16,652 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:37:16,659 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 05:37:16,724 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 05:37:16,784 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:16,785 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:37:16,785 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 95 transitions, 1034 flow [2022-12-06 05:37:16,785 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 05:37:16,785 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:16,785 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 05:37:16,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 05:37:16,785 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 05:37:16,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:16,788 INFO L85 PathProgramCache]: Analyzing trace with hash 702707311, now seen corresponding path program 1 times [2022-12-06 05:37:16,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:16,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635163415] [2022-12-06 05:37:16,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:16,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:16,834 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 05:37:16,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:16,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635163415] [2022-12-06 05:37:16,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635163415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:16,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:16,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:37:16,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050473348] [2022-12-06 05:37:16,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:16,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:37:16,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:16,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:37:16,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:37:16,836 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:37:16,836 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 05:37:16,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:16,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:37:16,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:17,137 INFO L130 PetriNetUnfolder]: 1568/2381 cut-off events. [2022-12-06 05:37:17,137 INFO L131 PetriNetUnfolder]: For 12877/12877 co-relation queries the response was YES. [2022-12-06 05:37:17,141 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 05:37:17,149 INFO L137 encePairwiseOnDemand]: 29/37 looper letters, 128 selfloop transitions, 10 changer transitions 7/145 dead transitions. [2022-12-06 05:37:17,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 145 transitions, 1606 flow [2022-12-06 05:37:17,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:37:17,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:37:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2022-12-06 05:37:17,150 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5351351351351351 [2022-12-06 05:37:17,150 INFO L175 Difference]: Start difference. First operand has 75 places, 95 transitions, 1034 flow. Second operand 5 states and 99 transitions. [2022-12-06 05:37:17,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 145 transitions, 1606 flow [2022-12-06 05:37:17,167 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 05:37:17,168 INFO L231 Difference]: Finished difference. Result has 78 places, 89 transitions, 955 flow [2022-12-06 05:37:17,169 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 05:37:17,169 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 48 predicate places. [2022-12-06 05:37:17,169 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:17,169 INFO L89 Accepts]: Start accepts. Operand has 78 places, 89 transitions, 955 flow [2022-12-06 05:37:17,169 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:17,170 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:17,170 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 89 transitions, 955 flow [2022-12-06 05:37:17,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 89 transitions, 955 flow [2022-12-06 05:37:17,192 INFO L130 PetriNetUnfolder]: 125/364 cut-off events. [2022-12-06 05:37:17,192 INFO L131 PetriNetUnfolder]: For 1429/1470 co-relation queries the response was YES. [2022-12-06 05:37:17,193 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 05:37:17,194 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 89 transitions, 955 flow [2022-12-06 05:37:17,195 INFO L188 LiptonReduction]: Number of co-enabled transitions 692 [2022-12-06 05:37:17,196 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:17,197 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 05:37:17,197 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 89 transitions, 955 flow [2022-12-06 05:37:17,197 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 05:37:17,197 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:17,197 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 05:37:17,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 05:37:17,197 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 05:37:17,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:17,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1408419310, now seen corresponding path program 1 times [2022-12-06 05:37:17,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:17,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054423941] [2022-12-06 05:37:17,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:17,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:17,271 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 05:37:17,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:17,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054423941] [2022-12-06 05:37:17,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054423941] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:17,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:17,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:37:17,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113810699] [2022-12-06 05:37:17,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:17,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:37:17,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:17,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:37:17,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:37:17,273 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 05:37:17,273 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 05:37:17,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:17,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 05:37:17,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:17,528 INFO L130 PetriNetUnfolder]: 1528/2324 cut-off events. [2022-12-06 05:37:17,529 INFO L131 PetriNetUnfolder]: For 13925/14015 co-relation queries the response was YES. [2022-12-06 05:37:17,534 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 05:37:17,541 INFO L137 encePairwiseOnDemand]: 29/34 looper letters, 124 selfloop transitions, 4 changer transitions 0/130 dead transitions. [2022-12-06 05:37:17,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 130 transitions, 1511 flow [2022-12-06 05:37:17,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:37:17,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:37:17,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-12-06 05:37:17,543 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6029411764705882 [2022-12-06 05:37:17,543 INFO L175 Difference]: Start difference. First operand has 77 places, 89 transitions, 955 flow. Second operand 4 states and 82 transitions. [2022-12-06 05:37:17,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 130 transitions, 1511 flow [2022-12-06 05:37:17,560 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 05:37:17,561 INFO L231 Difference]: Finished difference. Result has 81 places, 91 transitions, 992 flow [2022-12-06 05:37:17,561 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 05:37:17,562 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 51 predicate places. [2022-12-06 05:37:17,562 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:17,562 INFO L89 Accepts]: Start accepts. Operand has 81 places, 91 transitions, 992 flow [2022-12-06 05:37:17,562 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:17,563 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:17,563 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 91 transitions, 992 flow [2022-12-06 05:37:17,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 91 transitions, 992 flow [2022-12-06 05:37:17,595 INFO L130 PetriNetUnfolder]: 143/403 cut-off events. [2022-12-06 05:37:17,595 INFO L131 PetriNetUnfolder]: For 1720/1781 co-relation queries the response was YES. [2022-12-06 05:37:17,596 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 05:37:17,598 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 91 transitions, 992 flow [2022-12-06 05:37:17,598 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:37:17,600 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:17,602 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-06 05:37:17,602 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 91 transitions, 992 flow [2022-12-06 05:37:17,602 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 05:37:17,602 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:17,602 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 05:37:17,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 05:37:17,602 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 05:37:17,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:17,603 INFO L85 PathProgramCache]: Analyzing trace with hash 569166126, now seen corresponding path program 1 times [2022-12-06 05:37:17,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:17,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664867736] [2022-12-06 05:37:17,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:17,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:17,646 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 05:37:17,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:17,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664867736] [2022-12-06 05:37:17,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664867736] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:17,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:17,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:37:17,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279196231] [2022-12-06 05:37:17,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:17,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:37:17,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:17,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:37:17,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:37:17,647 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 05:37:17,647 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 05:37:17,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:17,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 05:37:17,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:17,859 INFO L130 PetriNetUnfolder]: 1427/2222 cut-off events. [2022-12-06 05:37:17,859 INFO L131 PetriNetUnfolder]: For 15700/15839 co-relation queries the response was YES. [2022-12-06 05:37:17,864 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 05:37:17,871 INFO L137 encePairwiseOnDemand]: 30/34 looper letters, 108 selfloop transitions, 5 changer transitions 1/116 dead transitions. [2022-12-06 05:37:17,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 116 transitions, 1370 flow [2022-12-06 05:37:17,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:37:17,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:37:17,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-12-06 05:37:17,872 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5661764705882353 [2022-12-06 05:37:17,872 INFO L175 Difference]: Start difference. First operand has 81 places, 91 transitions, 992 flow. Second operand 4 states and 77 transitions. [2022-12-06 05:37:17,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 116 transitions, 1370 flow [2022-12-06 05:37:17,889 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 05:37:17,891 INFO L231 Difference]: Finished difference. Result has 83 places, 84 transitions, 933 flow [2022-12-06 05:37:17,891 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 05:37:17,891 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 53 predicate places. [2022-12-06 05:37:17,891 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:17,891 INFO L89 Accepts]: Start accepts. Operand has 83 places, 84 transitions, 933 flow [2022-12-06 05:37:17,892 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:17,892 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:17,892 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 84 transitions, 933 flow [2022-12-06 05:37:17,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 84 transitions, 933 flow [2022-12-06 05:37:17,915 INFO L130 PetriNetUnfolder]: 119/368 cut-off events. [2022-12-06 05:37:17,915 INFO L131 PetriNetUnfolder]: For 1587/1644 co-relation queries the response was YES. [2022-12-06 05:37:17,916 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 05:37:17,918 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 84 transitions, 933 flow [2022-12-06 05:37:17,918 INFO L188 LiptonReduction]: Number of co-enabled transitions 656 [2022-12-06 05:37:18,185 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:18,186 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 295 [2022-12-06 05:37:18,186 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 84 transitions, 944 flow [2022-12-06 05:37:18,186 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 05:37:18,186 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:18,186 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 05:37:18,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 05:37:18,186 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 05:37:18,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:18,186 INFO L85 PathProgramCache]: Analyzing trace with hash 2141029274, now seen corresponding path program 1 times [2022-12-06 05:37:18,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:18,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247163040] [2022-12-06 05:37:18,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:18,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:18,264 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 05:37:18,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:18,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247163040] [2022-12-06 05:37:18,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247163040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:18,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:18,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:37:18,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999196041] [2022-12-06 05:37:18,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:18,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:37:18,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:18,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:37:18,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:37:18,266 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 05:37:18,266 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 05:37:18,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:18,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 05:37:18,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:18,499 INFO L130 PetriNetUnfolder]: 1380/2175 cut-off events. [2022-12-06 05:37:18,499 INFO L131 PetriNetUnfolder]: For 14458/14458 co-relation queries the response was YES. [2022-12-06 05:37:18,503 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 05:37:18,509 INFO L137 encePairwiseOnDemand]: 31/39 looper letters, 99 selfloop transitions, 12 changer transitions 5/116 dead transitions. [2022-12-06 05:37:18,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 116 transitions, 1380 flow [2022-12-06 05:37:18,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:37:18,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:37:18,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-12-06 05:37:18,510 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.532051282051282 [2022-12-06 05:37:18,510 INFO L175 Difference]: Start difference. First operand has 83 places, 84 transitions, 944 flow. Second operand 4 states and 83 transitions. [2022-12-06 05:37:18,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 116 transitions, 1380 flow [2022-12-06 05:37:18,535 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 05:37:18,539 INFO L231 Difference]: Finished difference. Result has 84 places, 75 transitions, 851 flow [2022-12-06 05:37:18,539 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 05:37:18,539 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 54 predicate places. [2022-12-06 05:37:18,539 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:18,539 INFO L89 Accepts]: Start accepts. Operand has 84 places, 75 transitions, 851 flow [2022-12-06 05:37:18,540 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:18,540 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:18,540 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 75 transitions, 851 flow [2022-12-06 05:37:18,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 75 transitions, 851 flow [2022-12-06 05:37:18,560 INFO L130 PetriNetUnfolder]: 90/319 cut-off events. [2022-12-06 05:37:18,560 INFO L131 PetriNetUnfolder]: For 1594/1643 co-relation queries the response was YES. [2022-12-06 05:37:18,561 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 05:37:18,563 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 75 transitions, 851 flow [2022-12-06 05:37:18,563 INFO L188 LiptonReduction]: Number of co-enabled transitions 560 [2022-12-06 05:37:18,563 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:18,564 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 05:37:18,564 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 75 transitions, 851 flow [2022-12-06 05:37:18,564 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 05:37:18,564 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:18,564 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 05:37:18,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 05:37:18,564 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 05:37:18,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:18,565 INFO L85 PathProgramCache]: Analyzing trace with hash 686814983, now seen corresponding path program 1 times [2022-12-06 05:37:18,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:18,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018380559] [2022-12-06 05:37:18,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:18,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:18,649 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 05:37:18,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:18,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018380559] [2022-12-06 05:37:18,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018380559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:18,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:18,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:37:18,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883203485] [2022-12-06 05:37:18,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:18,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:37:18,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:18,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:37:18,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:37:18,652 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 05:37:18,652 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 05:37:18,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:18,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 05:37:18,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:18,844 INFO L130 PetriNetUnfolder]: 1376/2195 cut-off events. [2022-12-06 05:37:18,844 INFO L131 PetriNetUnfolder]: For 15072/15072 co-relation queries the response was YES. [2022-12-06 05:37:18,848 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 05:37:18,855 INFO L137 encePairwiseOnDemand]: 35/39 looper letters, 95 selfloop transitions, 2 changer transitions 1/98 dead transitions. [2022-12-06 05:37:18,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 98 transitions, 1182 flow [2022-12-06 05:37:18,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:37:18,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:37:18,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-12-06 05:37:18,856 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2022-12-06 05:37:18,856 INFO L175 Difference]: Start difference. First operand has 84 places, 75 transitions, 851 flow. Second operand 3 states and 69 transitions. [2022-12-06 05:37:18,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 98 transitions, 1182 flow [2022-12-06 05:37:18,880 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 05:37:18,882 INFO L231 Difference]: Finished difference. Result has 84 places, 73 transitions, 801 flow [2022-12-06 05:37:18,882 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 05:37:18,882 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 54 predicate places. [2022-12-06 05:37:18,882 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:18,883 INFO L89 Accepts]: Start accepts. Operand has 84 places, 73 transitions, 801 flow [2022-12-06 05:37:18,884 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:18,885 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:18,885 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 73 transitions, 801 flow [2022-12-06 05:37:18,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 73 transitions, 801 flow [2022-12-06 05:37:18,904 INFO L130 PetriNetUnfolder]: 86/315 cut-off events. [2022-12-06 05:37:18,904 INFO L131 PetriNetUnfolder]: For 1428/1476 co-relation queries the response was YES. [2022-12-06 05:37:18,905 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 05:37:18,906 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 73 transitions, 801 flow [2022-12-06 05:37:18,906 INFO L188 LiptonReduction]: Number of co-enabled transitions 542 [2022-12-06 05:37:18,907 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:18,908 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-06 05:37:18,908 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 73 transitions, 801 flow [2022-12-06 05:37:18,908 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 05:37:18,908 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:18,909 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 05:37:18,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 05:37:18,909 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 05:37:18,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:18,909 INFO L85 PathProgramCache]: Analyzing trace with hash 586471010, now seen corresponding path program 1 times [2022-12-06 05:37:18,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:18,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404009919] [2022-12-06 05:37:18,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:18,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:18,948 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 05:37:18,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:18,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404009919] [2022-12-06 05:37:18,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404009919] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:18,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:18,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:37:18,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516857444] [2022-12-06 05:37:18,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:18,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:37:18,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:18,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:37:18,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:37:18,949 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:37:18,949 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 05:37:18,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:18,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:37:18,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:19,183 INFO L130 PetriNetUnfolder]: 1443/2302 cut-off events. [2022-12-06 05:37:19,184 INFO L131 PetriNetUnfolder]: For 14754/14754 co-relation queries the response was YES. [2022-12-06 05:37:19,189 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 05:37:19,195 INFO L137 encePairwiseOnDemand]: 31/37 looper letters, 107 selfloop transitions, 4 changer transitions 6/117 dead transitions. [2022-12-06 05:37:19,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 117 transitions, 1301 flow [2022-12-06 05:37:19,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:37:19,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:37:19,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2022-12-06 05:37:19,196 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4810810810810811 [2022-12-06 05:37:19,196 INFO L175 Difference]: Start difference. First operand has 84 places, 73 transitions, 801 flow. Second operand 5 states and 89 transitions. [2022-12-06 05:37:19,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 117 transitions, 1301 flow [2022-12-06 05:37:19,224 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 05:37:19,225 INFO L231 Difference]: Finished difference. Result has 89 places, 70 transitions, 739 flow [2022-12-06 05:37:19,225 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 05:37:19,225 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 59 predicate places. [2022-12-06 05:37:19,226 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:19,226 INFO L89 Accepts]: Start accepts. Operand has 89 places, 70 transitions, 739 flow [2022-12-06 05:37:19,226 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:19,226 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:19,226 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 70 transitions, 739 flow [2022-12-06 05:37:19,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 70 transitions, 739 flow [2022-12-06 05:37:19,244 INFO L130 PetriNetUnfolder]: 82/295 cut-off events. [2022-12-06 05:37:19,245 INFO L131 PetriNetUnfolder]: For 1368/1414 co-relation queries the response was YES. [2022-12-06 05:37:19,245 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 05:37:19,247 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 70 transitions, 739 flow [2022-12-06 05:37:19,247 INFO L188 LiptonReduction]: Number of co-enabled transitions 530 [2022-12-06 05:37:19,247 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 05:37:19,278 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:19,278 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-06 05:37:19,278 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 70 transitions, 750 flow [2022-12-06 05:37:19,278 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 05:37:19,278 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:19,278 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 05:37:19,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 05:37:19,279 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 05:37:19,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:19,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1829278939, now seen corresponding path program 1 times [2022-12-06 05:37:19,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:19,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257554495] [2022-12-06 05:37:19,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:19,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:19,338 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 05:37:19,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:19,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257554495] [2022-12-06 05:37:19,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257554495] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:19,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:19,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:37:19,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536877903] [2022-12-06 05:37:19,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:19,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:37:19,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:19,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:37:19,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:37:19,340 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 05:37:19,341 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 05:37:19,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:19,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 05:37:19,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:19,552 INFO L130 PetriNetUnfolder]: 1299/2098 cut-off events. [2022-12-06 05:37:19,552 INFO L131 PetriNetUnfolder]: For 13364/13364 co-relation queries the response was YES. [2022-12-06 05:37:19,557 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 05:37:19,563 INFO L137 encePairwiseOnDemand]: 29/38 looper letters, 103 selfloop transitions, 7 changer transitions 2/112 dead transitions. [2022-12-06 05:37:19,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 112 transitions, 1226 flow [2022-12-06 05:37:19,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:37:19,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:37:19,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-12-06 05:37:19,564 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4631578947368421 [2022-12-06 05:37:19,564 INFO L175 Difference]: Start difference. First operand has 89 places, 70 transitions, 750 flow. Second operand 5 states and 88 transitions. [2022-12-06 05:37:19,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 112 transitions, 1226 flow [2022-12-06 05:37:19,590 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 05:37:19,591 INFO L231 Difference]: Finished difference. Result has 92 places, 68 transitions, 729 flow [2022-12-06 05:37:19,592 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 05:37:19,592 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 62 predicate places. [2022-12-06 05:37:19,592 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:19,592 INFO L89 Accepts]: Start accepts. Operand has 92 places, 68 transitions, 729 flow [2022-12-06 05:37:19,593 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:19,593 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:19,593 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 68 transitions, 729 flow [2022-12-06 05:37:19,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 68 transitions, 729 flow [2022-12-06 05:37:19,622 INFO L130 PetriNetUnfolder]: 79/287 cut-off events. [2022-12-06 05:37:19,623 INFO L131 PetriNetUnfolder]: For 1384/1427 co-relation queries the response was YES. [2022-12-06 05:37:19,623 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 05:37:19,625 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 68 transitions, 729 flow [2022-12-06 05:37:19,625 INFO L188 LiptonReduction]: Number of co-enabled transitions 500 [2022-12-06 05:37:19,626 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:19,627 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 05:37:19,627 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 68 transitions, 729 flow [2022-12-06 05:37:19,627 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 05:37:19,627 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:19,627 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 05:37:19,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 05:37:19,627 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 05:37:19,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:19,628 INFO L85 PathProgramCache]: Analyzing trace with hash 31418726, now seen corresponding path program 1 times [2022-12-06 05:37:19,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:19,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330390056] [2022-12-06 05:37:19,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:19,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:19,696 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 05:37:19,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:19,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330390056] [2022-12-06 05:37:19,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330390056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:19,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:19,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:37:19,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160360872] [2022-12-06 05:37:19,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:19,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:37:19,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:19,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:37:19,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:37:19,698 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 05:37:19,698 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 05:37:19,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:19,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 05:37:19,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:19,896 INFO L130 PetriNetUnfolder]: 1223/1990 cut-off events. [2022-12-06 05:37:19,896 INFO L131 PetriNetUnfolder]: For 12798/12798 co-relation queries the response was YES. [2022-12-06 05:37:19,900 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 05:37:19,906 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 102 selfloop transitions, 4 changer transitions 4/110 dead transitions. [2022-12-06 05:37:19,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 110 transitions, 1205 flow [2022-12-06 05:37:19,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:37:19,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:37:19,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-12-06 05:37:19,906 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49142857142857144 [2022-12-06 05:37:19,906 INFO L175 Difference]: Start difference. First operand has 92 places, 68 transitions, 729 flow. Second operand 5 states and 86 transitions. [2022-12-06 05:37:19,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 110 transitions, 1205 flow [2022-12-06 05:37:19,924 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 05:37:19,925 INFO L231 Difference]: Finished difference. Result has 95 places, 64 transitions, 670 flow [2022-12-06 05:37:19,925 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 05:37:19,926 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 65 predicate places. [2022-12-06 05:37:19,926 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:19,926 INFO L89 Accepts]: Start accepts. Operand has 95 places, 64 transitions, 670 flow [2022-12-06 05:37:19,927 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:19,927 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:19,927 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 64 transitions, 670 flow [2022-12-06 05:37:19,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 64 transitions, 670 flow [2022-12-06 05:37:19,945 INFO L130 PetriNetUnfolder]: 72/276 cut-off events. [2022-12-06 05:37:19,945 INFO L131 PetriNetUnfolder]: For 1318/1361 co-relation queries the response was YES. [2022-12-06 05:37:19,946 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 05:37:19,947 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 64 transitions, 670 flow [2022-12-06 05:37:19,947 INFO L188 LiptonReduction]: Number of co-enabled transitions 464 [2022-12-06 05:37:19,957 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 05:37:20,090 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 05:37:20,195 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:37:20,196 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 270 [2022-12-06 05:37:20,196 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 63 transitions, 696 flow [2022-12-06 05:37:20,196 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 05:37:20,196 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:20,196 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 05:37:20,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 05:37:20,196 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 05:37:20,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:20,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1696855821, now seen corresponding path program 1 times [2022-12-06 05:37:20,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:20,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069317575] [2022-12-06 05:37:20,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:20,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:20,248 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 05:37:20,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:20,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069317575] [2022-12-06 05:37:20,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069317575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:20,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:20,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:37:20,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248207009] [2022-12-06 05:37:20,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:20,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:37:20,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:20,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:37:20,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:37:20,250 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:37:20,250 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 05:37:20,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:20,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:37:20,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:20,568 INFO L130 PetriNetUnfolder]: 1085/1798 cut-off events. [2022-12-06 05:37:20,569 INFO L131 PetriNetUnfolder]: For 12370/12370 co-relation queries the response was YES. [2022-12-06 05:37:20,572 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 05:37:20,576 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 120 selfloop transitions, 10 changer transitions 9/139 dead transitions. [2022-12-06 05:37:20,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 139 transitions, 1364 flow [2022-12-06 05:37:20,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:37:20,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:37:20,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 124 transitions. [2022-12-06 05:37:20,578 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37237237237237236 [2022-12-06 05:37:20,578 INFO L175 Difference]: Start difference. First operand has 93 places, 63 transitions, 696 flow. Second operand 9 states and 124 transitions. [2022-12-06 05:37:20,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 139 transitions, 1364 flow [2022-12-06 05:37:20,598 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 05:37:20,599 INFO L231 Difference]: Finished difference. Result has 93 places, 53 transitions, 511 flow [2022-12-06 05:37:20,599 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 05:37:20,600 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 63 predicate places. [2022-12-06 05:37:20,600 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:20,600 INFO L89 Accepts]: Start accepts. Operand has 93 places, 53 transitions, 511 flow [2022-12-06 05:37:20,600 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:20,600 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:20,600 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 53 transitions, 511 flow [2022-12-06 05:37:20,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 53 transitions, 511 flow [2022-12-06 05:37:20,613 INFO L130 PetriNetUnfolder]: 64/206 cut-off events. [2022-12-06 05:37:20,613 INFO L131 PetriNetUnfolder]: For 735/778 co-relation queries the response was YES. [2022-12-06 05:37:20,614 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 05:37:20,615 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 53 transitions, 511 flow [2022-12-06 05:37:20,615 INFO L188 LiptonReduction]: Number of co-enabled transitions 374 [2022-12-06 05:37:20,615 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:20,617 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 05:37:20,617 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 53 transitions, 511 flow [2022-12-06 05:37:20,617 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 05:37:20,617 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:20,617 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 05:37:20,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 05:37:20,617 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 05:37:20,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:20,617 INFO L85 PathProgramCache]: Analyzing trace with hash -622438843, now seen corresponding path program 1 times [2022-12-06 05:37:20,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:20,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101855081] [2022-12-06 05:37:20,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:20,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:20,697 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 05:37:20,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:20,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101855081] [2022-12-06 05:37:20,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101855081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:20,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:20,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:37:20,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741398850] [2022-12-06 05:37:20,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:20,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:37:20,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:20,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:37:20,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:37:20,699 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 05:37:20,699 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 05:37:20,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:20,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 05:37:20,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:20,846 INFO L130 PetriNetUnfolder]: 780/1217 cut-off events. [2022-12-06 05:37:20,846 INFO L131 PetriNetUnfolder]: For 7550/7550 co-relation queries the response was YES. [2022-12-06 05:37:20,848 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 05:37:20,852 INFO L137 encePairwiseOnDemand]: 30/36 looper letters, 84 selfloop transitions, 4 changer transitions 2/90 dead transitions. [2022-12-06 05:37:20,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 90 transitions, 871 flow [2022-12-06 05:37:20,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:37:20,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:37:20,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-12-06 05:37:20,853 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4388888888888889 [2022-12-06 05:37:20,853 INFO L175 Difference]: Start difference. First operand has 87 places, 53 transitions, 511 flow. Second operand 5 states and 79 transitions. [2022-12-06 05:37:20,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 90 transitions, 871 flow [2022-12-06 05:37:20,862 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 05:37:20,863 INFO L231 Difference]: Finished difference. Result has 78 places, 49 transitions, 389 flow [2022-12-06 05:37:20,864 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 05:37:20,864 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 48 predicate places. [2022-12-06 05:37:20,864 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:20,864 INFO L89 Accepts]: Start accepts. Operand has 78 places, 49 transitions, 389 flow [2022-12-06 05:37:20,864 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:20,864 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:20,865 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 49 transitions, 389 flow [2022-12-06 05:37:20,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 49 transitions, 389 flow [2022-12-06 05:37:20,875 INFO L130 PetriNetUnfolder]: 61/191 cut-off events. [2022-12-06 05:37:20,876 INFO L131 PetriNetUnfolder]: For 503/544 co-relation queries the response was YES. [2022-12-06 05:37:20,876 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 05:37:20,877 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 49 transitions, 389 flow [2022-12-06 05:37:20,877 INFO L188 LiptonReduction]: Number of co-enabled transitions 354 [2022-12-06 05:37:20,877 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:20,878 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 05:37:20,878 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 49 transitions, 389 flow [2022-12-06 05:37:20,878 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 05:37:20,878 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:20,878 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 05:37:20,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 05:37:20,878 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 05:37:20,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:20,879 INFO L85 PathProgramCache]: Analyzing trace with hash 828824796, now seen corresponding path program 1 times [2022-12-06 05:37:20,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:20,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952206327] [2022-12-06 05:37:20,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:20,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:21,400 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 05:37:21,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:21,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952206327] [2022-12-06 05:37:21,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952206327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:21,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:21,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:37:21,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395590069] [2022-12-06 05:37:21,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:21,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:37:21,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:21,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:37:21,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:37:21,402 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 05:37:21,402 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 05:37:21,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:21,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 05:37:21,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:21,620 INFO L130 PetriNetUnfolder]: 719/1126 cut-off events. [2022-12-06 05:37:21,621 INFO L131 PetriNetUnfolder]: For 4765/4858 co-relation queries the response was YES. [2022-12-06 05:37:21,623 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 05:37:21,626 INFO L137 encePairwiseOnDemand]: 24/34 looper letters, 40 selfloop transitions, 8 changer transitions 26/76 dead transitions. [2022-12-06 05:37:21,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 76 transitions, 653 flow [2022-12-06 05:37:21,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:37:21,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:37:21,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-12-06 05:37:21,627 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3431372549019608 [2022-12-06 05:37:21,627 INFO L175 Difference]: Start difference. First operand has 78 places, 49 transitions, 389 flow. Second operand 6 states and 70 transitions. [2022-12-06 05:37:21,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 76 transitions, 653 flow [2022-12-06 05:37:21,634 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 05:37:21,635 INFO L231 Difference]: Finished difference. Result has 79 places, 43 transitions, 317 flow [2022-12-06 05:37:21,635 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 05:37:21,635 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 49 predicate places. [2022-12-06 05:37:21,635 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:21,635 INFO L89 Accepts]: Start accepts. Operand has 79 places, 43 transitions, 317 flow [2022-12-06 05:37:21,636 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:21,636 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:21,636 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 43 transitions, 317 flow [2022-12-06 05:37:21,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 43 transitions, 317 flow [2022-12-06 05:37:21,646 INFO L130 PetriNetUnfolder]: 61/165 cut-off events. [2022-12-06 05:37:21,646 INFO L131 PetriNetUnfolder]: For 393/432 co-relation queries the response was YES. [2022-12-06 05:37:21,646 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 05:37:21,647 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 43 transitions, 317 flow [2022-12-06 05:37:21,647 INFO L188 LiptonReduction]: Number of co-enabled transitions 310 [2022-12-06 05:37:21,648 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:21,649 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 05:37:21,649 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 43 transitions, 317 flow [2022-12-06 05:37:21,649 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 05:37:21,649 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:21,649 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 05:37:21,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 05:37:21,650 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 05:37:21,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:21,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1708469611, now seen corresponding path program 1 times [2022-12-06 05:37:21,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:21,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225848819] [2022-12-06 05:37:21,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:21,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:21,708 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 05:37:21,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:21,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225848819] [2022-12-06 05:37:21,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225848819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:21,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:21,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:37:21,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971646849] [2022-12-06 05:37:21,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:21,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:37:21,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:21,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:37:21,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:37:21,709 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 05:37:21,709 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 05:37:21,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:21,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 05:37:21,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:21,864 INFO L130 PetriNetUnfolder]: 880/1322 cut-off events. [2022-12-06 05:37:21,864 INFO L131 PetriNetUnfolder]: For 4552/4552 co-relation queries the response was YES. [2022-12-06 05:37:21,866 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 05:37:21,870 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 59 selfloop transitions, 16 changer transitions 0/75 dead transitions. [2022-12-06 05:37:21,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 75 transitions, 648 flow [2022-12-06 05:37:21,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:37:21,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:37:21,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-06 05:37:21,871 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3878787878787879 [2022-12-06 05:37:21,871 INFO L175 Difference]: Start difference. First operand has 68 places, 43 transitions, 317 flow. Second operand 5 states and 64 transitions. [2022-12-06 05:37:21,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 75 transitions, 648 flow [2022-12-06 05:37:21,881 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 05:37:21,882 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 362 flow [2022-12-06 05:37:21,882 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 05:37:21,885 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 32 predicate places. [2022-12-06 05:37:21,885 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:21,885 INFO L89 Accepts]: Start accepts. Operand has 62 places, 47 transitions, 362 flow [2022-12-06 05:37:21,885 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:21,885 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:21,886 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 47 transitions, 362 flow [2022-12-06 05:37:21,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 47 transitions, 362 flow [2022-12-06 05:37:21,897 INFO L130 PetriNetUnfolder]: 77/210 cut-off events. [2022-12-06 05:37:21,897 INFO L131 PetriNetUnfolder]: For 464/519 co-relation queries the response was YES. [2022-12-06 05:37:21,897 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 05:37:21,898 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 47 transitions, 362 flow [2022-12-06 05:37:21,899 INFO L188 LiptonReduction]: Number of co-enabled transitions 358 [2022-12-06 05:37:21,899 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:21,901 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 05:37:21,901 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 362 flow [2022-12-06 05:37:21,902 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 05:37:21,902 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:21,902 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 05:37:21,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 05:37:21,902 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 05:37:21,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:21,902 INFO L85 PathProgramCache]: Analyzing trace with hash 807789503, now seen corresponding path program 1 times [2022-12-06 05:37:21,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:21,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085308992] [2022-12-06 05:37:21,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:21,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:21,963 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 05:37:21,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:21,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085308992] [2022-12-06 05:37:21,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085308992] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:21,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:21,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:37:21,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400268974] [2022-12-06 05:37:21,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:21,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:37:21,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:21,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:37:21,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:37:21,965 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 05:37:21,965 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 05:37:21,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:21,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 05:37:21,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:22,103 INFO L130 PetriNetUnfolder]: 866/1294 cut-off events. [2022-12-06 05:37:22,103 INFO L131 PetriNetUnfolder]: For 4088/4088 co-relation queries the response was YES. [2022-12-06 05:37:22,105 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 05:37:22,110 INFO L137 encePairwiseOnDemand]: 27/33 looper letters, 62 selfloop transitions, 5 changer transitions 0/67 dead transitions. [2022-12-06 05:37:22,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 67 transitions, 575 flow [2022-12-06 05:37:22,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:37:22,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:37:22,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-12-06 05:37:22,111 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3393939393939394 [2022-12-06 05:37:22,111 INFO L175 Difference]: Start difference. First operand has 62 places, 47 transitions, 362 flow. Second operand 5 states and 56 transitions. [2022-12-06 05:37:22,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 67 transitions, 575 flow [2022-12-06 05:37:22,117 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 05:37:22,118 INFO L231 Difference]: Finished difference. Result has 64 places, 46 transitions, 362 flow [2022-12-06 05:37:22,118 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 05:37:22,120 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 34 predicate places. [2022-12-06 05:37:22,120 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:22,120 INFO L89 Accepts]: Start accepts. Operand has 64 places, 46 transitions, 362 flow [2022-12-06 05:37:22,121 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:22,121 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:22,121 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 46 transitions, 362 flow [2022-12-06 05:37:22,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 46 transitions, 362 flow [2022-12-06 05:37:22,132 INFO L130 PetriNetUnfolder]: 77/204 cut-off events. [2022-12-06 05:37:22,132 INFO L131 PetriNetUnfolder]: For 469/528 co-relation queries the response was YES. [2022-12-06 05:37:22,132 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 05:37:22,133 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 46 transitions, 362 flow [2022-12-06 05:37:22,133 INFO L188 LiptonReduction]: Number of co-enabled transitions 344 [2022-12-06 05:37:22,134 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:22,134 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 05:37:22,134 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 362 flow [2022-12-06 05:37:22,134 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 05:37:22,134 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:22,134 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 05:37:22,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-06 05:37:22,135 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 05:37:22,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:22,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1572366623, now seen corresponding path program 1 times [2022-12-06 05:37:22,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:22,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831470150] [2022-12-06 05:37:22,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:22,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:22,201 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 05:37:22,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:22,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831470150] [2022-12-06 05:37:22,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831470150] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:22,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:22,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:37:22,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950992023] [2022-12-06 05:37:22,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:22,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:37:22,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:22,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:37:22,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:37:22,202 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 05:37:22,203 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 05:37:22,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:22,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 05:37:22,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:22,345 INFO L130 PetriNetUnfolder]: 954/1428 cut-off events. [2022-12-06 05:37:22,345 INFO L131 PetriNetUnfolder]: For 4528/4528 co-relation queries the response was YES. [2022-12-06 05:37:22,347 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 05:37:22,351 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 62 selfloop transitions, 7 changer transitions 0/69 dead transitions. [2022-12-06 05:37:22,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 69 transitions, 613 flow [2022-12-06 05:37:22,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:37:22,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:37:22,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-06 05:37:22,352 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-06 05:37:22,352 INFO L175 Difference]: Start difference. First operand has 64 places, 46 transitions, 362 flow. Second operand 5 states and 55 transitions. [2022-12-06 05:37:22,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 69 transitions, 613 flow [2022-12-06 05:37:22,356 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 05:37:22,357 INFO L231 Difference]: Finished difference. Result has 66 places, 50 transitions, 413 flow [2022-12-06 05:37:22,357 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 05:37:22,358 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 36 predicate places. [2022-12-06 05:37:22,358 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:22,358 INFO L89 Accepts]: Start accepts. Operand has 66 places, 50 transitions, 413 flow [2022-12-06 05:37:22,358 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:22,358 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:22,359 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 50 transitions, 413 flow [2022-12-06 05:37:22,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 50 transitions, 413 flow [2022-12-06 05:37:22,371 INFO L130 PetriNetUnfolder]: 92/243 cut-off events. [2022-12-06 05:37:22,371 INFO L131 PetriNetUnfolder]: For 661/724 co-relation queries the response was YES. [2022-12-06 05:37:22,371 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 05:37:22,372 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 50 transitions, 413 flow [2022-12-06 05:37:22,373 INFO L188 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-06 05:37:22,373 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:22,373 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 05:37:22,373 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 50 transitions, 413 flow [2022-12-06 05:37:22,374 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 05:37:22,374 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:22,374 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 05:37:22,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-06 05:37:22,374 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 05:37:22,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:22,374 INFO L85 PathProgramCache]: Analyzing trace with hash 471555651, now seen corresponding path program 2 times [2022-12-06 05:37:22,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:22,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822460246] [2022-12-06 05:37:22,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:22,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:22,432 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 05:37:22,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:22,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822460246] [2022-12-06 05:37:22,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822460246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:22,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:22,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:37:22,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367477099] [2022-12-06 05:37:22,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:22,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:37:22,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:22,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:37:22,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:37:22,433 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 05:37:22,433 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 05:37:22,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:22,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 05:37:22,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:22,578 INFO L130 PetriNetUnfolder]: 940/1400 cut-off events. [2022-12-06 05:37:22,578 INFO L131 PetriNetUnfolder]: For 5434/5434 co-relation queries the response was YES. [2022-12-06 05:37:22,580 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 05:37:22,583 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 60 selfloop transitions, 8 changer transitions 0/68 dead transitions. [2022-12-06 05:37:22,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 636 flow [2022-12-06 05:37:22,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:37:22,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:37:22,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-12-06 05:37:22,584 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3212121212121212 [2022-12-06 05:37:22,584 INFO L175 Difference]: Start difference. First operand has 66 places, 50 transitions, 413 flow. Second operand 5 states and 53 transitions. [2022-12-06 05:37:22,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 636 flow [2022-12-06 05:37:22,590 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 05:37:22,591 INFO L231 Difference]: Finished difference. Result has 71 places, 52 transitions, 450 flow [2022-12-06 05:37:22,591 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 05:37:22,591 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 41 predicate places. [2022-12-06 05:37:22,592 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:22,592 INFO L89 Accepts]: Start accepts. Operand has 71 places, 52 transitions, 450 flow [2022-12-06 05:37:22,592 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:22,592 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:22,592 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 52 transitions, 450 flow [2022-12-06 05:37:22,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 52 transitions, 450 flow [2022-12-06 05:37:22,605 INFO L130 PetriNetUnfolder]: 91/235 cut-off events. [2022-12-06 05:37:22,605 INFO L131 PetriNetUnfolder]: For 835/908 co-relation queries the response was YES. [2022-12-06 05:37:22,605 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 05:37:22,606 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 52 transitions, 450 flow [2022-12-06 05:37:22,606 INFO L188 LiptonReduction]: Number of co-enabled transitions 408 [2022-12-06 05:37:22,609 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 05:37:22,657 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:22,657 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-06 05:37:22,657 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 52 transitions, 467 flow [2022-12-06 05:37:22,658 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 05:37:22,658 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:22,658 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 05:37:22,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-06 05:37:22,658 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 05:37:22,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:22,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1461012245, now seen corresponding path program 2 times [2022-12-06 05:37:22,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:22,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266362252] [2022-12-06 05:37:22,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:22,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:22,708 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 05:37:22,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:22,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266362252] [2022-12-06 05:37:22,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266362252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:22,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:22,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:37:22,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155916662] [2022-12-06 05:37:22,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:22,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:37:22,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:22,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:37:22,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:37:22,709 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 05:37:22,710 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 05:37:22,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:22,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 05:37:22,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:22,873 INFO L130 PetriNetUnfolder]: 926/1372 cut-off events. [2022-12-06 05:37:22,873 INFO L131 PetriNetUnfolder]: For 5084/5084 co-relation queries the response was YES. [2022-12-06 05:37:22,876 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 05:37:22,880 INFO L137 encePairwiseOnDemand]: 21/34 looper letters, 77 selfloop transitions, 17 changer transitions 1/95 dead transitions. [2022-12-06 05:37:22,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 95 transitions, 879 flow [2022-12-06 05:37:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:37:22,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:37:22,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-12-06 05:37:22,881 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39215686274509803 [2022-12-06 05:37:22,881 INFO L175 Difference]: Start difference. First operand has 71 places, 52 transitions, 467 flow. Second operand 6 states and 80 transitions. [2022-12-06 05:37:22,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 95 transitions, 879 flow [2022-12-06 05:37:22,889 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 05:37:22,890 INFO L231 Difference]: Finished difference. Result has 76 places, 54 transitions, 513 flow [2022-12-06 05:37:22,890 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 05:37:22,890 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 46 predicate places. [2022-12-06 05:37:22,890 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:22,890 INFO L89 Accepts]: Start accepts. Operand has 76 places, 54 transitions, 513 flow [2022-12-06 05:37:22,891 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:22,891 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:22,891 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 54 transitions, 513 flow [2022-12-06 05:37:22,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 54 transitions, 513 flow [2022-12-06 05:37:22,904 INFO L130 PetriNetUnfolder]: 97/238 cut-off events. [2022-12-06 05:37:22,905 INFO L131 PetriNetUnfolder]: For 1117/1189 co-relation queries the response was YES. [2022-12-06 05:37:22,905 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 05:37:22,906 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 54 transitions, 513 flow [2022-12-06 05:37:22,906 INFO L188 LiptonReduction]: Number of co-enabled transitions 424 [2022-12-06 05:37:22,907 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:22,907 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 05:37:22,907 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 54 transitions, 513 flow [2022-12-06 05:37:22,907 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 05:37:22,907 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:22,908 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 05:37:22,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-06 05:37:22,908 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 05:37:22,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:22,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1616721691, now seen corresponding path program 1 times [2022-12-06 05:37:22,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:22,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675113416] [2022-12-06 05:37:22,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:22,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:23,472 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 05:37:23,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:23,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675113416] [2022-12-06 05:37:23,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675113416] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:37:23,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227520432] [2022-12-06 05:37:23,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:23,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:37:23,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:37:23,476 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 05:37:23,513 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 05:37:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:23,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-06 05:37:23,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:37:23,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:37:23,711 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 05:37:23,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:37:23,776 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 05:37:23,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:37:23,912 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 05:37:24,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:37:24,039 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 05:37:24,211 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:24,211 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 05:37:24,263 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 05:37:24,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:37:24,645 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 05:37:24,646 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 05:37:24,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227520432] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:37:24,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:37:24,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 23 [2022-12-06 05:37:24,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162512084] [2022-12-06 05:37:24,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:37:24,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 05:37:24,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:24,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 05:37:24,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=449, Unknown=22, NotChecked=44, Total=600 [2022-12-06 05:37:24,648 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 05:37:24,649 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 05:37:24,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:24,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 05:37:24,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:25,191 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 05:37:25,935 INFO L130 PetriNetUnfolder]: 1307/1944 cut-off events. [2022-12-06 05:37:25,935 INFO L131 PetriNetUnfolder]: For 10297/10547 co-relation queries the response was YES. [2022-12-06 05:37:25,939 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 05:37:25,945 INFO L137 encePairwiseOnDemand]: 11/34 looper letters, 100 selfloop transitions, 58 changer transitions 7/167 dead transitions. [2022-12-06 05:37:25,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 167 transitions, 1707 flow [2022-12-06 05:37:25,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:37:25,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:37:25,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2022-12-06 05:37:25,947 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34558823529411764 [2022-12-06 05:37:25,947 INFO L175 Difference]: Start difference. First operand has 75 places, 54 transitions, 513 flow. Second operand 12 states and 141 transitions. [2022-12-06 05:37:25,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 167 transitions, 1707 flow [2022-12-06 05:37:25,960 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 05:37:25,962 INFO L231 Difference]: Finished difference. Result has 87 places, 104 transitions, 1161 flow [2022-12-06 05:37:25,962 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 05:37:25,962 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 57 predicate places. [2022-12-06 05:37:25,962 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:25,962 INFO L89 Accepts]: Start accepts. Operand has 87 places, 104 transitions, 1161 flow [2022-12-06 05:37:25,963 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:25,963 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:25,963 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 104 transitions, 1161 flow [2022-12-06 05:37:25,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 104 transitions, 1161 flow [2022-12-06 05:37:25,999 INFO L130 PetriNetUnfolder]: 301/665 cut-off events. [2022-12-06 05:37:25,999 INFO L131 PetriNetUnfolder]: For 3722/3931 co-relation queries the response was YES. [2022-12-06 05:37:26,002 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 05:37:26,005 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 104 transitions, 1161 flow [2022-12-06 05:37:26,005 INFO L188 LiptonReduction]: Number of co-enabled transitions 664 [2022-12-06 05:37:28,902 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 05:37:28,940 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 05:37:28,979 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:37:28,980 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3018 [2022-12-06 05:37:28,980 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 104 transitions, 1201 flow [2022-12-06 05:37:28,980 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 05:37:28,980 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:28,980 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 05:37:28,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 05:37:29,181 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 05:37:29,181 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 05:37:29,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:29,181 INFO L85 PathProgramCache]: Analyzing trace with hash 2033705419, now seen corresponding path program 1 times [2022-12-06 05:37:29,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:29,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675808274] [2022-12-06 05:37:29,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:29,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:29,717 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 05:37:29,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:29,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675808274] [2022-12-06 05:37:29,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675808274] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:37:29,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543800823] [2022-12-06 05:37:29,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:29,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:37:29,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:37:29,719 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 05:37:29,723 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 05:37:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:29,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-06 05:37:29,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:37:29,967 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:29,968 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 05:37:30,005 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 05:37:30,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:37:30,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:30,087 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 05:37:30,135 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 05:37:30,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543800823] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:37:30,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:37:30,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 4] total 14 [2022-12-06 05:37:30,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923232437] [2022-12-06 05:37:30,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:37:30,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:37:30,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:30,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:37:30,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-12-06 05:37:30,137 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2022-12-06 05:37:30,137 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 05:37:30,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:30,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2022-12-06 05:37:30,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:30,868 INFO L130 PetriNetUnfolder]: 2073/3094 cut-off events. [2022-12-06 05:37:30,868 INFO L131 PetriNetUnfolder]: For 19080/19666 co-relation queries the response was YES. [2022-12-06 05:37:30,879 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 05:37:30,893 INFO L137 encePairwiseOnDemand]: 16/38 looper letters, 183 selfloop transitions, 107 changer transitions 9/301 dead transitions. [2022-12-06 05:37:30,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 301 transitions, 3615 flow [2022-12-06 05:37:30,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 05:37:30,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 05:37:30,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 198 transitions. [2022-12-06 05:37:30,895 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37218045112781956 [2022-12-06 05:37:30,895 INFO L175 Difference]: Start difference. First operand has 87 places, 104 transitions, 1201 flow. Second operand 14 states and 198 transitions. [2022-12-06 05:37:30,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 301 transitions, 3615 flow [2022-12-06 05:37:30,956 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 05:37:30,960 INFO L231 Difference]: Finished difference. Result has 103 places, 196 transitions, 2396 flow [2022-12-06 05:37:30,960 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 05:37:30,960 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 73 predicate places. [2022-12-06 05:37:30,960 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:30,960 INFO L89 Accepts]: Start accepts. Operand has 103 places, 196 transitions, 2396 flow [2022-12-06 05:37:30,961 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:30,961 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:30,962 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 196 transitions, 2396 flow [2022-12-06 05:37:30,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 196 transitions, 2396 flow [2022-12-06 05:37:31,058 INFO L130 PetriNetUnfolder]: 542/1178 cut-off events. [2022-12-06 05:37:31,058 INFO L131 PetriNetUnfolder]: For 5537/5735 co-relation queries the response was YES. [2022-12-06 05:37:31,065 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 05:37:31,075 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 196 transitions, 2396 flow [2022-12-06 05:37:31,075 INFO L188 LiptonReduction]: Number of co-enabled transitions 1072 [2022-12-06 05:37:31,098 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 05:37:31,179 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 05:37:31,232 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 05:37:31,273 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 05:37:31,371 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 05:37:31,416 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 05:37:31,466 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 05:37:31,510 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 05:37:31,613 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 05:37:31,683 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 05:37:31,743 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 05:37:31,772 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 05:37:31,804 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 05:37:31,868 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 05:37:31,896 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 05:37:31,929 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 05:37:31,958 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [531] $Ultimate##0-->L48-5: Formula: (and (= v_~sum1~0_73 (+ (select (select |v_#memory_int_169| v_~A~0.base_98) (+ (* v_thread1Thread1of1ForFork1_~i~0_39 4) (- 4) v_~A~0.offset_98)) v_~sum1~0_74)) (< v_thread1Thread1of1ForFork1_~i~0_39 (+ 1 v_~N~0_91)) (= v_thread1Thread1of1ForFork1_~i~0_39 1)) InVars {~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, ~sum1~0=v_~sum1~0_74, #memory_int=|v_#memory_int_169|, ~N~0=v_~N~0_91} OutVars{~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_29|, ~sum1~0=v_~sum1~0_73, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_21|, #memory_int=|v_#memory_int_169|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_39, ~N~0=v_~N~0_91} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, ~sum1~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [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 05:37:32,028 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 05:37:32,063 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:37:32,064 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1104 [2022-12-06 05:37:32,064 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 194 transitions, 2523 flow [2022-12-06 05:37:32,064 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 05:37:32,064 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:32,065 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 05:37:32,070 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 05:37:32,265 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 05:37:32,265 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 05:37:32,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:32,266 INFO L85 PathProgramCache]: Analyzing trace with hash 808041688, now seen corresponding path program 1 times [2022-12-06 05:37:32,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:32,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494219004] [2022-12-06 05:37:32,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:32,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:32,765 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 05:37:32,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:32,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494219004] [2022-12-06 05:37:32,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494219004] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:37:32,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721990797] [2022-12-06 05:37:32,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:32,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:37:32,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:37:32,768 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 05:37:32,770 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 05:37:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:32,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-06 05:37:32,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:37:32,956 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:32,957 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 05:37:32,983 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 05:37:32,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:37:33,038 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:33,038 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 05:37:33,070 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 05:37:33,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721990797] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:37:33,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:37:33,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 3] total 12 [2022-12-06 05:37:33,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023474199] [2022-12-06 05:37:33,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:37:33,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:37:33,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:33,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:37:33,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:37:33,072 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 56 [2022-12-06 05:37:33,072 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 05:37:33,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:33,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 56 [2022-12-06 05:37:33,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:33,764 INFO L130 PetriNetUnfolder]: 2478/3666 cut-off events. [2022-12-06 05:37:33,765 INFO L131 PetriNetUnfolder]: For 27855/28607 co-relation queries the response was YES. [2022-12-06 05:37:33,772 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 05:37:33,785 INFO L137 encePairwiseOnDemand]: 23/56 looper letters, 182 selfloop transitions, 98 changer transitions 4/286 dead transitions. [2022-12-06 05:37:33,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 286 transitions, 3899 flow [2022-12-06 05:37:33,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:37:33,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:37:33,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 160 transitions. [2022-12-06 05:37:33,786 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2597402597402597 [2022-12-06 05:37:33,786 INFO L175 Difference]: Start difference. First operand has 98 places, 194 transitions, 2523 flow. Second operand 11 states and 160 transitions. [2022-12-06 05:37:33,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 286 transitions, 3899 flow [2022-12-06 05:37:33,830 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 05:37:33,833 INFO L231 Difference]: Finished difference. Result has 110 places, 214 transitions, 2863 flow [2022-12-06 05:37:33,833 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 05:37:33,834 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 80 predicate places. [2022-12-06 05:37:33,842 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:33,843 INFO L89 Accepts]: Start accepts. Operand has 110 places, 214 transitions, 2863 flow [2022-12-06 05:37:33,844 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:33,844 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:33,844 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 214 transitions, 2863 flow [2022-12-06 05:37:33,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 214 transitions, 2863 flow [2022-12-06 05:37:33,957 INFO L130 PetriNetUnfolder]: 637/1403 cut-off events. [2022-12-06 05:37:33,957 INFO L131 PetriNetUnfolder]: For 8507/8816 co-relation queries the response was YES. [2022-12-06 05:37:33,962 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 05:37:33,972 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 214 transitions, 2863 flow [2022-12-06 05:37:33,972 INFO L188 LiptonReduction]: Number of co-enabled transitions 1214 [2022-12-06 05:37:34,011 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 05:37:34,046 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:34,046 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 204 [2022-12-06 05:37:34,046 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 214 transitions, 2869 flow [2022-12-06 05:37:34,046 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 05:37:34,046 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:34,047 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 05:37:34,054 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 05:37:34,251 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 05:37:34,251 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 05:37:34,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:34,252 INFO L85 PathProgramCache]: Analyzing trace with hash 961216993, now seen corresponding path program 1 times [2022-12-06 05:37:34,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:34,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902963659] [2022-12-06 05:37:34,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:34,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:34,312 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 05:37:34,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:34,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902963659] [2022-12-06 05:37:34,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902963659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:34,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:34,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:37:34,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139810375] [2022-12-06 05:37:34,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:34,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:37:34,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:34,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:37:34,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:37:34,314 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-06 05:37:34,314 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 05:37:34,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:34,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-06 05:37:34,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:34,778 INFO L130 PetriNetUnfolder]: 2656/3943 cut-off events. [2022-12-06 05:37:34,779 INFO L131 PetriNetUnfolder]: For 30212/30212 co-relation queries the response was YES. [2022-12-06 05:37:34,788 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 05:37:34,800 INFO L137 encePairwiseOnDemand]: 38/58 looper letters, 229 selfloop transitions, 67 changer transitions 0/296 dead transitions. [2022-12-06 05:37:34,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 296 transitions, 4184 flow [2022-12-06 05:37:34,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:37:34,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:37:34,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2022-12-06 05:37:34,802 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28448275862068967 [2022-12-06 05:37:34,802 INFO L175 Difference]: Start difference. First operand has 110 places, 214 transitions, 2869 flow. Second operand 6 states and 99 transitions. [2022-12-06 05:37:34,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 296 transitions, 4184 flow [2022-12-06 05:37:34,866 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 05:37:34,870 INFO L231 Difference]: Finished difference. Result has 112 places, 215 transitions, 2874 flow [2022-12-06 05:37:34,870 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 05:37:34,870 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 82 predicate places. [2022-12-06 05:37:34,870 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:34,870 INFO L89 Accepts]: Start accepts. Operand has 112 places, 215 transitions, 2874 flow [2022-12-06 05:37:34,871 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:34,871 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:34,871 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 215 transitions, 2874 flow [2022-12-06 05:37:34,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 215 transitions, 2874 flow [2022-12-06 05:37:34,958 INFO L130 PetriNetUnfolder]: 650/1423 cut-off events. [2022-12-06 05:37:34,958 INFO L131 PetriNetUnfolder]: For 9479/9754 co-relation queries the response was YES. [2022-12-06 05:37:34,963 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 05:37:34,971 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 215 transitions, 2874 flow [2022-12-06 05:37:34,972 INFO L188 LiptonReduction]: Number of co-enabled transitions 1224 [2022-12-06 05:37:35,259 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:35,259 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 389 [2022-12-06 05:37:35,259 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 215 transitions, 2889 flow [2022-12-06 05:37:35,259 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 05:37:35,259 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:35,259 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 05:37:35,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-06 05:37:35,260 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 05:37:35,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:35,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1201742910, now seen corresponding path program 1 times [2022-12-06 05:37:35,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:35,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846847665] [2022-12-06 05:37:35,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:35,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:35,310 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 05:37:35,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:35,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846847665] [2022-12-06 05:37:35,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846847665] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:37:35,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787262726] [2022-12-06 05:37:35,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:35,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:37:35,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:37:35,312 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 05:37:35,335 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 05:37:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:35,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 05:37:35,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:37:35,449 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 05:37:35,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:37:35,477 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 05:37:35,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787262726] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:37:35,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:37:35,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-06 05:37:35,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936352310] [2022-12-06 05:37:35,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:37:35,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:37:35,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:35,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:37:35,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:37:35,478 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-06 05:37:35,478 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 05:37:35,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:35,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-06 05:37:35,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:36,138 INFO L130 PetriNetUnfolder]: 2996/4445 cut-off events. [2022-12-06 05:37:36,138 INFO L131 PetriNetUnfolder]: For 38859/38859 co-relation queries the response was YES. [2022-12-06 05:37:36,156 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 05:37:36,178 INFO L137 encePairwiseOnDemand]: 33/59 looper letters, 269 selfloop transitions, 82 changer transitions 0/351 dead transitions. [2022-12-06 05:37:36,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 351 transitions, 4736 flow [2022-12-06 05:37:36,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:37:36,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:37:36,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2022-12-06 05:37:36,179 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.288135593220339 [2022-12-06 05:37:36,179 INFO L175 Difference]: Start difference. First operand has 112 places, 215 transitions, 2889 flow. Second operand 7 states and 119 transitions. [2022-12-06 05:37:36,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 351 transitions, 4736 flow [2022-12-06 05:37:36,327 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 05:37:36,331 INFO L231 Difference]: Finished difference. Result has 116 places, 218 transitions, 2954 flow [2022-12-06 05:37:36,331 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 05:37:36,331 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 86 predicate places. [2022-12-06 05:37:36,331 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:36,332 INFO L89 Accepts]: Start accepts. Operand has 116 places, 218 transitions, 2954 flow [2022-12-06 05:37:36,332 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:36,332 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:36,332 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 218 transitions, 2954 flow [2022-12-06 05:37:36,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 218 transitions, 2954 flow [2022-12-06 05:37:36,449 INFO L130 PetriNetUnfolder]: 710/1596 cut-off events. [2022-12-06 05:37:36,450 INFO L131 PetriNetUnfolder]: For 10900/11242 co-relation queries the response was YES. [2022-12-06 05:37:36,459 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 05:37:36,472 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 218 transitions, 2954 flow [2022-12-06 05:37:36,473 INFO L188 LiptonReduction]: Number of co-enabled transitions 1308 [2022-12-06 05:37:36,474 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:36,477 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-06 05:37:36,477 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 218 transitions, 2954 flow [2022-12-06 05:37:36,478 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 05:37:36,478 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:36,478 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 05:37:36,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 05:37:36,682 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 05:37:36,683 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 05:37:36,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:36,683 INFO L85 PathProgramCache]: Analyzing trace with hash -616669900, now seen corresponding path program 1 times [2022-12-06 05:37:36,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:36,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804419500] [2022-12-06 05:37:36,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:36,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:37,313 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 05:37:37,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:37,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804419500] [2022-12-06 05:37:37,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804419500] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:37:37,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660080724] [2022-12-06 05:37:37,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:37,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:37:37,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:37:37,324 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 05:37:37,335 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 05:37:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:37,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 05:37:37,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:37:37,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:37:37,479 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 05:37:37,482 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 05:37:37,523 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 05:37:37,562 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 05:37:37,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:37:37,672 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:37,672 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 05:37:37,756 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 05:37:37,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:37:39,912 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 05:37:39,943 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 05:37:39,956 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 05:37:39,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660080724] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:37:39,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:37:39,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 19 [2022-12-06 05:37:39,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697420337] [2022-12-06 05:37:39,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:37:39,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 05:37:39,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:39,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 05:37:39,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=252, Unknown=2, NotChecked=70, Total=420 [2022-12-06 05:37:39,960 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-06 05:37:39,960 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 05:37:39,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:39,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-06 05:37:39,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:41,623 INFO L130 PetriNetUnfolder]: 3357/5128 cut-off events. [2022-12-06 05:37:41,623 INFO L131 PetriNetUnfolder]: For 46299/46299 co-relation queries the response was YES. [2022-12-06 05:37:41,639 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 05:37:41,656 INFO L137 encePairwiseOnDemand]: 17/59 looper letters, 195 selfloop transitions, 163 changer transitions 9/367 dead transitions. [2022-12-06 05:37:41,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 367 transitions, 5047 flow [2022-12-06 05:37:41,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 05:37:41,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 05:37:41,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 165 transitions. [2022-12-06 05:37:41,658 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16450648055832504 [2022-12-06 05:37:41,658 INFO L175 Difference]: Start difference. First operand has 116 places, 218 transitions, 2954 flow. Second operand 17 states and 165 transitions. [2022-12-06 05:37:41,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 367 transitions, 5047 flow [2022-12-06 05:37:41,774 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 05:37:41,778 INFO L231 Difference]: Finished difference. Result has 137 places, 293 transitions, 4470 flow [2022-12-06 05:37:41,778 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 05:37:41,779 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 107 predicate places. [2022-12-06 05:37:41,779 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:41,779 INFO L89 Accepts]: Start accepts. Operand has 137 places, 293 transitions, 4470 flow [2022-12-06 05:37:41,780 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:41,780 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:41,780 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 293 transitions, 4470 flow [2022-12-06 05:37:41,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 293 transitions, 4470 flow [2022-12-06 05:37:41,844 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 05:37:41,844 INFO L382 tUnfolder$Statistics]: this new event has 10 ancestors and is cut-off event [2022-12-06 05:37:41,844 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 05:37:41,845 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:41,845 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 05:37:41,870 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 05:37:41,871 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 05:37:41,871 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:41,871 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:41,871 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:41,894 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 05:37:41,894 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 05:37:41,894 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:41,895 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:41,895 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:41,908 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 05:37:41,908 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:37:41,908 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:41,908 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:41,908 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:41,931 INFO L130 PetriNetUnfolder]: 932/2050 cut-off events. [2022-12-06 05:37:41,931 INFO L131 PetriNetUnfolder]: For 17308/17684 co-relation queries the response was YES. [2022-12-06 05:37:41,939 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 05:37:41,952 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 293 transitions, 4470 flow [2022-12-06 05:37:41,953 INFO L188 LiptonReduction]: Number of co-enabled transitions 1514 [2022-12-06 05:37:41,959 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 05:37:42,052 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 05:37:42,112 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 05:37:42,155 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 05:37:42,195 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 05:37:42,304 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 05:37:42,560 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 05:37:42,906 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:37:42,907 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1128 [2022-12-06 05:37:42,907 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 290 transitions, 4592 flow [2022-12-06 05:37:42,907 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 05:37:42,907 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:42,907 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 05:37:42,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-06 05:37:43,108 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 05:37:43,108 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 05:37:43,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:43,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1419503499, now seen corresponding path program 1 times [2022-12-06 05:37:43,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:43,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174028089] [2022-12-06 05:37:43,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:43,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:43,514 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 05:37:43,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:43,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174028089] [2022-12-06 05:37:43,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174028089] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:37:43,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217644449] [2022-12-06 05:37:43,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:43,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:37:43,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:37:43,519 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 05:37:43,522 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 05:37:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:43,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 05:37:43,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:37:43,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:37:43,716 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 05:37:43,804 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:43,804 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 05:37:43,839 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 05:37:43,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:37:43,919 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:43,920 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 05:37:43,925 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:43,926 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 05:37:43,970 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 05:37:43,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217644449] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:37:43,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:37:43,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 05:37:43,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424495969] [2022-12-06 05:37:43,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:37:43,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 05:37:43,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:43,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 05:37:43,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-12-06 05:37:43,971 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 65 [2022-12-06 05:37:43,971 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 05:37:43,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:43,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 65 [2022-12-06 05:37:43,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:45,479 INFO L130 PetriNetUnfolder]: 3723/5665 cut-off events. [2022-12-06 05:37:45,479 INFO L131 PetriNetUnfolder]: For 64611/65786 co-relation queries the response was YES. [2022-12-06 05:37:45,509 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 05:37:45,541 INFO L137 encePairwiseOnDemand]: 18/65 looper letters, 252 selfloop transitions, 171 changer transitions 6/433 dead transitions. [2022-12-06 05:37:45,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 433 transitions, 7015 flow [2022-12-06 05:37:45,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:37:45,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:37:45,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 198 transitions. [2022-12-06 05:37:45,543 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23431952662721894 [2022-12-06 05:37:45,543 INFO L175 Difference]: Start difference. First operand has 134 places, 290 transitions, 4592 flow. Second operand 13 states and 198 transitions. [2022-12-06 05:37:45,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 433 transitions, 7015 flow [2022-12-06 05:37:45,794 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 05:37:45,801 INFO L231 Difference]: Finished difference. Result has 145 places, 338 transitions, 5637 flow [2022-12-06 05:37:45,802 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 05:37:45,802 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 115 predicate places. [2022-12-06 05:37:45,802 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:45,802 INFO L89 Accepts]: Start accepts. Operand has 145 places, 338 transitions, 5637 flow [2022-12-06 05:37:45,804 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:45,804 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:45,804 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 338 transitions, 5637 flow [2022-12-06 05:37:45,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 338 transitions, 5637 flow [2022-12-06 05:37:45,936 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L64-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_5 v_~N~0_In_7)) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, ~N~0=v_~N~0_In_7} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_5, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_7, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][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 05:37:45,937 INFO L382 tUnfolder$Statistics]: this new event has 10 ancestors and is cut-off event [2022-12-06 05:37:45,937 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 05:37:45,937 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:45,937 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 05:37:46,014 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 05:37:46,014 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 05:37:46,014 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:46,014 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:46,014 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:46,038 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 05:37:46,038 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 05:37:46,038 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:46,038 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:46,039 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:46,047 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 05:37:46,047 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:37:46,047 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:46,047 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:46,047 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:46,093 INFO L130 PetriNetUnfolder]: 1118/2422 cut-off events. [2022-12-06 05:37:46,093 INFO L131 PetriNetUnfolder]: For 22252/22734 co-relation queries the response was YES. [2022-12-06 05:37:46,108 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 05:37:46,131 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 338 transitions, 5637 flow [2022-12-06 05:37:46,131 INFO L188 LiptonReduction]: Number of co-enabled transitions 1734 [2022-12-06 05:37:46,132 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 05:37:46,199 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:46,200 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 398 [2022-12-06 05:37:46,200 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 338 transitions, 5652 flow [2022-12-06 05:37:46,201 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 05:37:46,201 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:46,201 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:46,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 05:37:46,406 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 05:37:46,407 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 05:37:46,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:46,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1147053406, now seen corresponding path program 1 times [2022-12-06 05:37:46,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:46,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912655906] [2022-12-06 05:37:46,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:46,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:46,998 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 05:37:46,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:46,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912655906] [2022-12-06 05:37:46,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912655906] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:46,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:46,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:37:46,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22212717] [2022-12-06 05:37:46,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:46,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:37:46,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:47,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:37:47,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:37:47,000 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 65 [2022-12-06 05:37:47,000 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 05:37:47,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:47,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 65 [2022-12-06 05:37:47,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:48,049 INFO L130 PetriNetUnfolder]: 3897/5945 cut-off events. [2022-12-06 05:37:48,050 INFO L131 PetriNetUnfolder]: For 68529/68529 co-relation queries the response was YES. [2022-12-06 05:37:48,070 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 05:37:48,093 INFO L137 encePairwiseOnDemand]: 28/65 looper letters, 310 selfloop transitions, 39 changer transitions 10/359 dead transitions. [2022-12-06 05:37:48,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 359 transitions, 6508 flow [2022-12-06 05:37:48,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:37:48,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:37:48,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2022-12-06 05:37:48,094 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24615384615384617 [2022-12-06 05:37:48,094 INFO L175 Difference]: Start difference. First operand has 144 places, 338 transitions, 5652 flow. Second operand 6 states and 96 transitions. [2022-12-06 05:37:48,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 359 transitions, 6508 flow [2022-12-06 05:37:48,278 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 05:37:48,283 INFO L231 Difference]: Finished difference. Result has 145 places, 336 transitions, 5359 flow [2022-12-06 05:37:48,283 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 05:37:48,284 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 115 predicate places. [2022-12-06 05:37:48,284 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:48,284 INFO L89 Accepts]: Start accepts. Operand has 145 places, 336 transitions, 5359 flow [2022-12-06 05:37:48,285 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:48,285 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:48,285 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 336 transitions, 5359 flow [2022-12-06 05:37:48,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 336 transitions, 5359 flow [2022-12-06 05:37:48,460 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 05:37:48,461 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 05:37:48,461 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:48,461 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:48,461 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:48,469 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 05:37:48,470 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:37:48,470 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:48,470 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:48,470 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:48,499 INFO L130 PetriNetUnfolder]: 1115/2423 cut-off events. [2022-12-06 05:37:48,500 INFO L131 PetriNetUnfolder]: For 20781/21157 co-relation queries the response was YES. [2022-12-06 05:37:48,508 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 05:37:48,521 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 336 transitions, 5359 flow [2022-12-06 05:37:48,522 INFO L188 LiptonReduction]: Number of co-enabled transitions 1728 [2022-12-06 05:37:48,523 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:48,524 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 240 [2022-12-06 05:37:48,524 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 336 transitions, 5359 flow [2022-12-06 05:37:48,524 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 05:37:48,524 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:48,524 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 05:37:48,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-06 05:37:48,525 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 05:37:48,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:48,525 INFO L85 PathProgramCache]: Analyzing trace with hash -835799711, now seen corresponding path program 1 times [2022-12-06 05:37:48,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:48,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939505448] [2022-12-06 05:37:48,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:48,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:48,902 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 05:37:48,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:48,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939505448] [2022-12-06 05:37:48,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939505448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:48,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:48,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:37:48,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205625931] [2022-12-06 05:37:48,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:48,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:37:48,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:48,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:37:48,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:37:48,903 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 64 [2022-12-06 05:37:48,903 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 05:37:48,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:48,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 64 [2022-12-06 05:37:48,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:50,019 INFO L130 PetriNetUnfolder]: 4570/6955 cut-off events. [2022-12-06 05:37:50,019 INFO L131 PetriNetUnfolder]: For 79927/81372 co-relation queries the response was YES. [2022-12-06 05:37:50,060 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 05:37:50,099 INFO L137 encePairwiseOnDemand]: 23/64 looper letters, 285 selfloop transitions, 142 changer transitions 4/435 dead transitions. [2022-12-06 05:37:50,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 435 transitions, 7303 flow [2022-12-06 05:37:50,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:37:50,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:37:50,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2022-12-06 05:37:50,100 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34375 [2022-12-06 05:37:50,100 INFO L175 Difference]: Start difference. First operand has 144 places, 336 transitions, 5359 flow. Second operand 6 states and 132 transitions. [2022-12-06 05:37:50,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 435 transitions, 7303 flow [2022-12-06 05:37:50,580 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 05:37:50,588 INFO L231 Difference]: Finished difference. Result has 148 places, 382 transitions, 6477 flow [2022-12-06 05:37:50,588 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 05:37:50,589 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 118 predicate places. [2022-12-06 05:37:50,589 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:50,589 INFO L89 Accepts]: Start accepts. Operand has 148 places, 382 transitions, 6477 flow [2022-12-06 05:37:50,591 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:50,591 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:50,591 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 382 transitions, 6477 flow [2022-12-06 05:37:50,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 382 transitions, 6477 flow [2022-12-06 05:37:50,775 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 05:37:50,775 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 05:37:50,775 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:50,775 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:50,775 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:50,816 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 05:37:50,816 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 05:37:50,816 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:50,816 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:50,816 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:50,816 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:50,822 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 05:37:50,823 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 05:37:50,823 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:50,823 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:50,823 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:50,837 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 05:37:50,837 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:37:50,837 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:50,838 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:50,838 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:50,936 INFO L130 PetriNetUnfolder]: 1245/2775 cut-off events. [2022-12-06 05:37:50,937 INFO L131 PetriNetUnfolder]: For 25221/25725 co-relation queries the response was YES. [2022-12-06 05:37:50,949 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 05:37:50,968 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 382 transitions, 6477 flow [2022-12-06 05:37:50,968 INFO L188 LiptonReduction]: Number of co-enabled transitions 2148 [2022-12-06 05:37:50,970 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:50,972 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 383 [2022-12-06 05:37:50,972 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 382 transitions, 6477 flow [2022-12-06 05:37:50,972 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 05:37:50,972 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:50,972 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 05:37:50,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-06 05:37:50,972 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 05:37:50,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:50,972 INFO L85 PathProgramCache]: Analyzing trace with hash 594898099, now seen corresponding path program 1 times [2022-12-06 05:37:50,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:50,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787356542] [2022-12-06 05:37:50,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:50,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:51,552 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 05:37:51,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:51,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787356542] [2022-12-06 05:37:51,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787356542] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:37:51,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272283567] [2022-12-06 05:37:51,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:51,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:37:51,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:37:51,568 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 05:37:51,571 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 05:37:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:51,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 05:37:51,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:37:51,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:37:51,738 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 05:37:51,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:37:51,772 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 05:37:51,891 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:51,892 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 05:37:51,926 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 05:37:51,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:37:52,010 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 05:37:52,020 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:52,020 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 05:37:52,025 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 05:37:52,029 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:52,030 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 05:37:52,133 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 05:37:52,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272283567] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:37:52,134 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:37:52,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 05:37:52,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698346981] [2022-12-06 05:37:52,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:37:52,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 05:37:52,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:52,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 05:37:52,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=244, Unknown=1, NotChecked=32, Total=342 [2022-12-06 05:37:52,135 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 64 [2022-12-06 05:37:52,135 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 05:37:52,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:52,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 64 [2022-12-06 05:37:52,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:53,830 INFO L130 PetriNetUnfolder]: 5172/7867 cut-off events. [2022-12-06 05:37:53,830 INFO L131 PetriNetUnfolder]: For 101965/103577 co-relation queries the response was YES. [2022-12-06 05:37:53,860 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 05:37:53,893 INFO L137 encePairwiseOnDemand]: 18/64 looper letters, 297 selfloop transitions, 224 changer transitions 5/530 dead transitions. [2022-12-06 05:37:53,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 530 transitions, 9272 flow [2022-12-06 05:37:53,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:37:53,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:37:53,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 192 transitions. [2022-12-06 05:37:53,895 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2727272727272727 [2022-12-06 05:37:53,895 INFO L175 Difference]: Start difference. First operand has 148 places, 382 transitions, 6477 flow. Second operand 11 states and 192 transitions. [2022-12-06 05:37:53,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 530 transitions, 9272 flow [2022-12-06 05:37:54,256 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 05:37:54,263 INFO L231 Difference]: Finished difference. Result has 162 places, 437 transitions, 8106 flow [2022-12-06 05:37:54,264 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 05:37:54,264 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 132 predicate places. [2022-12-06 05:37:54,264 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:54,264 INFO L89 Accepts]: Start accepts. Operand has 162 places, 437 transitions, 8106 flow [2022-12-06 05:37:54,265 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:54,265 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:54,266 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 437 transitions, 8106 flow [2022-12-06 05:37:54,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 437 transitions, 8106 flow [2022-12-06 05:37:54,472 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 05:37:54,472 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 05:37:54,472 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:54,472 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:54,472 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:54,498 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 05:37:54,498 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:37:54,498 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:54,498 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:54,498 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:54,541 INFO L130 PetriNetUnfolder]: 1420/3141 cut-off events. [2022-12-06 05:37:54,541 INFO L131 PetriNetUnfolder]: For 33558/34180 co-relation queries the response was YES. [2022-12-06 05:37:54,556 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 05:37:54,580 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 437 transitions, 8106 flow [2022-12-06 05:37:54,580 INFO L188 LiptonReduction]: Number of co-enabled transitions 2452 [2022-12-06 05:37:54,582 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:54,582 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 318 [2022-12-06 05:37:54,582 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 437 transitions, 8106 flow [2022-12-06 05:37:54,582 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 05:37:54,582 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:54,582 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 05:37:54,600 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 05:37:54,787 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 05:37:54,787 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 05:37:54,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:54,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1122428828, now seen corresponding path program 1 times [2022-12-06 05:37:54,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:54,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828962560] [2022-12-06 05:37:54,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:54,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:54,827 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 05:37:54,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:54,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828962560] [2022-12-06 05:37:54,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828962560] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:54,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:54,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:37:54,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367487293] [2022-12-06 05:37:54,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:54,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:37:54,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:54,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:37:54,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:37:54,829 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 64 [2022-12-06 05:37:54,829 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 05:37:54,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:54,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 64 [2022-12-06 05:37:54,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:56,643 INFO L130 PetriNetUnfolder]: 7040/10886 cut-off events. [2022-12-06 05:37:56,644 INFO L131 PetriNetUnfolder]: For 158373/160439 co-relation queries the response was YES. [2022-12-06 05:37:56,682 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 05:37:56,812 INFO L137 encePairwiseOnDemand]: 57/64 looper letters, 533 selfloop transitions, 7 changer transitions 1/545 dead transitions. [2022-12-06 05:37:56,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 545 transitions, 10649 flow [2022-12-06 05:37:56,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:37:56,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:37:56,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2022-12-06 05:37:56,813 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46875 [2022-12-06 05:37:56,813 INFO L175 Difference]: Start difference. First operand has 162 places, 437 transitions, 8106 flow. Second operand 4 states and 120 transitions. [2022-12-06 05:37:56,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 545 transitions, 10649 flow [2022-12-06 05:37:57,303 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 05:37:57,309 INFO L231 Difference]: Finished difference. Result has 160 places, 420 transitions, 7589 flow [2022-12-06 05:37:57,310 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 05:37:57,310 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 130 predicate places. [2022-12-06 05:37:57,311 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:57,311 INFO L89 Accepts]: Start accepts. Operand has 160 places, 420 transitions, 7589 flow [2022-12-06 05:37:57,312 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:57,312 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:57,312 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 420 transitions, 7589 flow [2022-12-06 05:37:57,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 420 transitions, 7589 flow [2022-12-06 05:37:57,488 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 05:37:57,489 INFO L382 tUnfolder$Statistics]: this new event has 10 ancestors and is cut-off event [2022-12-06 05:37:57,489 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:57,489 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:57,489 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:57,629 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 05:37:57,629 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 05:37:57,630 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:57,630 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:57,630 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:57,630 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 05:37:57,630 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 05:37:57,630 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:57,630 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:57,631 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:57,672 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 05:37:57,672 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is not cut-off event [2022-12-06 05:37:57,672 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2022-12-06 05:37:57,672 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2022-12-06 05:37:57,672 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2022-12-06 05:37:57,782 INFO L130 PetriNetUnfolder]: 1766/4181 cut-off events. [2022-12-06 05:37:57,782 INFO L131 PetriNetUnfolder]: For 40473/41089 co-relation queries the response was YES. [2022-12-06 05:37:57,804 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 05:37:57,840 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 420 transitions, 7589 flow [2022-12-06 05:37:57,840 INFO L188 LiptonReduction]: Number of co-enabled transitions 2332 [2022-12-06 05:37:57,846 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 05:37:57,968 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:57,968 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 657 [2022-12-06 05:37:57,968 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 419 transitions, 7587 flow [2022-12-06 05:37:57,968 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 05:37:57,968 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:57,968 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 05:37:57,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-06 05:37:57,969 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 05:37:57,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:57,969 INFO L85 PathProgramCache]: Analyzing trace with hash -2053398207, now seen corresponding path program 1 times [2022-12-06 05:37:57,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:57,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846040118] [2022-12-06 05:37:57,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:57,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:58,031 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 05:37:58,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:58,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846040118] [2022-12-06 05:37:58,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846040118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:58,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:58,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:37:58,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815263624] [2022-12-06 05:37:58,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:58,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:37:58,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:58,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:37:58,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:37:58,033 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-06 05:37:58,033 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 05:37:58,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:58,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-06 05:37:58,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:59,838 INFO L130 PetriNetUnfolder]: 7412/11460 cut-off events. [2022-12-06 05:37:59,839 INFO L131 PetriNetUnfolder]: For 137932/137932 co-relation queries the response was YES. [2022-12-06 05:37:59,886 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 05:37:59,933 INFO L137 encePairwiseOnDemand]: 53/64 looper letters, 552 selfloop transitions, 23 changer transitions 1/576 dead transitions. [2022-12-06 05:37:59,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 576 transitions, 10853 flow [2022-12-06 05:37:59,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:37:59,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:37:59,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-12-06 05:37:59,934 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43359375 [2022-12-06 05:37:59,935 INFO L175 Difference]: Start difference. First operand has 158 places, 419 transitions, 7587 flow. Second operand 4 states and 111 transitions. [2022-12-06 05:37:59,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 576 transitions, 10853 flow [2022-12-06 05:38:00,511 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 05:38:00,518 INFO L231 Difference]: Finished difference. Result has 159 places, 425 transitions, 7753 flow [2022-12-06 05:38:00,518 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 05:38:00,519 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 129 predicate places. [2022-12-06 05:38:00,519 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:00,519 INFO L89 Accepts]: Start accepts. Operand has 159 places, 425 transitions, 7753 flow [2022-12-06 05:38:00,520 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:00,520 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:00,520 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 425 transitions, 7753 flow [2022-12-06 05:38:00,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 425 transitions, 7753 flow [2022-12-06 05:38:00,857 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 05:38:00,857 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:38:00,857 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:00,857 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:00,857 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:00,887 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 05:38:00,887 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 05:38:00,887 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:00,887 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:00,888 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:00,909 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 05:38:00,909 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:38:00,909 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:00,909 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:00,910 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:00,910 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:00,912 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 05:38:00,912 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:38:00,912 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:00,912 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:00,912 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:00,993 INFO L130 PetriNetUnfolder]: 1774/4174 cut-off events. [2022-12-06 05:38:00,993 INFO L131 PetriNetUnfolder]: For 41393/42059 co-relation queries the response was YES. [2022-12-06 05:38:01,013 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 05:38:01,044 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 425 transitions, 7753 flow [2022-12-06 05:38:01,045 INFO L188 LiptonReduction]: Number of co-enabled transitions 2432 [2022-12-06 05:38:01,046 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:38:01,047 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 528 [2022-12-06 05:38:01,047 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 425 transitions, 7753 flow [2022-12-06 05:38:01,047 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 05:38:01,047 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:01,047 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 05:38:01,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-06 05:38:01,047 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 05:38:01,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:01,048 INFO L85 PathProgramCache]: Analyzing trace with hash 396625139, now seen corresponding path program 2 times [2022-12-06 05:38:01,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:01,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850646736] [2022-12-06 05:38:01,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:01,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:01,603 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 05:38:01,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:01,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850646736] [2022-12-06 05:38:01,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850646736] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:38:01,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069111980] [2022-12-06 05:38:01,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:38:01,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:38:01,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:38:01,624 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 05:38:01,658 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 05:38:01,756 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:38:01,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:38:01,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 05:38:01,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:38:01,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:38:01,804 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 05:38:01,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:38:01,862 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 05:38:01,963 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:01,963 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 05:38:01,998 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 05:38:01,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:38:02,122 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:02,122 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 05:38:02,127 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:02,127 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 05:38:02,132 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:02,132 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 05:38:03,021 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 05:38:03,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069111980] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:38:03,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:38:03,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 05:38:03,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850046205] [2022-12-06 05:38:03,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:38:03,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 05:38:03,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:03,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 05:38:03,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=272, Unknown=3, NotChecked=0, Total=342 [2022-12-06 05:38:03,023 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 62 [2022-12-06 05:38:03,023 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 05:38:03,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:03,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 62 [2022-12-06 05:38:03,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:05,448 INFO L130 PetriNetUnfolder]: 7301/11300 cut-off events. [2022-12-06 05:38:05,448 INFO L131 PetriNetUnfolder]: For 158280/160815 co-relation queries the response was YES. [2022-12-06 05:38:05,508 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 05:38:05,573 INFO L137 encePairwiseOnDemand]: 18/62 looper letters, 302 selfloop transitions, 213 changer transitions 5/527 dead transitions. [2022-12-06 05:38:05,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 527 transitions, 9818 flow [2022-12-06 05:38:05,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:38:05,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:38:05,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 180 transitions. [2022-12-06 05:38:05,578 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26392961876832843 [2022-12-06 05:38:05,578 INFO L175 Difference]: Start difference. First operand has 159 places, 425 transitions, 7753 flow. Second operand 11 states and 180 transitions. [2022-12-06 05:38:05,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 527 transitions, 9818 flow [2022-12-06 05:38:06,376 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 05:38:06,385 INFO L231 Difference]: Finished difference. Result has 170 places, 441 transitions, 8607 flow [2022-12-06 05:38:06,386 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 05:38:06,386 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 140 predicate places. [2022-12-06 05:38:06,387 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:06,387 INFO L89 Accepts]: Start accepts. Operand has 170 places, 441 transitions, 8607 flow [2022-12-06 05:38:06,388 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:06,389 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:06,389 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 441 transitions, 8607 flow [2022-12-06 05:38:06,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 441 transitions, 8607 flow [2022-12-06 05:38:06,670 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 05:38:06,670 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:38:06,670 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:06,670 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:06,670 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:06,712 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 05:38:06,713 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 05:38:06,713 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:06,713 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:06,713 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:06,740 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 05:38:06,740 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:38:06,740 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:06,740 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:06,740 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:06,740 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:06,743 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 05:38:06,744 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:38:06,744 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:06,744 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:06,744 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:06,852 INFO L130 PetriNetUnfolder]: 1836/4345 cut-off events. [2022-12-06 05:38:06,853 INFO L131 PetriNetUnfolder]: For 47631/48305 co-relation queries the response was YES. [2022-12-06 05:38:06,876 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 05:38:06,918 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 441 transitions, 8607 flow [2022-12-06 05:38:06,919 INFO L188 LiptonReduction]: Number of co-enabled transitions 2556 [2022-12-06 05:38:06,921 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:38:06,927 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 540 [2022-12-06 05:38:06,927 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 441 transitions, 8607 flow [2022-12-06 05:38:06,927 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 05:38:06,928 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:06,928 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 05:38:06,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 05:38:07,132 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 05:38:07,133 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 05:38:07,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:07,133 INFO L85 PathProgramCache]: Analyzing trace with hash 462820328, now seen corresponding path program 1 times [2022-12-06 05:38:07,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:07,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917205087] [2022-12-06 05:38:07,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:07,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:07,619 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 05:38:07,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:07,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917205087] [2022-12-06 05:38:07,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917205087] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:38:07,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611464029] [2022-12-06 05:38:07,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:07,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:38:07,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:38:07,621 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 05:38:07,623 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 05:38:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:07,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-06 05:38:07,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:38:07,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:38:07,792 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 05:38:07,795 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 05:38:07,831 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 05:38:07,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:38:07,876 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 05:38:07,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:38:07,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:38:07,970 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:07,971 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 05:38:08,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:38:08,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:38:10,174 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 05:38:12,207 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 05:38:12,222 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 05:38:12,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611464029] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:38:12,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:38:12,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-12-06 05:38:12,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097767225] [2022-12-06 05:38:12,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:38:12,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:38:12,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:12,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:38:12,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=163, Unknown=2, NotChecked=54, Total=272 [2022-12-06 05:38:12,223 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-06 05:38:12,223 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 05:38:12,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:12,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-06 05:38:12,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:14,971 INFO L130 PetriNetUnfolder]: 8050/12457 cut-off events. [2022-12-06 05:38:14,972 INFO L131 PetriNetUnfolder]: For 184480/184480 co-relation queries the response was YES. [2022-12-06 05:38:15,034 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 05:38:15,095 INFO L137 encePairwiseOnDemand]: 15/62 looper letters, 338 selfloop transitions, 230 changer transitions 10/578 dead transitions. [2022-12-06 05:38:15,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 578 transitions, 11042 flow [2022-12-06 05:38:15,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 05:38:15,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 05:38:15,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 193 transitions. [2022-12-06 05:38:15,097 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2075268817204301 [2022-12-06 05:38:15,097 INFO L175 Difference]: Start difference. First operand has 170 places, 441 transitions, 8607 flow. Second operand 15 states and 193 transitions. [2022-12-06 05:38:15,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 578 transitions, 11042 flow [2022-12-06 05:38:16,061 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 05:38:16,078 INFO L231 Difference]: Finished difference. Result has 187 places, 483 transitions, 9934 flow [2022-12-06 05:38:16,078 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 05:38:16,079 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 157 predicate places. [2022-12-06 05:38:16,079 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:16,079 INFO L89 Accepts]: Start accepts. Operand has 187 places, 483 transitions, 9934 flow [2022-12-06 05:38:16,080 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:16,080 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:16,080 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 483 transitions, 9934 flow [2022-12-06 05:38:16,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 483 transitions, 9934 flow [2022-12-06 05:38:16,295 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 05:38:16,296 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 05:38:16,296 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:38:16,296 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:38:16,296 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:38:16,296 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 05:38:16,296 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 05:38:16,296 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:38:16,296 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:38:16,296 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:38:16,377 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 05:38:16,377 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 05:38:16,377 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:16,377 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:16,378 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:16,379 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 05:38:16,379 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:38:16,379 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:16,379 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:16,379 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:16,380 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 05:38:16,380 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:38:16,380 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:16,380 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:16,380 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:16,380 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:16,384 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 05:38:16,384 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 05:38:16,384 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:16,384 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:16,384 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:16,425 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 05:38:16,425 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 05:38:16,425 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:16,425 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:16,425 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:16,447 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 05:38:16,448 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:38:16,448 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:16,448 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:16,448 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:16,451 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 05:38:16,451 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:38:16,451 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:16,451 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:16,451 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:16,451 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:16,451 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:16,655 INFO L130 PetriNetUnfolder]: 1871/4446 cut-off events. [2022-12-06 05:38:16,655 INFO L131 PetriNetUnfolder]: For 58170/58917 co-relation queries the response was YES. [2022-12-06 05:38:16,679 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 05:38:16,716 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 187 places, 483 transitions, 9934 flow [2022-12-06 05:38:16,716 INFO L188 LiptonReduction]: Number of co-enabled transitions 2846 [2022-12-06 05:38:16,761 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 05:38:16,814 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 05:38:16,855 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 05:38:16,932 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 05:38:16,973 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:38:16,973 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 894 [2022-12-06 05:38:16,973 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 481 transitions, 9998 flow [2022-12-06 05:38:16,973 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 05:38:16,973 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:16,973 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 05:38:16,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 05:38:17,174 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 05:38:17,174 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 05:38:17,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:17,175 INFO L85 PathProgramCache]: Analyzing trace with hash 452632521, now seen corresponding path program 1 times [2022-12-06 05:38:17,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:17,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379579386] [2022-12-06 05:38:17,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:17,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:17,226 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 05:38:17,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:17,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379579386] [2022-12-06 05:38:17,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379579386] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:38:17,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:38:17,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:38:17,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049466792] [2022-12-06 05:38:17,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:38:17,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:38:17,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:17,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:38:17,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:38:17,227 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 65 [2022-12-06 05:38:17,227 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 05:38:17,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:17,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 65 [2022-12-06 05:38:17,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:19,968 INFO L130 PetriNetUnfolder]: 9780/15352 cut-off events. [2022-12-06 05:38:19,969 INFO L131 PetriNetUnfolder]: For 261960/261960 co-relation queries the response was YES. [2022-12-06 05:38:20,040 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 05:38:20,102 INFO L137 encePairwiseOnDemand]: 43/65 looper letters, 377 selfloop transitions, 257 changer transitions 1/635 dead transitions. [2022-12-06 05:38:20,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 635 transitions, 13876 flow [2022-12-06 05:38:20,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:38:20,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:38:20,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2022-12-06 05:38:20,103 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28205128205128205 [2022-12-06 05:38:20,103 INFO L175 Difference]: Start difference. First operand has 185 places, 481 transitions, 9998 flow. Second operand 6 states and 110 transitions. [2022-12-06 05:38:20,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 635 transitions, 13876 flow [2022-12-06 05:38:21,280 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 05:38:21,291 INFO L231 Difference]: Finished difference. Result has 192 places, 532 transitions, 11777 flow [2022-12-06 05:38:21,291 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 05:38:21,292 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 162 predicate places. [2022-12-06 05:38:21,292 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:21,292 INFO L89 Accepts]: Start accepts. Operand has 192 places, 532 transitions, 11777 flow [2022-12-06 05:38:21,293 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:21,294 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:21,294 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 532 transitions, 11777 flow [2022-12-06 05:38:21,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 532 transitions, 11777 flow [2022-12-06 05:38:21,964 INFO L130 PetriNetUnfolder]: 2346/5736 cut-off events. [2022-12-06 05:38:21,964 INFO L131 PetriNetUnfolder]: For 85648/86367 co-relation queries the response was YES. [2022-12-06 05:38:22,003 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 05:38:22,059 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 532 transitions, 11777 flow [2022-12-06 05:38:22,059 INFO L188 LiptonReduction]: Number of co-enabled transitions 3090 [2022-12-06 05:38:22,076 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 05:38:22,120 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 05:38:22,164 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 05:38:22,210 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 05:38:22,232 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 05:38:22,322 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 05:38:22,358 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:38:22,359 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1067 [2022-12-06 05:38:22,359 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 532 transitions, 11853 flow [2022-12-06 05:38:22,359 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 05:38:22,359 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:22,359 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 05:38:22,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-06 05:38:22,359 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 05:38:22,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:22,360 INFO L85 PathProgramCache]: Analyzing trace with hash 2104065300, now seen corresponding path program 1 times [2022-12-06 05:38:22,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:22,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398854095] [2022-12-06 05:38:22,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:22,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:22,543 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 05:38:22,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:22,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398854095] [2022-12-06 05:38:22,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398854095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:38:22,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:38:22,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:38:22,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659729296] [2022-12-06 05:38:22,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:38:22,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:38:22,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:22,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:38:22,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:38:22,545 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 67 [2022-12-06 05:38:22,545 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 05:38:22,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:22,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 67 [2022-12-06 05:38:22,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:25,434 INFO L130 PetriNetUnfolder]: 9785/15370 cut-off events. [2022-12-06 05:38:25,435 INFO L131 PetriNetUnfolder]: For 304588/304588 co-relation queries the response was YES. [2022-12-06 05:38:25,554 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 05:38:25,627 INFO L137 encePairwiseOnDemand]: 64/67 looper letters, 619 selfloop transitions, 1 changer transitions 10/630 dead transitions. [2022-12-06 05:38:25,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 630 transitions, 14646 flow [2022-12-06 05:38:25,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:38:25,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:38:25,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-12-06 05:38:25,628 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39925373134328357 [2022-12-06 05:38:25,628 INFO L175 Difference]: Start difference. First operand has 191 places, 532 transitions, 11853 flow. Second operand 4 states and 107 transitions. [2022-12-06 05:38:25,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 630 transitions, 14646 flow [2022-12-06 05:38:27,162 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 05:38:27,172 INFO L231 Difference]: Finished difference. Result has 193 places, 530 transitions, 11703 flow [2022-12-06 05:38:27,173 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 05:38:27,173 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 163 predicate places. [2022-12-06 05:38:27,173 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:27,173 INFO L89 Accepts]: Start accepts. Operand has 193 places, 530 transitions, 11703 flow [2022-12-06 05:38:27,175 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:27,175 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:27,176 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 530 transitions, 11703 flow [2022-12-06 05:38:27,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 530 transitions, 11703 flow [2022-12-06 05:38:27,930 INFO L130 PetriNetUnfolder]: 2350/5726 cut-off events. [2022-12-06 05:38:27,930 INFO L131 PetriNetUnfolder]: For 85212/85951 co-relation queries the response was YES. [2022-12-06 05:38:27,965 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 05:38:28,016 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 190 places, 530 transitions, 11703 flow [2022-12-06 05:38:28,016 INFO L188 LiptonReduction]: Number of co-enabled transitions 3080 [2022-12-06 05:38:28,018 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:38:28,019 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 846 [2022-12-06 05:38:28,019 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 530 transitions, 11703 flow [2022-12-06 05:38:28,019 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 05:38:28,019 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:28,019 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 05:38:28,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-06 05:38:28,019 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 05:38:28,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:28,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1694341722, now seen corresponding path program 1 times [2022-12-06 05:38:28,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:28,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168669034] [2022-12-06 05:38:28,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:28,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:28,455 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 05:38:28,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:28,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168669034] [2022-12-06 05:38:28,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168669034] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:38:28,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335038894] [2022-12-06 05:38:28,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:28,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:38:28,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:38:28,457 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 05:38:28,459 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 05:38:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:28,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 05:38:28,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:38:28,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:38:28,732 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:28,732 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 05:38:28,784 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 05:38:28,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:38:28,881 INFO L321 Elim1Store]: treesize reduction 10, result has 76.7 percent of original size [2022-12-06 05:38:28,881 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 05:38:29,005 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 05:38:29,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335038894] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:38:29,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:38:29,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 16 [2022-12-06 05:38:29,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78138019] [2022-12-06 05:38:29,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:38:29,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 05:38:29,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:29,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 05:38:29,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-12-06 05:38:29,006 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-06 05:38:29,006 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 05:38:29,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:29,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-06 05:38:29,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:32,629 INFO L130 PetriNetUnfolder]: 9955/15633 cut-off events. [2022-12-06 05:38:32,629 INFO L131 PetriNetUnfolder]: For 302158/302158 co-relation queries the response was YES. [2022-12-06 05:38:32,750 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 05:38:32,844 INFO L137 encePairwiseOnDemand]: 21/66 looper letters, 481 selfloop transitions, 153 changer transitions 11/645 dead transitions. [2022-12-06 05:38:32,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 645 transitions, 14175 flow [2022-12-06 05:38:32,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 05:38:32,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 05:38:32,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 174 transitions. [2022-12-06 05:38:32,846 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16477272727272727 [2022-12-06 05:38:32,846 INFO L175 Difference]: Start difference. First operand has 190 places, 530 transitions, 11703 flow. Second operand 16 states and 174 transitions. [2022-12-06 05:38:32,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 645 transitions, 14175 flow [2022-12-06 05:38:34,752 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 05:38:34,767 INFO L231 Difference]: Finished difference. Result has 209 places, 564 transitions, 12720 flow [2022-12-06 05:38:34,767 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 05:38:34,768 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 179 predicate places. [2022-12-06 05:38:34,768 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:34,768 INFO L89 Accepts]: Start accepts. Operand has 209 places, 564 transitions, 12720 flow [2022-12-06 05:38:34,771 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:34,771 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:34,771 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 209 places, 564 transitions, 12720 flow [2022-12-06 05:38:34,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 564 transitions, 12720 flow [2022-12-06 05:38:35,853 INFO L130 PetriNetUnfolder]: 2361/5777 cut-off events. [2022-12-06 05:38:35,854 INFO L131 PetriNetUnfolder]: For 95569/96313 co-relation queries the response was YES. [2022-12-06 05:38:35,909 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 05:38:35,975 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 564 transitions, 12720 flow [2022-12-06 05:38:35,975 INFO L188 LiptonReduction]: Number of co-enabled transitions 3278 [2022-12-06 05:38:35,977 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 05:38:36,133 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 05:38:36,227 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 05:38:36,497 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 05:38:36,623 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 05:38:36,782 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 05:38:36,981 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 05:38:37,081 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:38:37,088 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2320 [2022-12-06 05:38:37,088 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 564 transitions, 13013 flow [2022-12-06 05:38:37,088 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 05:38:37,088 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:37,088 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 05:38:37,094 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 05:38:37,290 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 05:38:37,290 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 05:38:37,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:37,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1535386000, now seen corresponding path program 1 times [2022-12-06 05:38:37,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:37,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789284607] [2022-12-06 05:38:37,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:37,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:37,954 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 05:38:37,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:37,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789284607] [2022-12-06 05:38:37,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789284607] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:38:37,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924165322] [2022-12-06 05:38:37,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:37,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:38:37,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:38:37,959 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 05:38:37,960 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 05:38:38,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:38,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-06 05:38:38,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:38:38,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:38:38,149 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 05:38:38,153 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 05:38:38,160 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 05:38:38,205 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 05:38:38,245 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 05:38:38,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:38:38,351 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:38:38,351 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 05:38:38,442 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 05:38:38,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:38:40,599 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 05:38:40,631 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 05:38:40,645 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 05:38:40,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924165322] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:38:40,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:38:40,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 05:38:40,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217960848] [2022-12-06 05:38:40,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:38:40,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 05:38:40,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:40,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 05:38:40,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=206, Unknown=2, NotChecked=62, Total=342 [2022-12-06 05:38:40,646 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 75 [2022-12-06 05:38:40,646 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 05:38:40,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:40,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 75 [2022-12-06 05:38:40,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:45,497 INFO L130 PetriNetUnfolder]: 10167/15972 cut-off events. [2022-12-06 05:38:45,498 INFO L131 PetriNetUnfolder]: For 338090/338090 co-relation queries the response was YES. [2022-12-06 05:38:45,581 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 05:38:45,657 INFO L137 encePairwiseOnDemand]: 21/75 looper letters, 514 selfloop transitions, 177 changer transitions 10/701 dead transitions. [2022-12-06 05:38:45,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 701 transitions, 16136 flow [2022-12-06 05:38:45,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 05:38:45,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 05:38:45,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 199 transitions. [2022-12-06 05:38:45,658 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1768888888888889 [2022-12-06 05:38:45,658 INFO L175 Difference]: Start difference. First operand has 209 places, 564 transitions, 13013 flow. Second operand 15 states and 199 transitions. [2022-12-06 05:38:45,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 701 transitions, 16136 flow [2022-12-06 05:38:47,268 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 05:38:47,282 INFO L231 Difference]: Finished difference. Result has 225 places, 601 transitions, 13990 flow [2022-12-06 05:38:47,283 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 05:38:47,283 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 195 predicate places. [2022-12-06 05:38:47,283 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:47,283 INFO L89 Accepts]: Start accepts. Operand has 225 places, 601 transitions, 13990 flow [2022-12-06 05:38:47,285 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:47,285 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:47,285 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 225 places, 601 transitions, 13990 flow [2022-12-06 05:38:47,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 601 transitions, 13990 flow [2022-12-06 05:38:48,383 INFO L130 PetriNetUnfolder]: 2394/5892 cut-off events. [2022-12-06 05:38:48,383 INFO L131 PetriNetUnfolder]: For 113142/113940 co-relation queries the response was YES. [2022-12-06 05:38:48,418 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 05:38:48,469 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 601 transitions, 13990 flow [2022-12-06 05:38:48,478 INFO L188 LiptonReduction]: Number of co-enabled transitions 3434 [2022-12-06 05:38:48,481 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:38:48,488 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1205 [2022-12-06 05:38:48,489 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 601 transitions, 13990 flow [2022-12-06 05:38:48,489 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 05:38:48,489 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:48,489 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 05:38:48,495 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 05:38:48,695 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 05:38:48,695 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 05:38:48,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:48,696 INFO L85 PathProgramCache]: Analyzing trace with hash 519353206, now seen corresponding path program 1 times [2022-12-06 05:38:48,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:48,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885098269] [2022-12-06 05:38:48,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:48,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:48,738 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 05:38:48,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:48,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885098269] [2022-12-06 05:38:48,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885098269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:38:48,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:38:48,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:38:48,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490828759] [2022-12-06 05:38:48,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:38:48,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:38:48,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:48,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:38:48,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:38:48,740 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 72 [2022-12-06 05:38:48,740 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 05:38:48,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:48,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 72 [2022-12-06 05:38:48,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:52,393 INFO L130 PetriNetUnfolder]: 9920/15844 cut-off events. [2022-12-06 05:38:52,393 INFO L131 PetriNetUnfolder]: For 395700/397001 co-relation queries the response was YES. [2022-12-06 05:38:52,502 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 05:38:52,681 INFO L137 encePairwiseOnDemand]: 61/72 looper letters, 712 selfloop transitions, 10 changer transitions 1/734 dead transitions. [2022-12-06 05:38:52,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 734 transitions, 17787 flow [2022-12-06 05:38:52,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:38:52,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:38:52,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2022-12-06 05:38:52,682 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-06 05:38:52,683 INFO L175 Difference]: Start difference. First operand has 223 places, 601 transitions, 13990 flow. Second operand 4 states and 128 transitions. [2022-12-06 05:38:52,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 734 transitions, 17787 flow [2022-12-06 05:38:54,408 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 05:38:54,419 INFO L231 Difference]: Finished difference. Result has 222 places, 594 transitions, 13506 flow [2022-12-06 05:38:54,420 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 05:38:54,420 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 192 predicate places. [2022-12-06 05:38:54,420 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:54,420 INFO L89 Accepts]: Start accepts. Operand has 222 places, 594 transitions, 13506 flow [2022-12-06 05:38:54,423 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:54,423 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:54,424 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 222 places, 594 transitions, 13506 flow [2022-12-06 05:38:54,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 221 places, 594 transitions, 13506 flow [2022-12-06 05:38:55,412 INFO L130 PetriNetUnfolder]: 2458/6137 cut-off events. [2022-12-06 05:38:55,413 INFO L131 PetriNetUnfolder]: For 114852/115638 co-relation queries the response was YES. [2022-12-06 05:38:55,448 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 05:38:55,503 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 221 places, 594 transitions, 13506 flow [2022-12-06 05:38:55,504 INFO L188 LiptonReduction]: Number of co-enabled transitions 3406 [2022-12-06 05:38:55,507 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:38:55,507 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1087 [2022-12-06 05:38:55,507 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 594 transitions, 13506 flow [2022-12-06 05:38:55,507 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 05:38:55,508 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:55,508 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 05:38:55,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-06 05:38:55,508 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 05:38:55,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:55,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1220804560, now seen corresponding path program 1 times [2022-12-06 05:38:55,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:55,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435702161] [2022-12-06 05:38:55,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:55,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:55,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:55,559 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 05:38:55,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:55,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435702161] [2022-12-06 05:38:55,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435702161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:38:55,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:38:55,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:38:55,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919973711] [2022-12-06 05:38:55,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:38:55,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:38:55,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:55,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:38:55,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:38:55,560 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-06 05:38:55,561 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 05:38:55,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:55,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-06 05:38:55,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:59,128 INFO L130 PetriNetUnfolder]: 10646/16795 cut-off events. [2022-12-06 05:38:59,128 INFO L131 PetriNetUnfolder]: For 390152/390152 co-relation queries the response was YES. [2022-12-06 05:38:59,218 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 05:38:59,290 INFO L137 encePairwiseOnDemand]: 56/72 looper letters, 720 selfloop transitions, 49 changer transitions 1/770 dead transitions. [2022-12-06 05:38:59,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 770 transitions, 17861 flow [2022-12-06 05:38:59,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:38:59,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:38:59,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2022-12-06 05:38:59,291 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3638888888888889 [2022-12-06 05:38:59,291 INFO L175 Difference]: Start difference. First operand has 221 places, 594 transitions, 13506 flow. Second operand 5 states and 131 transitions. [2022-12-06 05:38:59,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 770 transitions, 17861 flow [2022-12-06 05:39:01,336 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 05:39:01,347 INFO L231 Difference]: Finished difference. Result has 224 places, 596 transitions, 13752 flow [2022-12-06 05:39:01,347 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 05:39:01,348 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 194 predicate places. [2022-12-06 05:39:01,348 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:39:01,348 INFO L89 Accepts]: Start accepts. Operand has 224 places, 596 transitions, 13752 flow [2022-12-06 05:39:01,350 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:39:01,350 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:39:01,350 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 224 places, 596 transitions, 13752 flow [2022-12-06 05:39:01,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 224 places, 596 transitions, 13752 flow [2022-12-06 05:39:02,175 INFO L130 PetriNetUnfolder]: 2477/6171 cut-off events. [2022-12-06 05:39:02,175 INFO L131 PetriNetUnfolder]: For 128060/128843 co-relation queries the response was YES. [2022-12-06 05:39:02,215 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 05:39:02,273 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 224 places, 596 transitions, 13752 flow [2022-12-06 05:39:02,273 INFO L188 LiptonReduction]: Number of co-enabled transitions 3422 [2022-12-06 05:39:02,277 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:39:02,277 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 929 [2022-12-06 05:39:02,277 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 596 transitions, 13752 flow [2022-12-06 05:39:02,277 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 05:39:02,277 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:39:02,277 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 05:39:02,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-06 05:39:02,277 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 05:39:02,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:39:02,278 INFO L85 PathProgramCache]: Analyzing trace with hash 552434898, now seen corresponding path program 2 times [2022-12-06 05:39:02,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:39:02,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082890956] [2022-12-06 05:39:02,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:39:02,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:39:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:39:02,959 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 05:39:02,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:39:02,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082890956] [2022-12-06 05:39:02,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082890956] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:39:02,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815253727] [2022-12-06 05:39:02,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:39:02,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:39:02,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:39:02,961 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 05:39:02,962 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 05:39:03,121 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:39:03,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:39:03,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-06 05:39:03,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:39:03,280 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 05:39:03,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:39:03,281 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 05:39:03,284 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:39:03,285 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 05:39:03,313 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 05:39:03,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:39:03,399 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:39:03,399 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 05:39:03,730 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 05:39:03,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815253727] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:39:03,730 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:39:03,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 13 [2022-12-06 05:39:03,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387208322] [2022-12-06 05:39:03,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:39:03,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 05:39:03,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:39:03,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 05:39:03,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-12-06 05:39:03,731 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 71 [2022-12-06 05:39:03,731 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 05:39:03,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:39:03,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 71 [2022-12-06 05:39:03,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:39:08,343 INFO L130 PetriNetUnfolder]: 10644/16783 cut-off events. [2022-12-06 05:39:08,343 INFO L131 PetriNetUnfolder]: For 426641/426641 co-relation queries the response was YES. [2022-12-06 05:39:08,445 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 05:39:08,537 INFO L137 encePairwiseOnDemand]: 22/71 looper letters, 508 selfloop transitions, 161 changer transitions 6/675 dead transitions. [2022-12-06 05:39:08,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 675 transitions, 15903 flow [2022-12-06 05:39:08,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:39:08,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:39:08,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 164 transitions. [2022-12-06 05:39:08,538 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19248826291079812 [2022-12-06 05:39:08,538 INFO L175 Difference]: Start difference. First operand has 224 places, 596 transitions, 13752 flow. Second operand 12 states and 164 transitions. [2022-12-06 05:39:08,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 675 transitions, 15903 flow [2022-12-06 05:39:10,737 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 05:39:10,748 INFO L231 Difference]: Finished difference. Result has 236 places, 597 transitions, 14106 flow [2022-12-06 05:39:10,749 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 05:39:10,749 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 206 predicate places. [2022-12-06 05:39:10,749 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:39:10,749 INFO L89 Accepts]: Start accepts. Operand has 236 places, 597 transitions, 14106 flow [2022-12-06 05:39:10,751 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:39:10,751 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:39:10,751 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 236 places, 597 transitions, 14106 flow [2022-12-06 05:39:10,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 236 places, 597 transitions, 14106 flow [2022-12-06 05:39:11,629 INFO L130 PetriNetUnfolder]: 2468/6167 cut-off events. [2022-12-06 05:39:11,629 INFO L131 PetriNetUnfolder]: For 123493/124303 co-relation queries the response was YES. [2022-12-06 05:39:11,671 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 05:39:11,734 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 236 places, 597 transitions, 14106 flow [2022-12-06 05:39:11,734 INFO L188 LiptonReduction]: Number of co-enabled transitions 3436 [2022-12-06 05:39:11,776 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 05:39:11,826 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 05:39:11,878 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:39:11,879 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1130 [2022-12-06 05:39:11,879 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 597 transitions, 14156 flow [2022-12-06 05:39:11,879 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 05:39:11,879 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:39:11,879 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 05:39:11,900 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 05:39:12,085 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 05:39:12,086 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 05:39:12,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:39:12,086 INFO L85 PathProgramCache]: Analyzing trace with hash 396970509, now seen corresponding path program 2 times [2022-12-06 05:39:12,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:39:12,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258331406] [2022-12-06 05:39:12,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:39:12,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:39:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:39:12,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 05:39:12,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:39:12,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258331406] [2022-12-06 05:39:12,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258331406] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:39:12,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:39:12,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:39:12,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153514345] [2022-12-06 05:39:12,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:39:12,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:39:12,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:39:12,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:39:12,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:39:12,139 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 73 [2022-12-06 05:39:12,139 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 05:39:12,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:39:12,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 73 [2022-12-06 05:39:12,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:39:16,608 INFO L130 PetriNetUnfolder]: 11010/17195 cut-off events. [2022-12-06 05:39:16,608 INFO L131 PetriNetUnfolder]: For 426350/426350 co-relation queries the response was YES. [2022-12-06 05:39:16,786 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 05:39:16,893 INFO L137 encePairwiseOnDemand]: 32/73 looper letters, 482 selfloop transitions, 262 changer transitions 12/756 dead transitions. [2022-12-06 05:39:16,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 756 transitions, 18495 flow [2022-12-06 05:39:16,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:39:16,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:39:16,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2022-12-06 05:39:16,895 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2482876712328767 [2022-12-06 05:39:16,895 INFO L175 Difference]: Start difference. First operand has 236 places, 597 transitions, 14156 flow. Second operand 8 states and 145 transitions. [2022-12-06 05:39:16,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 756 transitions, 18495 flow [2022-12-06 05:39:19,166 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 05:39:19,178 INFO L231 Difference]: Finished difference. Result has 239 places, 616 transitions, 15309 flow [2022-12-06 05:39:19,178 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 05:39:19,178 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 209 predicate places. [2022-12-06 05:39:19,178 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:39:19,178 INFO L89 Accepts]: Start accepts. Operand has 239 places, 616 transitions, 15309 flow [2022-12-06 05:39:19,180 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:39:19,180 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:39:19,180 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 239 places, 616 transitions, 15309 flow [2022-12-06 05:39:19,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 239 places, 616 transitions, 15309 flow [2022-12-06 05:39:20,312 INFO L130 PetriNetUnfolder]: 2504/6131 cut-off events. [2022-12-06 05:39:20,312 INFO L131 PetriNetUnfolder]: For 136353/137135 co-relation queries the response was YES. [2022-12-06 05:39:20,368 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 05:39:20,449 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 239 places, 616 transitions, 15309 flow [2022-12-06 05:39:20,450 INFO L188 LiptonReduction]: Number of co-enabled transitions 3646 [2022-12-06 05:39:20,454 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:39:20,455 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1277 [2022-12-06 05:39:20,455 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 616 transitions, 15309 flow [2022-12-06 05:39:20,455 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 05:39:20,455 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:39:20,455 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:39:20,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-06 05:39:20,455 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 05:39:20,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:39:20,455 INFO L85 PathProgramCache]: Analyzing trace with hash -10762417, now seen corresponding path program 1 times [2022-12-06 05:39:20,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:39:20,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060807082] [2022-12-06 05:39:20,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:39:20,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:39:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:39:20,501 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 05:39:20,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:39:20,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060807082] [2022-12-06 05:39:20,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060807082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:39:20,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:39:20,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:39:20,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38017285] [2022-12-06 05:39:20,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:39:20,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:39:20,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:39:20,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:39:20,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:39:20,502 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 73 [2022-12-06 05:39:20,502 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 05:39:20,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:39:20,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 73 [2022-12-06 05:39:20,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:39:24,325 INFO L130 PetriNetUnfolder]: 10143/16026 cut-off events. [2022-12-06 05:39:24,326 INFO L131 PetriNetUnfolder]: For 472757/474129 co-relation queries the response was YES. [2022-12-06 05:39:24,512 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 05:39:24,585 INFO L137 encePairwiseOnDemand]: 51/73 looper letters, 784 selfloop transitions, 27 changer transitions 0/827 dead transitions. [2022-12-06 05:39:24,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 827 transitions, 21230 flow [2022-12-06 05:39:24,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:39:24,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:39:24,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2022-12-06 05:39:24,587 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36712328767123287 [2022-12-06 05:39:24,587 INFO L175 Difference]: Start difference. First operand has 239 places, 616 transitions, 15309 flow. Second operand 5 states and 134 transitions. [2022-12-06 05:39:24,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 827 transitions, 21230 flow [2022-12-06 05:39:26,511 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 05:39:26,523 INFO L231 Difference]: Finished difference. Result has 244 places, 618 transitions, 15031 flow [2022-12-06 05:39:26,523 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 05:39:26,524 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 214 predicate places. [2022-12-06 05:39:26,524 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:39:26,524 INFO L89 Accepts]: Start accepts. Operand has 244 places, 618 transitions, 15031 flow [2022-12-06 05:39:26,526 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:39:26,526 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:39:26,526 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 618 transitions, 15031 flow [2022-12-06 05:39:26,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 244 places, 618 transitions, 15031 flow [2022-12-06 05:39:27,363 INFO L130 PetriNetUnfolder]: 2482/6094 cut-off events. [2022-12-06 05:39:27,363 INFO L131 PetriNetUnfolder]: For 133862/134615 co-relation queries the response was YES. [2022-12-06 05:39:27,405 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 05:39:27,467 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 244 places, 618 transitions, 15031 flow [2022-12-06 05:39:27,467 INFO L188 LiptonReduction]: Number of co-enabled transitions 3786 [2022-12-06 05:39:27,478 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:39:27,478 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 954 [2022-12-06 05:39:27,478 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 618 transitions, 15031 flow [2022-12-06 05:39:27,479 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 05:39:27,479 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:39:27,479 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 05:39:27,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-06 05:39:27,479 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 05:39:27,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:39:27,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1400502564, now seen corresponding path program 1 times [2022-12-06 05:39:27,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:39:27,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609642211] [2022-12-06 05:39:27,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:39:27,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:39:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:39:27,603 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 05:39:27,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:39:27,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609642211] [2022-12-06 05:39:27,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609642211] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:39:27,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:39:27,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:39:27,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226150809] [2022-12-06 05:39:27,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:39:27,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:39:27,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:39:27,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:39:27,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:39:27,605 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-06 05:39:27,605 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 05:39:27,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:39:27,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-06 05:39:27,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:39:31,218 INFO L130 PetriNetUnfolder]: 10891/16986 cut-off events. [2022-12-06 05:39:31,219 INFO L131 PetriNetUnfolder]: For 476401/476401 co-relation queries the response was YES. [2022-12-06 05:39:31,333 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 05:39:31,430 INFO L137 encePairwiseOnDemand]: 58/72 looper letters, 820 selfloop transitions, 35 changer transitions 5/860 dead transitions. [2022-12-06 05:39:31,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 860 transitions, 21098 flow [2022-12-06 05:39:31,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:39:31,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:39:31,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-12-06 05:39:31,431 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2022-12-06 05:39:31,431 INFO L175 Difference]: Start difference. First operand has 244 places, 618 transitions, 15031 flow. Second operand 5 states and 129 transitions. [2022-12-06 05:39:31,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 860 transitions, 21098 flow [2022-12-06 05:39:34,423 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 05:39:34,440 INFO L231 Difference]: Finished difference. Result has 248 places, 627 transitions, 15249 flow [2022-12-06 05:39:34,441 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 05:39:34,441 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 218 predicate places. [2022-12-06 05:39:34,441 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:39:34,441 INFO L89 Accepts]: Start accepts. Operand has 248 places, 627 transitions, 15249 flow [2022-12-06 05:39:34,445 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:39:34,445 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:39:34,445 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 248 places, 627 transitions, 15249 flow [2022-12-06 05:39:34,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 627 transitions, 15249 flow [2022-12-06 05:39:35,636 INFO L130 PetriNetUnfolder]: 2490/6099 cut-off events. [2022-12-06 05:39:35,636 INFO L131 PetriNetUnfolder]: For 142160/142871 co-relation queries the response was YES. [2022-12-06 05:39:35,707 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 05:39:35,801 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 248 places, 627 transitions, 15249 flow [2022-12-06 05:39:35,801 INFO L188 LiptonReduction]: Number of co-enabled transitions 3886 [2022-12-06 05:39:35,807 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:39:35,808 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1367 [2022-12-06 05:39:35,808 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 627 transitions, 15249 flow [2022-12-06 05:39:35,808 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 05:39:35,808 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:39:35,808 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 05:39:35,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-06 05:39:35,809 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 05:39:35,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:39:35,809 INFO L85 PathProgramCache]: Analyzing trace with hash 894334991, now seen corresponding path program 1 times [2022-12-06 05:39:35,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:39:35,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301621479] [2022-12-06 05:39:35,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:39:35,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:39:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:39:35,979 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 05:39:35,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:39:35,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301621479] [2022-12-06 05:39:35,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301621479] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:39:35,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244225223] [2022-12-06 05:39:35,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:39:35,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:39:35,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:39:35,998 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 05:39:36,012 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 05:39:36,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:39:36,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 05:39:36,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:39:36,217 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 05:39:36,217 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:39:36,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244225223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:39:36,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:39:36,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-12-06 05:39:36,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366443824] [2022-12-06 05:39:36,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:39:36,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:39:36,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:39:36,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:39:36,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:39:36,219 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-06 05:39:36,219 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 05:39:36,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:39:36,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-06 05:39:36,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:39:40,250 INFO L130 PetriNetUnfolder]: 9700/15557 cut-off events. [2022-12-06 05:39:40,251 INFO L131 PetriNetUnfolder]: For 462544/462544 co-relation queries the response was YES. [2022-12-06 05:39:40,378 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 05:39:40,470 INFO L137 encePairwiseOnDemand]: 55/72 looper letters, 545 selfloop transitions, 139 changer transitions 14/698 dead transitions. [2022-12-06 05:39:40,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 698 transitions, 17857 flow [2022-12-06 05:39:40,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:39:40,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:39:40,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2022-12-06 05:39:40,472 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-06 05:39:40,472 INFO L175 Difference]: Start difference. First operand has 248 places, 627 transitions, 15249 flow. Second operand 5 states and 135 transitions. [2022-12-06 05:39:40,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 698 transitions, 17857 flow [2022-12-06 05:39:43,908 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 05:39:43,919 INFO L231 Difference]: Finished difference. Result has 251 places, 596 transitions, 15140 flow [2022-12-06 05:39:43,919 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 05:39:43,920 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 221 predicate places. [2022-12-06 05:39:43,920 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:39:43,920 INFO L89 Accepts]: Start accepts. Operand has 251 places, 596 transitions, 15140 flow [2022-12-06 05:39:43,922 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:39:43,922 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:39:43,922 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 251 places, 596 transitions, 15140 flow [2022-12-06 05:39:43,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 251 places, 596 transitions, 15140 flow [2022-12-06 05:39:44,714 INFO L130 PetriNetUnfolder]: 2232/5650 cut-off events. [2022-12-06 05:39:44,714 INFO L131 PetriNetUnfolder]: For 141482/142067 co-relation queries the response was YES. [2022-12-06 05:39:44,756 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 05:39:44,814 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 251 places, 596 transitions, 15140 flow [2022-12-06 05:39:44,814 INFO L188 LiptonReduction]: Number of co-enabled transitions 3558 [2022-12-06 05:39:44,818 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:39:44,819 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 899 [2022-12-06 05:39:44,819 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 596 transitions, 15140 flow [2022-12-06 05:39:44,819 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 05:39:44,819 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:39:44,819 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 05:39:44,824 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 05:39:45,023 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 05:39:45,024 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 05:39:45,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:39:45,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1630963525, now seen corresponding path program 3 times [2022-12-06 05:39:45,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:39:45,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393913162] [2022-12-06 05:39:45,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:39:45,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:39:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:39:45,062 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 05:39:45,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:39:45,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393913162] [2022-12-06 05:39:45,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393913162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:39:45,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:39:45,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:39:45,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862998841] [2022-12-06 05:39:45,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:39:45,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:39:45,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:39:45,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:39:45,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:39:45,063 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 69 [2022-12-06 05:39:45,063 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 05:39:45,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:39:45,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 69 [2022-12-06 05:39:45,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:39:49,312 INFO L130 PetriNetUnfolder]: 8152/13586 cut-off events. [2022-12-06 05:39:49,312 INFO L131 PetriNetUnfolder]: For 462930/464010 co-relation queries the response was YES. [2022-12-06 05:39:49,435 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 05:39:49,526 INFO L137 encePairwiseOnDemand]: 46/69 looper letters, 651 selfloop transitions, 54 changer transitions 43/764 dead transitions. [2022-12-06 05:39:49,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 764 transitions, 20241 flow [2022-12-06 05:39:49,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:39:49,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:39:49,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2022-12-06 05:39:49,527 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3526570048309179 [2022-12-06 05:39:49,528 INFO L175 Difference]: Start difference. First operand has 251 places, 596 transitions, 15140 flow. Second operand 6 states and 146 transitions. [2022-12-06 05:39:49,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 764 transitions, 20241 flow [2022-12-06 05:39:51,831 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 05:39:51,843 INFO L231 Difference]: Finished difference. Result has 256 places, 523 transitions, 13283 flow [2022-12-06 05:39:51,843 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 05:39:51,844 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 226 predicate places. [2022-12-06 05:39:51,844 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:39:51,844 INFO L89 Accepts]: Start accepts. Operand has 256 places, 523 transitions, 13283 flow [2022-12-06 05:39:51,846 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:39:51,846 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:39:51,846 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 256 places, 523 transitions, 13283 flow [2022-12-06 05:39:51,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 255 places, 523 transitions, 13283 flow [2022-12-06 05:39:52,667 INFO L130 PetriNetUnfolder]: 1967/5122 cut-off events. [2022-12-06 05:39:52,668 INFO L131 PetriNetUnfolder]: For 133914/134386 co-relation queries the response was YES. [2022-12-06 05:39:52,716 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 05:39:52,893 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 255 places, 523 transitions, 13283 flow [2022-12-06 05:39:52,894 INFO L188 LiptonReduction]: Number of co-enabled transitions 3116 [2022-12-06 05:39:52,897 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 05:39:53,063 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 05:39:53,155 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 05:39:53,270 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 05:39:53,357 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 05:39:53,451 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:39:53,452 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1608 [2022-12-06 05:39:53,452 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 523 transitions, 13517 flow [2022-12-06 05:39:53,452 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 05:39:53,452 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:39:53,453 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 05:39:53,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-06 05:39:53,453 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 05:39:53,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:39:53,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1308155873, now seen corresponding path program 1 times [2022-12-06 05:39:53,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:39:53,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417368100] [2022-12-06 05:39:53,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:39:53,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:39:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:39:53,500 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 05:39:53,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:39:53,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417368100] [2022-12-06 05:39:53,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417368100] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:39:53,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:39:53,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:39:53,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120145861] [2022-12-06 05:39:53,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:39:53,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:39:53,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:39:53,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:39:53,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:39:53,501 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-06 05:39:53,502 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 05:39:53,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:39:53,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-06 05:39:53,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:39:57,404 INFO L130 PetriNetUnfolder]: 8521/13835 cut-off events. [2022-12-06 05:39:57,404 INFO L131 PetriNetUnfolder]: For 453170/453170 co-relation queries the response was YES. [2022-12-06 05:39:57,483 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 05:39:57,545 INFO L137 encePairwiseOnDemand]: 56/72 looper letters, 558 selfloop transitions, 19 changer transitions 8/585 dead transitions. [2022-12-06 05:39:57,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 585 transitions, 15393 flow [2022-12-06 05:39:57,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:39:57,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:39:57,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-12-06 05:39:57,546 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2022-12-06 05:39:57,546 INFO L175 Difference]: Start difference. First operand has 255 places, 523 transitions, 13517 flow. Second operand 5 states and 129 transitions. [2022-12-06 05:39:57,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 585 transitions, 15393 flow [2022-12-06 05:39:59,750 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 05:39:59,759 INFO L231 Difference]: Finished difference. Result has 249 places, 506 transitions, 12759 flow [2022-12-06 05:39:59,760 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 05:39:59,760 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 219 predicate places. [2022-12-06 05:39:59,760 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:39:59,760 INFO L89 Accepts]: Start accepts. Operand has 249 places, 506 transitions, 12759 flow [2022-12-06 05:39:59,762 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:39:59,762 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:39:59,762 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 249 places, 506 transitions, 12759 flow [2022-12-06 05:39:59,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 244 places, 506 transitions, 12759 flow [2022-12-06 05:40:00,507 INFO L130 PetriNetUnfolder]: 1940/5042 cut-off events. [2022-12-06 05:40:00,507 INFO L131 PetriNetUnfolder]: For 124671/125121 co-relation queries the response was YES. [2022-12-06 05:40:00,540 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 05:40:00,589 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 244 places, 506 transitions, 12759 flow [2022-12-06 05:40:00,590 INFO L188 LiptonReduction]: Number of co-enabled transitions 3036 [2022-12-06 05:40:00,593 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:40:00,593 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 833 [2022-12-06 05:40:00,593 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 506 transitions, 12759 flow [2022-12-06 05:40:00,593 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 05:40:00,593 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:00,593 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 05:40:00,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-06 05:40:00,593 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 05:40:00,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:00,594 INFO L85 PathProgramCache]: Analyzing trace with hash 302763311, now seen corresponding path program 1 times [2022-12-06 05:40:00,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:00,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463856297] [2022-12-06 05:40:00,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:00,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:00,993 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 05:40:00,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:00,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463856297] [2022-12-06 05:40:00,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463856297] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:00,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:00,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:40:00,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474491162] [2022-12-06 05:40:00,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:00,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:40:00,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:00,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:40:00,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:40:00,995 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-06 05:40:00,995 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 05:40:00,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:00,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-06 05:40:00,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:04,693 INFO L130 PetriNetUnfolder]: 8477/13738 cut-off events. [2022-12-06 05:40:04,693 INFO L131 PetriNetUnfolder]: For 418968/418968 co-relation queries the response was YES. [2022-12-06 05:40:04,771 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 05:40:04,850 INFO L137 encePairwiseOnDemand]: 26/66 looper letters, 452 selfloop transitions, 109 changer transitions 1/562 dead transitions. [2022-12-06 05:40:04,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 562 transitions, 14582 flow [2022-12-06 05:40:04,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:40:04,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:40:04,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2022-12-06 05:40:04,851 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2777777777777778 [2022-12-06 05:40:04,851 INFO L175 Difference]: Start difference. First operand has 244 places, 506 transitions, 12759 flow. Second operand 6 states and 110 transitions. [2022-12-06 05:40:04,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 562 transitions, 14582 flow [2022-12-06 05:40:07,536 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 05:40:07,550 INFO L231 Difference]: Finished difference. Result has 248 places, 509 transitions, 13119 flow [2022-12-06 05:40:07,550 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 05:40:07,550 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 218 predicate places. [2022-12-06 05:40:07,551 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:07,551 INFO L89 Accepts]: Start accepts. Operand has 248 places, 509 transitions, 13119 flow [2022-12-06 05:40:07,554 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:07,554 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:07,554 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 248 places, 509 transitions, 13119 flow [2022-12-06 05:40:07,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 509 transitions, 13119 flow [2022-12-06 05:40:08,580 INFO L130 PetriNetUnfolder]: 1946/5006 cut-off events. [2022-12-06 05:40:08,580 INFO L131 PetriNetUnfolder]: For 123978/124427 co-relation queries the response was YES. [2022-12-06 05:40:08,631 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 05:40:08,705 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 248 places, 509 transitions, 13119 flow [2022-12-06 05:40:08,706 INFO L188 LiptonReduction]: Number of co-enabled transitions 3060 [2022-12-06 05:40:08,712 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 05:40:08,771 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 05:40:08,838 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 05:40:08,908 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 05:40:09,079 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:40:09,079 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1528 [2022-12-06 05:40:09,080 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 508 transitions, 13215 flow [2022-12-06 05:40:09,080 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 05:40:09,080 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:09,080 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 05:40:09,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-12-06 05:40:09,080 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 05:40:09,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:09,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1489137960, now seen corresponding path program 1 times [2022-12-06 05:40:09,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:09,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148938937] [2022-12-06 05:40:09,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:09,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:09,134 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 05:40:09,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:09,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148938937] [2022-12-06 05:40:09,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148938937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:09,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:09,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:40:09,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923318890] [2022-12-06 05:40:09,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:09,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:40:09,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:09,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:40:09,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:40:09,136 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-06 05:40:09,136 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 05:40:09,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:09,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-06 05:40:09,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:12,317 INFO L130 PetriNetUnfolder]: 8455/13724 cut-off events. [2022-12-06 05:40:12,317 INFO L131 PetriNetUnfolder]: For 426469/426469 co-relation queries the response was YES. [2022-12-06 05:40:12,383 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 05:40:12,437 INFO L137 encePairwiseOnDemand]: 63/69 looper letters, 545 selfloop transitions, 3 changer transitions 4/552 dead transitions. [2022-12-06 05:40:12,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 552 transitions, 14852 flow [2022-12-06 05:40:12,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:40:12,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:40:12,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-12-06 05:40:12,438 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4057971014492754 [2022-12-06 05:40:12,438 INFO L175 Difference]: Start difference. First operand has 247 places, 508 transitions, 13215 flow. Second operand 4 states and 112 transitions. [2022-12-06 05:40:12,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 552 transitions, 14852 flow [2022-12-06 05:40:14,203 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 05:40:14,212 INFO L231 Difference]: Finished difference. Result has 249 places, 499 transitions, 12743 flow [2022-12-06 05:40:14,212 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 05:40:14,212 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 219 predicate places. [2022-12-06 05:40:14,213 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:14,213 INFO L89 Accepts]: Start accepts. Operand has 249 places, 499 transitions, 12743 flow [2022-12-06 05:40:14,214 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:14,214 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:14,215 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 249 places, 499 transitions, 12743 flow [2022-12-06 05:40:14,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 499 transitions, 12743 flow [2022-12-06 05:40:14,893 INFO L130 PetriNetUnfolder]: 1932/5006 cut-off events. [2022-12-06 05:40:14,893 INFO L131 PetriNetUnfolder]: For 123204/123685 co-relation queries the response was YES. [2022-12-06 05:40:14,927 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 05:40:14,976 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 248 places, 499 transitions, 12743 flow [2022-12-06 05:40:14,976 INFO L188 LiptonReduction]: Number of co-enabled transitions 2982 [2022-12-06 05:40:14,984 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 05:40:15,070 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:40:15,071 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 858 [2022-12-06 05:40:15,071 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 498 transitions, 12733 flow [2022-12-06 05:40:15,071 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 05:40:15,071 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:15,071 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 05:40:15,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-12-06 05:40:15,071 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 05:40:15,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:15,071 INFO L85 PathProgramCache]: Analyzing trace with hash 2116915678, now seen corresponding path program 1 times [2022-12-06 05:40:15,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:15,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147572292] [2022-12-06 05:40:15,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:15,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:15,512 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 05:40:15,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:15,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147572292] [2022-12-06 05:40:15,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147572292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:15,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:15,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:40:15,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214506887] [2022-12-06 05:40:15,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:15,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:40:15,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:15,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:40:15,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:40:15,514 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 67 [2022-12-06 05:40:15,514 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 05:40:15,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:15,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 67 [2022-12-06 05:40:15,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:18,509 INFO L130 PetriNetUnfolder]: 8391/13592 cut-off events. [2022-12-06 05:40:18,510 INFO L131 PetriNetUnfolder]: For 408791/408791 co-relation queries the response was YES. [2022-12-06 05:40:18,601 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 05:40:18,662 INFO L137 encePairwiseOnDemand]: 27/67 looper letters, 437 selfloop transitions, 104 changer transitions 8/549 dead transitions. [2022-12-06 05:40:18,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 549 transitions, 14477 flow [2022-12-06 05:40:18,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:40:18,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:40:18,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2022-12-06 05:40:18,663 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31343283582089554 [2022-12-06 05:40:18,663 INFO L175 Difference]: Start difference. First operand has 247 places, 498 transitions, 12733 flow. Second operand 5 states and 105 transitions. [2022-12-06 05:40:18,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 549 transitions, 14477 flow [2022-12-06 05:40:20,417 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 05:40:20,426 INFO L231 Difference]: Finished difference. Result has 248 places, 499 transitions, 12860 flow [2022-12-06 05:40:20,426 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 05:40:20,427 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 218 predicate places. [2022-12-06 05:40:20,427 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:20,427 INFO L89 Accepts]: Start accepts. Operand has 248 places, 499 transitions, 12860 flow [2022-12-06 05:40:20,428 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:20,428 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:20,429 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 248 places, 499 transitions, 12860 flow [2022-12-06 05:40:20,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 499 transitions, 12860 flow [2022-12-06 05:40:21,183 INFO L130 PetriNetUnfolder]: 1931/4958 cut-off events. [2022-12-06 05:40:21,183 INFO L131 PetriNetUnfolder]: For 122426/122881 co-relation queries the response was YES. [2022-12-06 05:40:21,217 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 05:40:21,266 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 248 places, 499 transitions, 12860 flow [2022-12-06 05:40:21,266 INFO L188 LiptonReduction]: Number of co-enabled transitions 2982 [2022-12-06 05:40:21,269 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:40:21,270 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 843 [2022-12-06 05:40:21,270 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 499 transitions, 12860 flow [2022-12-06 05:40:21,270 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 05:40:21,270 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:21,270 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 05:40:21,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-12-06 05:40:21,270 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 05:40:21,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:21,270 INFO L85 PathProgramCache]: Analyzing trace with hash -586902770, now seen corresponding path program 1 times [2022-12-06 05:40:21,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:21,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164404644] [2022-12-06 05:40:21,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:21,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:21,301 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 05:40:21,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:21,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164404644] [2022-12-06 05:40:21,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164404644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:21,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:21,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:40:21,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595202672] [2022-12-06 05:40:21,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:21,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:40:21,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:21,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:40:21,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:40:21,302 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 67 [2022-12-06 05:40:21,302 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 05:40:21,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:21,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 67 [2022-12-06 05:40:21,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:24,142 INFO L130 PetriNetUnfolder]: 7645/12613 cut-off events. [2022-12-06 05:40:24,142 INFO L131 PetriNetUnfolder]: For 396272/397338 co-relation queries the response was YES. [2022-12-06 05:40:24,222 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 05:40:24,411 INFO L137 encePairwiseOnDemand]: 65/67 looper letters, 518 selfloop transitions, 1 changer transitions 0/535 dead transitions. [2022-12-06 05:40:24,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 535 transitions, 14388 flow [2022-12-06 05:40:24,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:40:24,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:40:24,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2022-12-06 05:40:24,412 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48756218905472637 [2022-12-06 05:40:24,412 INFO L175 Difference]: Start difference. First operand has 248 places, 499 transitions, 12860 flow. Second operand 3 states and 98 transitions. [2022-12-06 05:40:24,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 535 transitions, 14388 flow [2022-12-06 05:40:25,848 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 05:40:25,857 INFO L231 Difference]: Finished difference. Result has 246 places, 498 transitions, 12517 flow [2022-12-06 05:40:25,857 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 05:40:25,858 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 216 predicate places. [2022-12-06 05:40:25,858 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:25,858 INFO L89 Accepts]: Start accepts. Operand has 246 places, 498 transitions, 12517 flow [2022-12-06 05:40:25,860 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:25,860 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:25,860 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 246 places, 498 transitions, 12517 flow [2022-12-06 05:40:25,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 246 places, 498 transitions, 12517 flow [2022-12-06 05:40:26,606 INFO L130 PetriNetUnfolder]: 1916/4959 cut-off events. [2022-12-06 05:40:26,606 INFO L131 PetriNetUnfolder]: For 118389/118861 co-relation queries the response was YES. [2022-12-06 05:40:26,643 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 05:40:26,696 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 246 places, 498 transitions, 12517 flow [2022-12-06 05:40:26,697 INFO L188 LiptonReduction]: Number of co-enabled transitions 2980 [2022-12-06 05:40:26,700 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:40:26,701 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 843 [2022-12-06 05:40:26,701 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 498 transitions, 12517 flow [2022-12-06 05:40:26,701 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 05:40:26,701 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:26,701 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 05:40:26,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-12-06 05:40:26,701 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 05:40:26,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:26,702 INFO L85 PathProgramCache]: Analyzing trace with hash 531260263, now seen corresponding path program 3 times [2022-12-06 05:40:26,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:26,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259548633] [2022-12-06 05:40:26,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:26,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:26,753 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 05:40:26,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:26,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259548633] [2022-12-06 05:40:26,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259548633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:26,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:26,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:40:26,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718279567] [2022-12-06 05:40:26,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:26,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:40:26,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:26,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:40:26,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:40:26,754 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-06 05:40:26,754 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 05:40:26,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:26,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-06 05:40:26,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:29,603 INFO L130 PetriNetUnfolder]: 8175/13127 cut-off events. [2022-12-06 05:40:29,603 INFO L131 PetriNetUnfolder]: For 391050/391050 co-relation queries the response was YES. [2022-12-06 05:40:29,695 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 05:40:29,760 INFO L137 encePairwiseOnDemand]: 43/66 looper letters, 298 selfloop transitions, 272 changer transitions 11/581 dead transitions. [2022-12-06 05:40:29,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 581 transitions, 15140 flow [2022-12-06 05:40:29,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:40:29,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:40:29,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2022-12-06 05:40:29,761 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2601010101010101 [2022-12-06 05:40:29,761 INFO L175 Difference]: Start difference. First operand has 246 places, 498 transitions, 12517 flow. Second operand 6 states and 103 transitions. [2022-12-06 05:40:29,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 581 transitions, 15140 flow [2022-12-06 05:40:31,524 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 05:40:31,534 INFO L231 Difference]: Finished difference. Result has 252 places, 495 transitions, 13178 flow [2022-12-06 05:40:31,534 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 05:40:31,535 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 222 predicate places. [2022-12-06 05:40:31,535 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:31,535 INFO L89 Accepts]: Start accepts. Operand has 252 places, 495 transitions, 13178 flow [2022-12-06 05:40:31,537 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:31,537 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:31,537 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 252 places, 495 transitions, 13178 flow [2022-12-06 05:40:31,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 252 places, 495 transitions, 13178 flow [2022-12-06 05:40:32,224 INFO L130 PetriNetUnfolder]: 1894/4752 cut-off events. [2022-12-06 05:40:32,224 INFO L131 PetriNetUnfolder]: For 128487/128901 co-relation queries the response was YES. [2022-12-06 05:40:32,263 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 05:40:32,416 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 252 places, 495 transitions, 13178 flow [2022-12-06 05:40:32,416 INFO L188 LiptonReduction]: Number of co-enabled transitions 2982 [2022-12-06 05:40:32,420 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:40:32,420 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 885 [2022-12-06 05:40:32,420 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 495 transitions, 13178 flow [2022-12-06 05:40:32,420 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 05:40:32,420 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:32,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 05:40:32,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-12-06 05:40:32,421 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 05:40:32,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:32,421 INFO L85 PathProgramCache]: Analyzing trace with hash 175108820, now seen corresponding path program 1 times [2022-12-06 05:40:32,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:32,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698650062] [2022-12-06 05:40:32,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:32,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:32,727 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 05:40:32,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:32,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698650062] [2022-12-06 05:40:32,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698650062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:32,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:32,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:40:32,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527617318] [2022-12-06 05:40:32,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:32,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:40:32,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:32,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:40:32,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:40:32,729 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-06 05:40:32,729 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 05:40:32,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:32,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-06 05:40:32,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand