/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/pthread/stack_longer-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:05:57,464 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:05:57,465 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:05:57,501 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:05:57,502 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:05:57,504 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:05:57,506 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:05:57,509 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:05:57,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:05:57,517 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:05:57,517 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:05:57,519 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:05:57,519 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:05:57,521 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:05:57,521 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:05:57,524 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:05:57,524 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:05:57,525 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:05:57,527 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:05:57,530 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:05:57,531 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:05:57,531 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:05:57,532 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:05:57,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:05:57,537 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:05:57,538 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:05:57,538 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:05:57,539 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:05:57,539 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:05:57,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:05:57,540 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:05:57,544 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:05:57,544 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:05:57,545 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:05:57,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:05:57,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:05:57,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:05:57,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:05:57,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:05:57,546 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:05:57,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:05:57,551 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 04:05:57,575 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:05:57,576 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:05:57,577 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:05:57,577 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:05:57,577 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:05:57,578 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:05:57,578 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:05:57,578 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:05:57,578 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:05:57,578 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:05:57,579 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:05:57,579 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:05:57,579 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:05:57,579 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:05:57,579 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:05:57,579 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:05:57,580 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:05:57,580 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:05:57,580 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:05:57,580 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:05:57,580 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:05:57,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:05:57,580 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:05:57,580 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:05:57,580 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:05:57,581 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:05:57,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:05:57,581 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:05:57,581 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 04:05:57,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:05:57,821 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:05:57,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:05:57,824 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:05:57,825 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:05:57,827 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longer-2.i [2022-12-06 04:05:58,767 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:05:58,998 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:05:58,998 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-2.i [2022-12-06 04:05:59,021 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ede1bf59e/ff3155f34f99497d8e30b5a15f24fb16/FLAG2188cc814 [2022-12-06 04:05:59,034 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ede1bf59e/ff3155f34f99497d8e30b5a15f24fb16 [2022-12-06 04:05:59,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:05:59,037 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:05:59,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:05:59,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:05:59,040 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:05:59,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:05:59" (1/1) ... [2022-12-06 04:05:59,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34ef1199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:05:59, skipping insertion in model container [2022-12-06 04:05:59,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:05:59" (1/1) ... [2022-12-06 04:05:59,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:05:59,098 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:05:59,421 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-2.i[41529,41542] [2022-12-06 04:05:59,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:05:59,450 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:05:59,478 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-2.i[41529,41542] [2022-12-06 04:05:59,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:05:59,528 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:05:59,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:05:59 WrapperNode [2022-12-06 04:05:59,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:05:59,529 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:05:59,529 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:05:59,529 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:05:59,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:05:59" (1/1) ... [2022-12-06 04:05:59,548 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:05:59" (1/1) ... [2022-12-06 04:05:59,564 INFO L138 Inliner]: procedures = 277, calls = 38, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 148 [2022-12-06 04:05:59,564 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:05:59,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:05:59,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:05:59,565 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:05:59,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:05:59" (1/1) ... [2022-12-06 04:05:59,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:05:59" (1/1) ... [2022-12-06 04:05:59,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:05:59" (1/1) ... [2022-12-06 04:05:59,584 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:05:59" (1/1) ... [2022-12-06 04:05:59,589 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:05:59" (1/1) ... [2022-12-06 04:05:59,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:05:59" (1/1) ... [2022-12-06 04:05:59,592 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:05:59" (1/1) ... [2022-12-06 04:05:59,593 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:05:59" (1/1) ... [2022-12-06 04:05:59,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:05:59,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:05:59,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:05:59,612 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:05:59,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:05:59" (1/1) ... [2022-12-06 04:05:59,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:05:59,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:05:59,665 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 04:05:59,670 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 04:05:59,696 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-06 04:05:59,697 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-06 04:05:59,697 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-06 04:05:59,697 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-06 04:05:59,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:05:59,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:05:59,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:05:59,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:05:59,697 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 04:05:59,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:05:59,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:05:59,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:05:59,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:05:59,698 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 04:05:59,829 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:05:59,831 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:06:00,063 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:06:00,068 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:06:00,068 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 04:06:00,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:06:00 BoogieIcfgContainer [2022-12-06 04:06:00,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:06:00,071 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:06:00,071 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:06:00,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:06:00,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:05:59" (1/3) ... [2022-12-06 04:06:00,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43aaf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:06:00, skipping insertion in model container [2022-12-06 04:06:00,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:05:59" (2/3) ... [2022-12-06 04:06:00,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43aaf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:06:00, skipping insertion in model container [2022-12-06 04:06:00,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:06:00" (3/3) ... [2022-12-06 04:06:00,074 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longer-2.i [2022-12-06 04:06:00,086 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:06:00,087 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:06:00,087 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:06:00,162 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 04:06:00,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 150 transitions, 316 flow [2022-12-06 04:06:00,247 INFO L130 PetriNetUnfolder]: 10/148 cut-off events. [2022-12-06 04:06:00,247 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 04:06:00,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 148 events. 10/148 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 353 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 110. Up to 3 conditions per place. [2022-12-06 04:06:00,253 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 150 transitions, 316 flow [2022-12-06 04:06:00,258 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 139 transitions, 287 flow [2022-12-06 04:06:00,259 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:00,279 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 139 transitions, 287 flow [2022-12-06 04:06:00,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 139 transitions, 287 flow [2022-12-06 04:06:00,304 INFO L130 PetriNetUnfolder]: 10/139 cut-off events. [2022-12-06 04:06:00,304 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:06:00,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 139 events. 10/139 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 307 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 110. Up to 3 conditions per place. [2022-12-06 04:06:00,312 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 139 transitions, 287 flow [2022-12-06 04:06:00,312 INFO L188 LiptonReduction]: Number of co-enabled transitions 6382 [2022-12-06 04:06:03,569 INFO L203 LiptonReduction]: Total number of compositions: 109 [2022-12-06 04:06:03,581 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:06:03,585 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;@177abd0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:06:03,585 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 04:06:03,588 INFO L130 PetriNetUnfolder]: 1/18 cut-off events. [2022-12-06 04:06:03,588 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:06:03,588 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:03,589 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-06 04:06:03,589 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:06:03,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:03,592 INFO L85 PathProgramCache]: Analyzing trace with hash 973860878, now seen corresponding path program 1 times [2022-12-06 04:06:03,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:03,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058402345] [2022-12-06 04:06:03,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:03,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:03,817 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 04:06:03,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:03,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058402345] [2022-12-06 04:06:03,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058402345] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:03,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:03,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:06:03,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397157230] [2022-12-06 04:06:03,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:03,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:06:03,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:03,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:06:03,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:06:03,849 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 40 [2022-12-06 04:06:03,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:03,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:03,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 40 [2022-12-06 04:06:03,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:04,042 INFO L130 PetriNetUnfolder]: 828/1410 cut-off events. [2022-12-06 04:06:04,042 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-12-06 04:06:04,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2835 conditions, 1410 events. 828/1410 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5969 event pairs, 371 based on Foata normal form. 0/1040 useless extension candidates. Maximal degree in co-relation 2635. Up to 880 conditions per place. [2022-12-06 04:06:04,050 INFO L137 encePairwiseOnDemand]: 33/40 looper letters, 55 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2022-12-06 04:06:04,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 61 transitions, 253 flow [2022-12-06 04:06:04,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:06:04,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:06:04,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-06 04:06:04,058 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2022-12-06 04:06:04,059 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 89 flow. Second operand 3 states and 73 transitions. [2022-12-06 04:06:04,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 61 transitions, 253 flow [2022-12-06 04:06:04,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 61 transitions, 245 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:06:04,063 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 97 flow [2022-12-06 04:06:04,065 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2022-12-06 04:06:04,067 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2022-12-06 04:06:04,067 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:04,068 INFO L89 Accepts]: Start accepts. Operand has 40 places, 39 transitions, 97 flow [2022-12-06 04:06:04,069 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:04,069 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:04,069 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 39 transitions, 97 flow [2022-12-06 04:06:04,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 39 transitions, 97 flow [2022-12-06 04:06:04,076 INFO L130 PetriNetUnfolder]: 9/67 cut-off events. [2022-12-06 04:06:04,076 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:06:04,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 67 events. 9/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 148 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 74. Up to 9 conditions per place. [2022-12-06 04:06:04,077 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 39 transitions, 97 flow [2022-12-06 04:06:04,077 INFO L188 LiptonReduction]: Number of co-enabled transitions 656 [2022-12-06 04:06:04,113 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:06:04,114 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-06 04:06:04,114 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 97 flow [2022-12-06 04:06:04,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:04,114 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:04,115 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:04,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:06:04,115 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:06:04,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:04,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1325177997, now seen corresponding path program 1 times [2022-12-06 04:06:04,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:04,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27700920] [2022-12-06 04:06:04,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:04,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:04,197 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 04:06:04,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:04,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27700920] [2022-12-06 04:06:04,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27700920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:04,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:04,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:06:04,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508751804] [2022-12-06 04:06:04,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:04,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:06:04,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:04,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:06:04,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:06:04,199 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2022-12-06 04:06:04,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 97 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 04:06:04,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:04,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2022-12-06 04:06:04,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:04,325 INFO L130 PetriNetUnfolder]: 686/1260 cut-off events. [2022-12-06 04:06:04,326 INFO L131 PetriNetUnfolder]: For 111/111 co-relation queries the response was YES. [2022-12-06 04:06:04,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2547 conditions, 1260 events. 686/1260 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 6454 event pairs, 313 based on Foata normal form. 0/1024 useless extension candidates. Maximal degree in co-relation 2130. Up to 1025 conditions per place. [2022-12-06 04:06:04,331 INFO L137 encePairwiseOnDemand]: 35/38 looper letters, 48 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2022-12-06 04:06:04,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 57 transitions, 242 flow [2022-12-06 04:06:04,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:06:04,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:06:04,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-12-06 04:06:04,332 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6052631578947368 [2022-12-06 04:06:04,332 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 97 flow. Second operand 3 states and 69 transitions. [2022-12-06 04:06:04,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 57 transitions, 242 flow [2022-12-06 04:06:04,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 57 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:06:04,334 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 109 flow [2022-12-06 04:06:04,334 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2022-12-06 04:06:04,335 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2022-12-06 04:06:04,335 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:04,335 INFO L89 Accepts]: Start accepts. Operand has 42 places, 40 transitions, 109 flow [2022-12-06 04:06:04,335 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:04,335 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:04,335 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 40 transitions, 109 flow [2022-12-06 04:06:04,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 40 transitions, 109 flow [2022-12-06 04:06:04,341 INFO L130 PetriNetUnfolder]: 12/93 cut-off events. [2022-12-06 04:06:04,342 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 04:06:04,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 93 events. 12/93 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 262 event pairs, 1 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 109. Up to 11 conditions per place. [2022-12-06 04:06:04,343 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 40 transitions, 109 flow [2022-12-06 04:06:04,343 INFO L188 LiptonReduction]: Number of co-enabled transitions 696 [2022-12-06 04:06:04,351 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:06:04,352 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 04:06:04,352 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 109 flow [2022-12-06 04:06:04,353 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 04:06:04,353 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:04,353 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:04,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:06:04,353 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:06:04,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:04,354 INFO L85 PathProgramCache]: Analyzing trace with hash 963601012, now seen corresponding path program 1 times [2022-12-06 04:06:04,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:04,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799873273] [2022-12-06 04:06:04,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:04,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:04,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:04,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:04,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799873273] [2022-12-06 04:06:04,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799873273] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:06:04,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906975708] [2022-12-06 04:06:04,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:04,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:06:04,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:06:04,463 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 04:06:04,497 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 04:06:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:04,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 04:06:04,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:06:04,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:04,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:06:04,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:04,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906975708] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:06:04,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:06:04,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-06 04:06:04,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180150041] [2022-12-06 04:06:04,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:06:04,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 04:06:04,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:04,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 04:06:04,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-06 04:06:04,653 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 38 [2022-12-06 04:06:04,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 109 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:04,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:04,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 38 [2022-12-06 04:06:04,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:05,153 INFO L130 PetriNetUnfolder]: 2004/3438 cut-off events. [2022-12-06 04:06:05,154 INFO L131 PetriNetUnfolder]: For 880/880 co-relation queries the response was YES. [2022-12-06 04:06:05,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7606 conditions, 3438 events. 2004/3438 cut-off events. For 880/880 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 17981 event pairs, 302 based on Foata normal form. 88/2886 useless extension candidates. Maximal degree in co-relation 6886. Up to 999 conditions per place. [2022-12-06 04:06:05,167 INFO L137 encePairwiseOnDemand]: 30/38 looper letters, 166 selfloop transitions, 26 changer transitions 5/200 dead transitions. [2022-12-06 04:06:05,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 200 transitions, 913 flow [2022-12-06 04:06:05,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 04:06:05,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 04:06:05,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 236 transitions. [2022-12-06 04:06:05,169 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5175438596491229 [2022-12-06 04:06:05,169 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 109 flow. Second operand 12 states and 236 transitions. [2022-12-06 04:06:05,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 200 transitions, 913 flow [2022-12-06 04:06:05,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 200 transitions, 898 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:06:05,174 INFO L231 Difference]: Finished difference. Result has 60 places, 65 transitions, 321 flow [2022-12-06 04:06:05,174 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=321, PETRI_PLACES=60, PETRI_TRANSITIONS=65} [2022-12-06 04:06:05,175 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2022-12-06 04:06:05,175 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:05,175 INFO L89 Accepts]: Start accepts. Operand has 60 places, 65 transitions, 321 flow [2022-12-06 04:06:05,176 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:05,176 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:05,176 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 65 transitions, 321 flow [2022-12-06 04:06:05,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 65 transitions, 321 flow [2022-12-06 04:06:05,193 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L1008-->L1008-1: Formula: (not (< 0 v_~top~0_13)) InVars {~top~0=v_~top~0_13} OutVars{~top~0=v_~top~0_13} AuxVars[] AssignedVars[][22], [Black: 160#(= ~top~0 0), Black: 253#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 225#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), 114#L996-2true, Black: 170#(<= ~top~0 1), Black: 251#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), Black: 255#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), Black: 166#true, 164#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), Black: 215#(not (<= 400 ~top~0)), 174#(<= ~top~0 0), t2Thread1of1ForFork0InUse, 135#L1008-1true, 23#L1022-4true]) [2022-12-06 04:06:05,193 INFO L382 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-12-06 04:06:05,193 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-06 04:06:05,193 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 04:06:05,193 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-06 04:06:05,193 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([578] L1008-->L973: Formula: (and (< 0 v_~top~0_114) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_17| |v_~#arr~0.base_35|) (= |v_~#arr~0.offset_30| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_17|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_30|, ~top~0=v_~top~0_114, ~#arr~0.base=|v_~#arr~0.base_35|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_39|, ~#arr~0.offset=|v_~#arr~0.offset_30|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_35|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_15|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_17|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_45|, ~top~0=v_~top~0_114, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_57|, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_39|, ~#arr~0.base=|v_~#arr~0.base_35|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_17|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base][36], [Black: 160#(= ~top~0 0), Black: 253#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 225#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), 114#L996-2true, Black: 170#(<= ~top~0 1), Black: 251#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), Black: 255#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), Black: 166#true, 164#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), Black: 174#(<= ~top~0 0), 215#(not (<= 400 ~top~0)), 38#L973true, t2Thread1of1ForFork0InUse, 23#L1022-4true]) [2022-12-06 04:06:05,194 INFO L382 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-12-06 04:06:05,194 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-06 04:06:05,194 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 04:06:05,194 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-06 04:06:05,198 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L1008-->L1008-1: Formula: (not (< 0 v_~top~0_13)) InVars {~top~0=v_~top~0_13} OutVars{~top~0=v_~top~0_13} AuxVars[] AssignedVars[][22], [Black: 160#(= ~top~0 0), Black: 253#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 225#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), Black: 170#(<= ~top~0 1), Black: 251#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), Black: 164#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), Black: 255#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), Black: 166#true, Black: 215#(not (<= 400 ~top~0)), 174#(<= ~top~0 0), t2Thread1of1ForFork0InUse, 123#L945-1true, 135#L1008-1true, 23#L1022-4true]) [2022-12-06 04:06:05,198 INFO L382 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-06 04:06:05,198 INFO L385 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-06 04:06:05,198 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-06 04:06:05,198 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-06 04:06:05,200 INFO L130 PetriNetUnfolder]: 72/329 cut-off events. [2022-12-06 04:06:05,200 INFO L131 PetriNetUnfolder]: For 320/331 co-relation queries the response was YES. [2022-12-06 04:06:05,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 684 conditions, 329 events. 72/329 cut-off events. For 320/331 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1785 event pairs, 2 based on Foata normal form. 1/232 useless extension candidates. Maximal degree in co-relation 663. Up to 47 conditions per place. [2022-12-06 04:06:05,203 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 65 transitions, 321 flow [2022-12-06 04:06:05,203 INFO L188 LiptonReduction]: Number of co-enabled transitions 1108 [2022-12-06 04:06:05,221 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [394] L945-->L945-1: Formula: (= |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3| v_~top~0_5) InVars {~top~0=v_~top~0_5} OutVars{~top~0=v_~top~0_5, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_inc_top_#t~post31#1] and [412] L1008-->L1008-1: Formula: (not (< 0 v_~top~0_13)) InVars {~top~0=v_~top~0_13} OutVars{~top~0=v_~top~0_13} AuxVars[] AssignedVars[] [2022-12-06 04:06:05,231 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [394] L945-->L945-1: Formula: (= |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3| v_~top~0_5) InVars {~top~0=v_~top~0_5} OutVars{~top~0=v_~top~0_5, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_inc_top_#t~post31#1] and [463] L949-1-->L947: Formula: (= (+ v_~top~0_17 1) |v_t2Thread1of1ForFork0_dec_top_#t~post32#1_14|) InVars {t2Thread1of1ForFork0_dec_top_#t~post32#1=|v_t2Thread1of1ForFork0_dec_top_#t~post32#1_14|} OutVars{~top~0=v_~top~0_17} AuxVars[] AssignedVars[t2Thread1of1ForFork0_dec_top_#t~post32#1, ~top~0] [2022-12-06 04:06:05,240 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [394] L945-->L945-1: Formula: (= |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3| v_~top~0_5) InVars {~top~0=v_~top~0_5} OutVars{~top~0=v_~top~0_5, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_inc_top_#t~post31#1] and [567] L973-->pop_returnLabel#1: Formula: (and (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_37| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_15|) (= (+ 2 |v_t2Thread1of1ForFork0_pop_#res#1_31|) 0) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_15| |v_t2Thread1of1ForFork0_pop_~stack#1.base_37|) (= v_~top~0_107 0)) InVars {t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_15|, ~top~0=v_~top~0_107, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_15|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_37|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_13|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_15|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_31|, ~top~0=v_~top~0_107, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_37|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_15|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_~stack#1.offset] [2022-12-06 04:06:05,287 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [567] L973-->pop_returnLabel#1: Formula: (and (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_37| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_15|) (= (+ 2 |v_t2Thread1of1ForFork0_pop_#res#1_31|) 0) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_15| |v_t2Thread1of1ForFork0_pop_~stack#1.base_37|) (= v_~top~0_107 0)) InVars {t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_15|, ~top~0=v_~top~0_107, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_15|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_37|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_13|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_15|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_31|, ~top~0=v_~top~0_107, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_37|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_15|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_~stack#1.offset] and [587] L945-1-->L996-2: Formula: (and (= |v_t1Thread1of1ForFork1_push_#res#1_51| 0) (= |v_t1Thread1of1ForFork1_#t~ret41#1_69| |v_t1Thread1of1ForFork1_push_#res#1_51|) (= (+ 1 |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_94|) v_~top~0_130)) InVars {t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_94|} OutVars{t1Thread1of1ForFork1_#t~ret41#1=|v_t1Thread1of1ForFork1_#t~ret41#1_69|, ~top~0=v_~top~0_130, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_51|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_#t~ret41#1, ~top~0, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] [2022-12-06 04:06:05,332 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] L1008-->L1008-1: Formula: (not (< 0 v_~top~0_13)) InVars {~top~0=v_~top~0_13} OutVars{~top~0=v_~top~0_13} AuxVars[] AssignedVars[] and [587] L945-1-->L996-2: Formula: (and (= |v_t1Thread1of1ForFork1_push_#res#1_51| 0) (= |v_t1Thread1of1ForFork1_#t~ret41#1_69| |v_t1Thread1of1ForFork1_push_#res#1_51|) (= (+ 1 |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_94|) v_~top~0_130)) InVars {t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_94|} OutVars{t1Thread1of1ForFork1_#t~ret41#1=|v_t1Thread1of1ForFork1_#t~ret41#1_69|, ~top~0=v_~top~0_130, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_51|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_#t~ret41#1, ~top~0, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] [2022-12-06 04:06:05,354 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 04:06:05,357 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 04:06:05,361 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 63 transitions, 344 flow [2022-12-06 04:06:05,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:05,361 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:05,361 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:05,377 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 04:06:05,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:06:05,567 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:06:05,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:05,570 INFO L85 PathProgramCache]: Analyzing trace with hash 657019038, now seen corresponding path program 1 times [2022-12-06 04:06:05,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:05,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838319687] [2022-12-06 04:06:05,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:05,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:05,617 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 04:06:05,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:05,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838319687] [2022-12-06 04:06:05,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838319687] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:05,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:05,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:06:05,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579923058] [2022-12-06 04:06:05,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:05,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 04:06:05,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:05,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 04:06:05,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 04:06:05,623 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 46 [2022-12-06 04:06:05,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 63 transitions, 344 flow. Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 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 04:06:05,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:05,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 46 [2022-12-06 04:06:05,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:05,888 INFO L130 PetriNetUnfolder]: 1584/2898 cut-off events. [2022-12-06 04:06:05,888 INFO L131 PetriNetUnfolder]: For 2985/3014 co-relation queries the response was YES. [2022-12-06 04:06:05,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7286 conditions, 2898 events. 1584/2898 cut-off events. For 2985/3014 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 16667 event pairs, 1140 based on Foata normal form. 29/2425 useless extension candidates. Maximal degree in co-relation 6603. Up to 2596 conditions per place. [2022-12-06 04:06:05,903 INFO L137 encePairwiseOnDemand]: 45/46 looper letters, 51 selfloop transitions, 0 changer transitions 0/62 dead transitions. [2022-12-06 04:06:05,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 433 flow [2022-12-06 04:06:05,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 04:06:05,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 04:06:05,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2022-12-06 04:06:05,906 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2022-12-06 04:06:05,906 INFO L175 Difference]: Start difference. First operand has 58 places, 63 transitions, 344 flow. Second operand 2 states and 52 transitions. [2022-12-06 04:06:05,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 433 flow [2022-12-06 04:06:05,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 62 transitions, 406 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 04:06:05,917 INFO L231 Difference]: Finished difference. Result has 56 places, 62 transitions, 304 flow [2022-12-06 04:06:05,917 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=304, PETRI_PLACES=56, PETRI_TRANSITIONS=62} [2022-12-06 04:06:05,918 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2022-12-06 04:06:05,918 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:05,919 INFO L89 Accepts]: Start accepts. Operand has 56 places, 62 transitions, 304 flow [2022-12-06 04:06:05,920 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:05,920 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:05,920 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 62 transitions, 304 flow [2022-12-06 04:06:05,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 62 transitions, 304 flow [2022-12-06 04:06:05,947 INFO L130 PetriNetUnfolder]: 63/316 cut-off events. [2022-12-06 04:06:05,947 INFO L131 PetriNetUnfolder]: For 246/259 co-relation queries the response was YES. [2022-12-06 04:06:05,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 316 events. 63/316 cut-off events. For 246/259 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1727 event pairs, 2 based on Foata normal form. 1/219 useless extension candidates. Maximal degree in co-relation 599. Up to 43 conditions per place. [2022-12-06 04:06:05,950 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 62 transitions, 304 flow [2022-12-06 04:06:05,951 INFO L188 LiptonReduction]: Number of co-enabled transitions 1044 [2022-12-06 04:06:05,957 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L1008-->L973: Formula: (and (< 0 v_~top~0_114) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_17| |v_~#arr~0.base_35|) (= |v_~#arr~0.offset_30| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_17|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_30|, ~top~0=v_~top~0_114, ~#arr~0.base=|v_~#arr~0.base_35|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_39|, ~#arr~0.offset=|v_~#arr~0.offset_30|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_35|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_15|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_17|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_45|, ~top~0=v_~top~0_114, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_57|, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_39|, ~#arr~0.base=|v_~#arr~0.base_35|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_17|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base] and [597] L945-->pop_returnLabel#1: Formula: (and (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_39| |v_t2Thread1of1ForFork0_pop_~stack#1.base_63|) (= (+ 2 |v_t2Thread1of1ForFork0_pop_#res#1_72|) 0) (= v_~top~0_252 0) (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_63| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_39|) (= v_~top~0_252 |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_225|)) InVars {t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_39|, ~top~0=v_~top~0_252, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_39|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_63|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_29|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_39|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_72|, ~top~0=v_~top~0_252, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_63|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_39|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_225|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t1Thread1of1ForFork1_inc_top_#t~post31#1] [2022-12-06 04:06:05,966 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:06:05,967 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 04:06:05,967 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 62 transitions, 308 flow [2022-12-06 04:06:05,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 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 04:06:05,967 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:05,967 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 04:06:05,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:06:05,967 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:06:05,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:05,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1498366853, now seen corresponding path program 1 times [2022-12-06 04:06:05,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:05,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189081396] [2022-12-06 04:06:05,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:05,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:06,095 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 04:06:06,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:06,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189081396] [2022-12-06 04:06:06,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189081396] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:06,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:06,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:06:06,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299591161] [2022-12-06 04:06:06,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:06,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:06:06,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:06,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:06:06,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:06:06,097 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 45 [2022-12-06 04:06:06,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 62 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:06,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:06,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 45 [2022-12-06 04:06:06,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:06,222 INFO L130 PetriNetUnfolder]: 552/1117 cut-off events. [2022-12-06 04:06:06,222 INFO L131 PetriNetUnfolder]: For 400/400 co-relation queries the response was YES. [2022-12-06 04:06:06,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2609 conditions, 1117 events. 552/1117 cut-off events. For 400/400 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5487 event pairs, 98 based on Foata normal form. 0/987 useless extension candidates. Maximal degree in co-relation 2513. Up to 752 conditions per place. [2022-12-06 04:06:06,229 INFO L137 encePairwiseOnDemand]: 39/45 looper letters, 40 selfloop transitions, 6 changer transitions 3/60 dead transitions. [2022-12-06 04:06:06,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 60 transitions, 327 flow [2022-12-06 04:06:06,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:06:06,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:06:06,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-06 04:06:06,230 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4740740740740741 [2022-12-06 04:06:06,231 INFO L175 Difference]: Start difference. First operand has 55 places, 62 transitions, 308 flow. Second operand 3 states and 64 transitions. [2022-12-06 04:06:06,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 60 transitions, 327 flow [2022-12-06 04:06:06,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 60 transitions, 323 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 04:06:06,235 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 210 flow [2022-12-06 04:06:06,235 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2022-12-06 04:06:06,238 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2022-12-06 04:06:06,238 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:06,238 INFO L89 Accepts]: Start accepts. Operand has 52 places, 48 transitions, 210 flow [2022-12-06 04:06:06,239 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:06,239 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:06,239 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 48 transitions, 210 flow [2022-12-06 04:06:06,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 48 transitions, 210 flow [2022-12-06 04:06:06,254 INFO L130 PetriNetUnfolder]: 17/142 cut-off events. [2022-12-06 04:06:06,255 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-12-06 04:06:06,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 142 events. 17/142 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 492 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 254. Up to 18 conditions per place. [2022-12-06 04:06:06,256 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 48 transitions, 210 flow [2022-12-06 04:06:06,256 INFO L188 LiptonReduction]: Number of co-enabled transitions 436 [2022-12-06 04:06:07,556 INFO L203 LiptonReduction]: Total number of compositions: 12 [2022-12-06 04:06:07,557 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1319 [2022-12-06 04:06:07,557 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 238 flow [2022-12-06 04:06:07,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:07,557 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:07,557 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:07,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:06:07,558 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:06:07,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:07,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1348600435, now seen corresponding path program 1 times [2022-12-06 04:06:07,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:07,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230978638] [2022-12-06 04:06:07,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:07,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:07,926 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 04:06:07,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:07,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230978638] [2022-12-06 04:06:07,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230978638] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:07,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:07,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:06:07,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946856412] [2022-12-06 04:06:07,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:07,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:06:07,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:07,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:06:07,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:06:07,927 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 40 [2022-12-06 04:06:07,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 238 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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 04:06:07,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:07,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 40 [2022-12-06 04:06:07,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:08,217 INFO L130 PetriNetUnfolder]: 840/1600 cut-off events. [2022-12-06 04:06:08,217 INFO L131 PetriNetUnfolder]: For 1704/1704 co-relation queries the response was YES. [2022-12-06 04:06:08,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4607 conditions, 1600 events. 840/1600 cut-off events. For 1704/1704 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8686 event pairs, 320 based on Foata normal form. 12/1515 useless extension candidates. Maximal degree in co-relation 3094. Up to 694 conditions per place. [2022-12-06 04:06:08,224 INFO L137 encePairwiseOnDemand]: 31/40 looper letters, 94 selfloop transitions, 11 changer transitions 9/118 dead transitions. [2022-12-06 04:06:08,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 118 transitions, 858 flow [2022-12-06 04:06:08,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:06:08,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:06:08,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2022-12-06 04:06:08,225 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5541666666666667 [2022-12-06 04:06:08,225 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 238 flow. Second operand 6 states and 133 transitions. [2022-12-06 04:06:08,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 118 transitions, 858 flow [2022-12-06 04:06:08,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 118 transitions, 794 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 04:06:08,231 INFO L231 Difference]: Finished difference. Result has 50 places, 51 transitions, 326 flow [2022-12-06 04:06:08,231 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=50, PETRI_TRANSITIONS=51} [2022-12-06 04:06:08,233 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2022-12-06 04:06:08,233 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:08,233 INFO L89 Accepts]: Start accepts. Operand has 50 places, 51 transitions, 326 flow [2022-12-06 04:06:08,233 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:08,233 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:08,234 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 51 transitions, 326 flow [2022-12-06 04:06:08,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 51 transitions, 326 flow [2022-12-06 04:06:08,250 INFO L130 PetriNetUnfolder]: 48/235 cut-off events. [2022-12-06 04:06:08,250 INFO L131 PetriNetUnfolder]: For 309/310 co-relation queries the response was YES. [2022-12-06 04:06:08,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 235 events. 48/235 cut-off events. For 309/310 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1236 event pairs, 0 based on Foata normal form. 1/209 useless extension candidates. Maximal degree in co-relation 395. Up to 42 conditions per place. [2022-12-06 04:06:08,251 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 51 transitions, 326 flow [2022-12-06 04:06:08,251 INFO L188 LiptonReduction]: Number of co-enabled transitions 450 [2022-12-06 04:06:08,507 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 04:06:08,508 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 275 [2022-12-06 04:06:08,508 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 46 transitions, 324 flow [2022-12-06 04:06:08,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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 04:06:08,508 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:08,508 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:08,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:06:08,508 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:06:08,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:08,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1603038933, now seen corresponding path program 1 times [2022-12-06 04:06:08,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:08,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956508433] [2022-12-06 04:06:08,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:08,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:08,845 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 04:06:08,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:08,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956508433] [2022-12-06 04:06:08,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956508433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:08,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:08,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:06:08,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074557480] [2022-12-06 04:06:08,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:08,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:06:08,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:08,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:06:08,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:06:08,847 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2022-12-06 04:06:08,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 46 transitions, 324 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:08,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:08,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2022-12-06 04:06:08,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:09,094 INFO L130 PetriNetUnfolder]: 867/1668 cut-off events. [2022-12-06 04:06:09,095 INFO L131 PetriNetUnfolder]: For 2550/2550 co-relation queries the response was YES. [2022-12-06 04:06:09,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4717 conditions, 1668 events. 867/1668 cut-off events. For 2550/2550 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 9405 event pairs, 219 based on Foata normal form. 30/1698 useless extension candidates. Maximal degree in co-relation 3560. Up to 496 conditions per place. [2022-12-06 04:06:09,101 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 72 selfloop transitions, 14 changer transitions 11/100 dead transitions. [2022-12-06 04:06:09,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 100 transitions, 771 flow [2022-12-06 04:06:09,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:06:09,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:06:09,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2022-12-06 04:06:09,103 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.527027027027027 [2022-12-06 04:06:09,103 INFO L175 Difference]: Start difference. First operand has 44 places, 46 transitions, 324 flow. Second operand 6 states and 117 transitions. [2022-12-06 04:06:09,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 100 transitions, 771 flow [2022-12-06 04:06:09,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 100 transitions, 711 flow, removed 30 selfloop flow, removed 1 redundant places. [2022-12-06 04:06:09,107 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 346 flow [2022-12-06 04:06:09,107 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=346, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2022-12-06 04:06:09,108 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2022-12-06 04:06:09,108 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:09,108 INFO L89 Accepts]: Start accepts. Operand has 51 places, 48 transitions, 346 flow [2022-12-06 04:06:09,108 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:09,108 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:09,109 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 48 transitions, 346 flow [2022-12-06 04:06:09,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 48 transitions, 346 flow [2022-12-06 04:06:09,124 INFO L130 PetriNetUnfolder]: 39/224 cut-off events. [2022-12-06 04:06:09,124 INFO L131 PetriNetUnfolder]: For 326/330 co-relation queries the response was YES. [2022-12-06 04:06:09,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 224 events. 39/224 cut-off events. For 326/330 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1262 event pairs, 1 based on Foata normal form. 2/200 useless extension candidates. Maximal degree in co-relation 385. Up to 40 conditions per place. [2022-12-06 04:06:09,126 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 48 transitions, 346 flow [2022-12-06 04:06:09,126 INFO L188 LiptonReduction]: Number of co-enabled transitions 406 [2022-12-06 04:06:09,259 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:06:09,260 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 152 [2022-12-06 04:06:09,260 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 344 flow [2022-12-06 04:06:09,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:09,261 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:09,261 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:09,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:06:09,261 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:06:09,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:09,262 INFO L85 PathProgramCache]: Analyzing trace with hash 477676419, now seen corresponding path program 1 times [2022-12-06 04:06:09,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:09,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965092858] [2022-12-06 04:06:09,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:09,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:09,348 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:09,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:09,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965092858] [2022-12-06 04:06:09,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965092858] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:06:09,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539339991] [2022-12-06 04:06:09,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:09,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:06:09,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:06:09,352 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 04:06:09,355 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 04:06:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:09,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 04:06:09,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:06:09,455 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:09,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:06:09,506 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:09,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539339991] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:06:09,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:06:09,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-06 04:06:09,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762690063] [2022-12-06 04:06:09,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:06:09,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 04:06:09,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:09,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 04:06:09,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2022-12-06 04:06:09,509 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-06 04:06:09,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 344 flow. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:09,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:09,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-06 04:06:09,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:09,956 INFO L130 PetriNetUnfolder]: 1348/2588 cut-off events. [2022-12-06 04:06:09,956 INFO L131 PetriNetUnfolder]: For 4417/4417 co-relation queries the response was YES. [2022-12-06 04:06:09,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7606 conditions, 2588 events. 1348/2588 cut-off events. For 4417/4417 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 15550 event pairs, 319 based on Foata normal form. 82/2670 useless extension candidates. Maximal degree in co-relation 5772. Up to 453 conditions per place. [2022-12-06 04:06:09,966 INFO L137 encePairwiseOnDemand]: 17/32 looper letters, 146 selfloop transitions, 50 changer transitions 4/202 dead transitions. [2022-12-06 04:06:09,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 202 transitions, 1443 flow [2022-12-06 04:06:09,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 04:06:09,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 04:06:09,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 218 transitions. [2022-12-06 04:06:09,968 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3784722222222222 [2022-12-06 04:06:09,968 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 344 flow. Second operand 18 states and 218 transitions. [2022-12-06 04:06:09,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 202 transitions, 1443 flow [2022-12-06 04:06:09,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 202 transitions, 1407 flow, removed 16 selfloop flow, removed 2 redundant places. [2022-12-06 04:06:09,975 INFO L231 Difference]: Finished difference. Result has 73 places, 83 transitions, 806 flow [2022-12-06 04:06:09,975 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=806, PETRI_PLACES=73, PETRI_TRANSITIONS=83} [2022-12-06 04:06:09,976 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places. [2022-12-06 04:06:09,976 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:09,976 INFO L89 Accepts]: Start accepts. Operand has 73 places, 83 transitions, 806 flow [2022-12-06 04:06:09,976 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:09,977 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:09,977 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 83 transitions, 806 flow [2022-12-06 04:06:09,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 83 transitions, 806 flow [2022-12-06 04:06:10,000 INFO L130 PetriNetUnfolder]: 65/347 cut-off events. [2022-12-06 04:06:10,000 INFO L131 PetriNetUnfolder]: For 885/889 co-relation queries the response was YES. [2022-12-06 04:06:10,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1067 conditions, 347 events. 65/347 cut-off events. For 885/889 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2147 event pairs, 1 based on Foata normal form. 2/308 useless extension candidates. Maximal degree in co-relation 954. Up to 78 conditions per place. [2022-12-06 04:06:10,003 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 83 transitions, 806 flow [2022-12-06 04:06:10,003 INFO L188 LiptonReduction]: Number of co-enabled transitions 708 [2022-12-06 04:06:10,356 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 04:06:10,363 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 387 [2022-12-06 04:06:10,364 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 77 transitions, 776 flow [2022-12-06 04:06:10,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:10,364 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:10,364 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:10,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 04:06:10,569 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,SelfDestructingSolverStorable7 [2022-12-06 04:06:10,569 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:06:10,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:10,570 INFO L85 PathProgramCache]: Analyzing trace with hash 681524893, now seen corresponding path program 1 times [2022-12-06 04:06:10,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:10,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97484772] [2022-12-06 04:06:10,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:10,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:10,821 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 04:06:10,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:10,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97484772] [2022-12-06 04:06:10,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97484772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:10,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:10,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:06:10,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538909318] [2022-12-06 04:06:10,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:10,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:06:10,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:10,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:06:10,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:06:10,823 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 44 [2022-12-06 04:06:10,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 77 transitions, 776 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 04:06:10,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:10,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 44 [2022-12-06 04:06:10,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:11,339 INFO L130 PetriNetUnfolder]: 2108/4028 cut-off events. [2022-12-06 04:06:11,339 INFO L131 PetriNetUnfolder]: For 10031/10031 co-relation queries the response was YES. [2022-12-06 04:06:11,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13332 conditions, 4028 events. 2108/4028 cut-off events. For 10031/10031 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 27243 event pairs, 713 based on Foata normal form. 24/4052 useless extension candidates. Maximal degree in co-relation 12673. Up to 1357 conditions per place. [2022-12-06 04:06:11,359 INFO L137 encePairwiseOnDemand]: 25/44 looper letters, 113 selfloop transitions, 76 changer transitions 1/192 dead transitions. [2022-12-06 04:06:11,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 192 transitions, 2024 flow [2022-12-06 04:06:11,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 04:06:11,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 04:06:11,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions. [2022-12-06 04:06:11,360 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37272727272727274 [2022-12-06 04:06:11,360 INFO L175 Difference]: Start difference. First operand has 67 places, 77 transitions, 776 flow. Second operand 10 states and 164 transitions. [2022-12-06 04:06:11,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 192 transitions, 2024 flow [2022-12-06 04:06:11,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 192 transitions, 1844 flow, removed 90 selfloop flow, removed 0 redundant places. [2022-12-06 04:06:11,384 INFO L231 Difference]: Finished difference. Result has 80 places, 128 transitions, 1413 flow [2022-12-06 04:06:11,384 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1413, PETRI_PLACES=80, PETRI_TRANSITIONS=128} [2022-12-06 04:06:11,385 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 38 predicate places. [2022-12-06 04:06:11,385 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:11,385 INFO L89 Accepts]: Start accepts. Operand has 80 places, 128 transitions, 1413 flow [2022-12-06 04:06:11,386 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:11,386 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:11,386 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 128 transitions, 1413 flow [2022-12-06 04:06:11,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 128 transitions, 1413 flow [2022-12-06 04:06:11,429 INFO L130 PetriNetUnfolder]: 116/595 cut-off events. [2022-12-06 04:06:11,429 INFO L131 PetriNetUnfolder]: For 1599/1607 co-relation queries the response was YES. [2022-12-06 04:06:11,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1966 conditions, 595 events. 116/595 cut-off events. For 1599/1607 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4513 event pairs, 0 based on Foata normal form. 2/524 useless extension candidates. Maximal degree in co-relation 1830. Up to 142 conditions per place. [2022-12-06 04:06:11,434 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 128 transitions, 1413 flow [2022-12-06 04:06:11,434 INFO L188 LiptonReduction]: Number of co-enabled transitions 1028 [2022-12-06 04:06:11,435 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:06:11,435 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 04:06:11,435 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 128 transitions, 1413 flow [2022-12-06 04:06:11,435 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 04:06:11,435 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:11,435 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:11,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:06:11,436 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:06:11,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:11,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1781957431, now seen corresponding path program 2 times [2022-12-06 04:06:11,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:11,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545046610] [2022-12-06 04:06:11,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:11,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:11,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:06:11,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:11,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545046610] [2022-12-06 04:06:11,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545046610] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:06:11,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964201869] [2022-12-06 04:06:11,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 04:06:11,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:06:11,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:06:11,769 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 04:06:11,772 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 04:06:11,847 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-06 04:06:11,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 04:06:11,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 04:06:11,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:06:11,874 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-06 04:06:11,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-12-06 04:06:11,913 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 15 treesize of output 11 [2022-12-06 04:06:11,973 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 59 treesize of output 54 [2022-12-06 04:06:12,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 46 [2022-12-06 04:06:17,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:06:17,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:06:18,003 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_306 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_306) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-12-06 04:06:18,032 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:06:18,032 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-06 04:06:18,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 57 [2022-12-06 04:06:18,044 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 28 treesize of output 22 [2022-12-06 04:06:18,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:06:18,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964201869] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:06:18,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:06:18,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 04:06:18,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626035862] [2022-12-06 04:06:18,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:06:18,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 04:06:18,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:18,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 04:06:18,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=193, Unknown=3, NotChecked=28, Total=272 [2022-12-06 04:06:18,079 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 44 [2022-12-06 04:06:18,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 128 transitions, 1413 flow. Second operand has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 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 04:06:18,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:18,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 44 [2022-12-06 04:06:18,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:20,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:06:24,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:06:26,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:06:33,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:06:35,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:06:37,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:06:39,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:06:48,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:06:55,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:06:57,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:07:01,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:07:07,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:07:09,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:07:11,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:07:13,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:07:15,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:07:15,939 INFO L130 PetriNetUnfolder]: 3355/6466 cut-off events. [2022-12-06 04:07:15,939 INFO L131 PetriNetUnfolder]: For 18907/18907 co-relation queries the response was YES. [2022-12-06 04:07:15,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22523 conditions, 6466 events. 3355/6466 cut-off events. For 18907/18907 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 47511 event pairs, 695 based on Foata normal form. 20/6486 useless extension candidates. Maximal degree in co-relation 21614. Up to 1156 conditions per place. [2022-12-06 04:07:15,977 INFO L137 encePairwiseOnDemand]: 15/44 looper letters, 154 selfloop transitions, 200 changer transitions 7/363 dead transitions. [2022-12-06 04:07:15,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 363 transitions, 4015 flow [2022-12-06 04:07:15,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 04:07:15,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 04:07:15,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 297 transitions. [2022-12-06 04:07:15,979 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3068181818181818 [2022-12-06 04:07:15,979 INFO L175 Difference]: Start difference. First operand has 80 places, 128 transitions, 1413 flow. Second operand 22 states and 297 transitions. [2022-12-06 04:07:15,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 363 transitions, 4015 flow [2022-12-06 04:07:16,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 363 transitions, 3978 flow, removed 18 selfloop flow, removed 1 redundant places. [2022-12-06 04:07:16,059 INFO L231 Difference]: Finished difference. Result has 107 places, 245 transitions, 3240 flow [2022-12-06 04:07:16,060 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1392, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=3240, PETRI_PLACES=107, PETRI_TRANSITIONS=245} [2022-12-06 04:07:16,060 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 65 predicate places. [2022-12-06 04:07:16,060 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:07:16,060 INFO L89 Accepts]: Start accepts. Operand has 107 places, 245 transitions, 3240 flow [2022-12-06 04:07:16,064 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:07:16,064 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:07:16,065 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 245 transitions, 3240 flow [2022-12-06 04:07:16,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 245 transitions, 3240 flow [2022-12-06 04:07:16,364 INFO L130 PetriNetUnfolder]: 1085/3118 cut-off events. [2022-12-06 04:07:16,365 INFO L131 PetriNetUnfolder]: For 14783/15293 co-relation queries the response was YES. [2022-12-06 04:07:16,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13486 conditions, 3118 events. 1085/3118 cut-off events. For 14783/15293 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 29000 event pairs, 185 based on Foata normal form. 28/2984 useless extension candidates. Maximal degree in co-relation 12766. Up to 662 conditions per place. [2022-12-06 04:07:16,398 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 245 transitions, 3240 flow [2022-12-06 04:07:16,399 INFO L188 LiptonReduction]: Number of co-enabled transitions 1464 [2022-12-06 04:07:16,400 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [624] L991-6-->L945: Formula: (let ((.cse0 (select |v_#pthreadsMutex_391| |v_~#m~0.base_182|)) (.cse1 (mod |v_t1Thread1of1ForFork1_~tmp~0#1_91| 4294967296))) (and (= (select .cse0 |v_~#m~0.offset_182|) 0) (= (store |v_#pthreadsMutex_391| |v_~#m~0.base_182| (store .cse0 |v_~#m~0.offset_182| 1)) |v_#pthreadsMutex_390|) (= |v_~#arr~0.base_81| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68| |v_t1Thread1of1ForFork1_push_~stack#1.offset_90|) (= |v_t1Thread1of1ForFork1_get_top_#res#1_86| v_~top~0_404) (not (= 400 v_~top~0_404)) (< |v_t1Thread1of1ForFork1_~i~0#1_128| 400) (= |v_t1Thread1of1ForFork1_#t~nondet40#1_109| |v_t1Thread1of1ForFork1_~tmp~0#1_91|) (<= 0 (+ |v_t1Thread1of1ForFork1_get_top_#res#1_86| 2147483648)) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82| |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|) (= |v_t1Thread1of1ForFork1_push_~x#1_90| |v_t1Thread1of1ForFork1_push_#in~x#1_68|) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82| (ite (< .cse1 400) 1 0)) (not (= |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90| 0)) (= (store |v_#memory_int_165| |v_t1Thread1of1ForFork1_push_~stack#1.base_90| (store (select |v_#memory_int_165| |v_t1Thread1of1ForFork1_push_~stack#1.base_90|) (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_86| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_90|) |v_t1Thread1of1ForFork1_push_~x#1_90|)) |v_#memory_int_164|) (<= |v_t1Thread1of1ForFork1_get_top_#res#1_86| 2147483647) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68| |v_~#arr~0.offset_76|) (= (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) |v_t1Thread1of1ForFork1_push_#in~x#1_68|) (= |v_t1Thread1of1ForFork1_push_~stack#1.base_90| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_391|, ~#arr~0.offset=|v_~#arr~0.offset_76|, ~#m~0.base=|v_~#m~0.base_182|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_128|, ~#m~0.offset=|v_~#m~0.offset_182|, #memory_int=|v_#memory_int_165|, ~top~0=v_~top~0_404, ~#arr~0.base=|v_~#arr~0.base_81|, t1Thread1of1ForFork1_#t~nondet40#1=|v_t1Thread1of1ForFork1_#t~nondet40#1_109|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_390|, ~#arr~0.offset=|v_~#arr~0.offset_76|, t1Thread1of1ForFork1_push_~x#1=|v_t1Thread1of1ForFork1_push_~x#1_90|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_128|, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82|, t1Thread1of1ForFork1_push_#t~ret34#1=|v_t1Thread1of1ForFork1_push_#t~ret34#1_108|, t1Thread1of1ForFork1_push_#in~stack#1.base=|v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|, t1Thread1of1ForFork1_push_#in~stack#1.offset=|v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68|, ~top~0=v_~top~0_404, t1Thread1of1ForFork1_push_#in~x#1=|v_t1Thread1of1ForFork1_push_#in~x#1_68|, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_160|, t1Thread1of1ForFork1_get_top_#res#1=|v_t1Thread1of1ForFork1_get_top_#res#1_86|, ~#m~0.base=|v_~#m~0.base_182|, ~#m~0.offset=|v_~#m~0.offset_182|, t1Thread1of1ForFork1_~tmp~0#1=|v_t1Thread1of1ForFork1_~tmp~0#1_91|, #memory_int=|v_#memory_int_164|, t1Thread1of1ForFork1_push_~stack#1.offset=|v_t1Thread1of1ForFork1_push_~stack#1.offset_90|, t1Thread1of1ForFork1_#t~nondet39#1=|v_t1Thread1of1ForFork1_#t~nondet39#1_78|, t1Thread1of1ForFork1_push_~stack#1.base=|v_t1Thread1of1ForFork1_push_~stack#1.base_90|, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|, t1Thread1of1ForFork1_push_#t~nondet33#1=|v_t1Thread1of1ForFork1_push_#t~nondet33#1_61|, ~#arr~0.base=|v_~#arr~0.base_81|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_293|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_push_~x#1, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, t1Thread1of1ForFork1_push_#t~ret34#1, t1Thread1of1ForFork1_push_#in~stack#1.base, t1Thread1of1ForFork1_push_#in~stack#1.offset, t1Thread1of1ForFork1_push_#in~x#1, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_#t~nondet40#1, t1Thread1of1ForFork1_get_top_#res#1, t1Thread1of1ForFork1_~tmp~0#1, #memory_int, t1Thread1of1ForFork1_push_~stack#1.offset, t1Thread1of1ForFork1_#t~nondet39#1, t1Thread1of1ForFork1_push_~stack#1.base, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1, t1Thread1of1ForFork1_push_#t~nondet33#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] and [579] L1022-4-->L1023-1: Formula: (= |v_ULTIMATE.start_main_#t~mem49#1_16| (select (select |v_#memory_int_99| |v_ULTIMATE.start_main_~#id1~0#1.base_17|) |v_ULTIMATE.start_main_~#id1~0#1.offset_17|)) InVars {#memory_int=|v_#memory_int_99|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_17|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_17|} OutVars{ULTIMATE.start_main_#t~mem49#1=|v_ULTIMATE.start_main_#t~mem49#1_16|, ULTIMATE.start_main_#t~nondet48#1=|v_ULTIMATE.start_main_#t~nondet48#1_13|, #memory_int=|v_#memory_int_99|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_23|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_17|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem49#1, ULTIMATE.start_main_#t~nondet48#1, ULTIMATE.start_main_#t~pre47#1] [2022-12-06 04:07:16,761 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [624] L991-6-->L945: Formula: (let ((.cse0 (select |v_#pthreadsMutex_391| |v_~#m~0.base_182|)) (.cse1 (mod |v_t1Thread1of1ForFork1_~tmp~0#1_91| 4294967296))) (and (= (select .cse0 |v_~#m~0.offset_182|) 0) (= (store |v_#pthreadsMutex_391| |v_~#m~0.base_182| (store .cse0 |v_~#m~0.offset_182| 1)) |v_#pthreadsMutex_390|) (= |v_~#arr~0.base_81| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68| |v_t1Thread1of1ForFork1_push_~stack#1.offset_90|) (= |v_t1Thread1of1ForFork1_get_top_#res#1_86| v_~top~0_404) (not (= 400 v_~top~0_404)) (< |v_t1Thread1of1ForFork1_~i~0#1_128| 400) (= |v_t1Thread1of1ForFork1_#t~nondet40#1_109| |v_t1Thread1of1ForFork1_~tmp~0#1_91|) (<= 0 (+ |v_t1Thread1of1ForFork1_get_top_#res#1_86| 2147483648)) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82| |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|) (= |v_t1Thread1of1ForFork1_push_~x#1_90| |v_t1Thread1of1ForFork1_push_#in~x#1_68|) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82| (ite (< .cse1 400) 1 0)) (not (= |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90| 0)) (= (store |v_#memory_int_165| |v_t1Thread1of1ForFork1_push_~stack#1.base_90| (store (select |v_#memory_int_165| |v_t1Thread1of1ForFork1_push_~stack#1.base_90|) (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_86| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_90|) |v_t1Thread1of1ForFork1_push_~x#1_90|)) |v_#memory_int_164|) (<= |v_t1Thread1of1ForFork1_get_top_#res#1_86| 2147483647) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68| |v_~#arr~0.offset_76|) (= (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) |v_t1Thread1of1ForFork1_push_#in~x#1_68|) (= |v_t1Thread1of1ForFork1_push_~stack#1.base_90| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_391|, ~#arr~0.offset=|v_~#arr~0.offset_76|, ~#m~0.base=|v_~#m~0.base_182|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_128|, ~#m~0.offset=|v_~#m~0.offset_182|, #memory_int=|v_#memory_int_165|, ~top~0=v_~top~0_404, ~#arr~0.base=|v_~#arr~0.base_81|, t1Thread1of1ForFork1_#t~nondet40#1=|v_t1Thread1of1ForFork1_#t~nondet40#1_109|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_390|, ~#arr~0.offset=|v_~#arr~0.offset_76|, t1Thread1of1ForFork1_push_~x#1=|v_t1Thread1of1ForFork1_push_~x#1_90|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_128|, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82|, t1Thread1of1ForFork1_push_#t~ret34#1=|v_t1Thread1of1ForFork1_push_#t~ret34#1_108|, t1Thread1of1ForFork1_push_#in~stack#1.base=|v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|, t1Thread1of1ForFork1_push_#in~stack#1.offset=|v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68|, ~top~0=v_~top~0_404, t1Thread1of1ForFork1_push_#in~x#1=|v_t1Thread1of1ForFork1_push_#in~x#1_68|, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_160|, t1Thread1of1ForFork1_get_top_#res#1=|v_t1Thread1of1ForFork1_get_top_#res#1_86|, ~#m~0.base=|v_~#m~0.base_182|, ~#m~0.offset=|v_~#m~0.offset_182|, t1Thread1of1ForFork1_~tmp~0#1=|v_t1Thread1of1ForFork1_~tmp~0#1_91|, #memory_int=|v_#memory_int_164|, t1Thread1of1ForFork1_push_~stack#1.offset=|v_t1Thread1of1ForFork1_push_~stack#1.offset_90|, t1Thread1of1ForFork1_#t~nondet39#1=|v_t1Thread1of1ForFork1_#t~nondet39#1_78|, t1Thread1of1ForFork1_push_~stack#1.base=|v_t1Thread1of1ForFork1_push_~stack#1.base_90|, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|, t1Thread1of1ForFork1_push_#t~nondet33#1=|v_t1Thread1of1ForFork1_push_#t~nondet33#1_61|, ~#arr~0.base=|v_~#arr~0.base_81|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_293|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_push_~x#1, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, t1Thread1of1ForFork1_push_#t~ret34#1, t1Thread1of1ForFork1_push_#in~stack#1.base, t1Thread1of1ForFork1_push_#in~stack#1.offset, t1Thread1of1ForFork1_push_#in~x#1, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_#t~nondet40#1, t1Thread1of1ForFork1_get_top_#res#1, t1Thread1of1ForFork1_~tmp~0#1, #memory_int, t1Thread1of1ForFork1_push_~stack#1.offset, t1Thread1of1ForFork1_#t~nondet39#1, t1Thread1of1ForFork1_push_~stack#1.base, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1, t1Thread1of1ForFork1_push_#t~nondet33#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] and [508] $Ultimate##0-->L1005-6: Formula: (and (= |v_t2Thread1of1ForFork0_~arg#1.base_5| |v_t2Thread1of1ForFork0_#in~arg#1.base_5|) (= |v_t2Thread1of1ForFork0_~arg#1.offset_5| |v_t2Thread1of1ForFork0_#in~arg#1.offset_5|) (= |v_t2Thread1of1ForFork0_~i~1#1_31| 0)) InVars {t2Thread1of1ForFork0_#in~arg#1.offset=|v_t2Thread1of1ForFork0_#in~arg#1.offset_5|, t2Thread1of1ForFork0_#in~arg#1.base=|v_t2Thread1of1ForFork0_#in~arg#1.base_5|} OutVars{t2Thread1of1ForFork0_#in~arg#1.offset=|v_t2Thread1of1ForFork0_#in~arg#1.offset_5|, t2Thread1of1ForFork0_~arg#1.offset=|v_t2Thread1of1ForFork0_~arg#1.offset_5|, t2Thread1of1ForFork0_~arg#1.base=|v_t2Thread1of1ForFork0_~arg#1.base_5|, t2Thread1of1ForFork0_#in~arg#1.base=|v_t2Thread1of1ForFork0_#in~arg#1.base_5|, t2Thread1of1ForFork0_~i~1#1=|v_t2Thread1of1ForFork0_~i~1#1_31|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_~arg#1.offset, t2Thread1of1ForFork0_~arg#1.base, t2Thread1of1ForFork0_~i~1#1] [2022-12-06 04:07:16,929 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [624] L991-6-->L945: Formula: (let ((.cse0 (select |v_#pthreadsMutex_391| |v_~#m~0.base_182|)) (.cse1 (mod |v_t1Thread1of1ForFork1_~tmp~0#1_91| 4294967296))) (and (= (select .cse0 |v_~#m~0.offset_182|) 0) (= (store |v_#pthreadsMutex_391| |v_~#m~0.base_182| (store .cse0 |v_~#m~0.offset_182| 1)) |v_#pthreadsMutex_390|) (= |v_~#arr~0.base_81| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68| |v_t1Thread1of1ForFork1_push_~stack#1.offset_90|) (= |v_t1Thread1of1ForFork1_get_top_#res#1_86| v_~top~0_404) (not (= 400 v_~top~0_404)) (< |v_t1Thread1of1ForFork1_~i~0#1_128| 400) (= |v_t1Thread1of1ForFork1_#t~nondet40#1_109| |v_t1Thread1of1ForFork1_~tmp~0#1_91|) (<= 0 (+ |v_t1Thread1of1ForFork1_get_top_#res#1_86| 2147483648)) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82| |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|) (= |v_t1Thread1of1ForFork1_push_~x#1_90| |v_t1Thread1of1ForFork1_push_#in~x#1_68|) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82| (ite (< .cse1 400) 1 0)) (not (= |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90| 0)) (= (store |v_#memory_int_165| |v_t1Thread1of1ForFork1_push_~stack#1.base_90| (store (select |v_#memory_int_165| |v_t1Thread1of1ForFork1_push_~stack#1.base_90|) (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_86| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_90|) |v_t1Thread1of1ForFork1_push_~x#1_90|)) |v_#memory_int_164|) (<= |v_t1Thread1of1ForFork1_get_top_#res#1_86| 2147483647) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68| |v_~#arr~0.offset_76|) (= (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) |v_t1Thread1of1ForFork1_push_#in~x#1_68|) (= |v_t1Thread1of1ForFork1_push_~stack#1.base_90| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_391|, ~#arr~0.offset=|v_~#arr~0.offset_76|, ~#m~0.base=|v_~#m~0.base_182|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_128|, ~#m~0.offset=|v_~#m~0.offset_182|, #memory_int=|v_#memory_int_165|, ~top~0=v_~top~0_404, ~#arr~0.base=|v_~#arr~0.base_81|, t1Thread1of1ForFork1_#t~nondet40#1=|v_t1Thread1of1ForFork1_#t~nondet40#1_109|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_390|, ~#arr~0.offset=|v_~#arr~0.offset_76|, t1Thread1of1ForFork1_push_~x#1=|v_t1Thread1of1ForFork1_push_~x#1_90|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_128|, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82|, t1Thread1of1ForFork1_push_#t~ret34#1=|v_t1Thread1of1ForFork1_push_#t~ret34#1_108|, t1Thread1of1ForFork1_push_#in~stack#1.base=|v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|, t1Thread1of1ForFork1_push_#in~stack#1.offset=|v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68|, ~top~0=v_~top~0_404, t1Thread1of1ForFork1_push_#in~x#1=|v_t1Thread1of1ForFork1_push_#in~x#1_68|, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_160|, t1Thread1of1ForFork1_get_top_#res#1=|v_t1Thread1of1ForFork1_get_top_#res#1_86|, ~#m~0.base=|v_~#m~0.base_182|, ~#m~0.offset=|v_~#m~0.offset_182|, t1Thread1of1ForFork1_~tmp~0#1=|v_t1Thread1of1ForFork1_~tmp~0#1_91|, #memory_int=|v_#memory_int_164|, t1Thread1of1ForFork1_push_~stack#1.offset=|v_t1Thread1of1ForFork1_push_~stack#1.offset_90|, t1Thread1of1ForFork1_#t~nondet39#1=|v_t1Thread1of1ForFork1_#t~nondet39#1_78|, t1Thread1of1ForFork1_push_~stack#1.base=|v_t1Thread1of1ForFork1_push_~stack#1.base_90|, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|, t1Thread1of1ForFork1_push_#t~nondet33#1=|v_t1Thread1of1ForFork1_push_#t~nondet33#1_61|, ~#arr~0.base=|v_~#arr~0.base_81|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_293|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_push_~x#1, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, t1Thread1of1ForFork1_push_#t~ret34#1, t1Thread1of1ForFork1_push_#in~stack#1.base, t1Thread1of1ForFork1_push_#in~stack#1.offset, t1Thread1of1ForFork1_push_#in~x#1, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_#t~nondet40#1, t1Thread1of1ForFork1_get_top_#res#1, t1Thread1of1ForFork1_~tmp~0#1, #memory_int, t1Thread1of1ForFork1_push_~stack#1.offset, t1Thread1of1ForFork1_#t~nondet39#1, t1Thread1of1ForFork1_push_~stack#1.base, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1, t1Thread1of1ForFork1_push_#t~nondet33#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] and [563] L1021-4-->L1022-3: Formula: (and (= |v_#pthreadsForks_26| |v_ULTIMATE.start_main_#t~pre47#1_21|) (= |v_#memory_int_87| (store |v_#memory_int_88| |v_ULTIMATE.start_main_~#id2~0#1.base_21| (store (select |v_#memory_int_88| |v_ULTIMATE.start_main_~#id2~0#1.base_21|) |v_ULTIMATE.start_main_~#id2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre47#1_21|))) (= |v_#pthreadsForks_25| (+ |v_#pthreadsForks_26| 1))) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_26|, #memory_int=|v_#memory_int_88|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~nondet46#1=|v_ULTIMATE.start_main_#t~nondet46#1_15|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_25|, #memory_int=|v_#memory_int_87|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_21|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_21|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre47#1, ULTIMATE.start_main_#t~pre45#1] [2022-12-06 04:07:17,359 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [624] L991-6-->L945: Formula: (let ((.cse0 (select |v_#pthreadsMutex_391| |v_~#m~0.base_182|)) (.cse1 (mod |v_t1Thread1of1ForFork1_~tmp~0#1_91| 4294967296))) (and (= (select .cse0 |v_~#m~0.offset_182|) 0) (= (store |v_#pthreadsMutex_391| |v_~#m~0.base_182| (store .cse0 |v_~#m~0.offset_182| 1)) |v_#pthreadsMutex_390|) (= |v_~#arr~0.base_81| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68| |v_t1Thread1of1ForFork1_push_~stack#1.offset_90|) (= |v_t1Thread1of1ForFork1_get_top_#res#1_86| v_~top~0_404) (not (= 400 v_~top~0_404)) (< |v_t1Thread1of1ForFork1_~i~0#1_128| 400) (= |v_t1Thread1of1ForFork1_#t~nondet40#1_109| |v_t1Thread1of1ForFork1_~tmp~0#1_91|) (<= 0 (+ |v_t1Thread1of1ForFork1_get_top_#res#1_86| 2147483648)) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82| |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|) (= |v_t1Thread1of1ForFork1_push_~x#1_90| |v_t1Thread1of1ForFork1_push_#in~x#1_68|) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82| (ite (< .cse1 400) 1 0)) (not (= |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90| 0)) (= (store |v_#memory_int_165| |v_t1Thread1of1ForFork1_push_~stack#1.base_90| (store (select |v_#memory_int_165| |v_t1Thread1of1ForFork1_push_~stack#1.base_90|) (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_86| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_90|) |v_t1Thread1of1ForFork1_push_~x#1_90|)) |v_#memory_int_164|) (<= |v_t1Thread1of1ForFork1_get_top_#res#1_86| 2147483647) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68| |v_~#arr~0.offset_76|) (= (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) |v_t1Thread1of1ForFork1_push_#in~x#1_68|) (= |v_t1Thread1of1ForFork1_push_~stack#1.base_90| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_391|, ~#arr~0.offset=|v_~#arr~0.offset_76|, ~#m~0.base=|v_~#m~0.base_182|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_128|, ~#m~0.offset=|v_~#m~0.offset_182|, #memory_int=|v_#memory_int_165|, ~top~0=v_~top~0_404, ~#arr~0.base=|v_~#arr~0.base_81|, t1Thread1of1ForFork1_#t~nondet40#1=|v_t1Thread1of1ForFork1_#t~nondet40#1_109|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_390|, ~#arr~0.offset=|v_~#arr~0.offset_76|, t1Thread1of1ForFork1_push_~x#1=|v_t1Thread1of1ForFork1_push_~x#1_90|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_128|, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82|, t1Thread1of1ForFork1_push_#t~ret34#1=|v_t1Thread1of1ForFork1_push_#t~ret34#1_108|, t1Thread1of1ForFork1_push_#in~stack#1.base=|v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|, t1Thread1of1ForFork1_push_#in~stack#1.offset=|v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68|, ~top~0=v_~top~0_404, t1Thread1of1ForFork1_push_#in~x#1=|v_t1Thread1of1ForFork1_push_#in~x#1_68|, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_160|, t1Thread1of1ForFork1_get_top_#res#1=|v_t1Thread1of1ForFork1_get_top_#res#1_86|, ~#m~0.base=|v_~#m~0.base_182|, ~#m~0.offset=|v_~#m~0.offset_182|, t1Thread1of1ForFork1_~tmp~0#1=|v_t1Thread1of1ForFork1_~tmp~0#1_91|, #memory_int=|v_#memory_int_164|, t1Thread1of1ForFork1_push_~stack#1.offset=|v_t1Thread1of1ForFork1_push_~stack#1.offset_90|, t1Thread1of1ForFork1_#t~nondet39#1=|v_t1Thread1of1ForFork1_#t~nondet39#1_78|, t1Thread1of1ForFork1_push_~stack#1.base=|v_t1Thread1of1ForFork1_push_~stack#1.base_90|, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|, t1Thread1of1ForFork1_push_#t~nondet33#1=|v_t1Thread1of1ForFork1_push_#t~nondet33#1_61|, ~#arr~0.base=|v_~#arr~0.base_81|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_293|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_push_~x#1, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, t1Thread1of1ForFork1_push_#t~ret34#1, t1Thread1of1ForFork1_push_#in~stack#1.base, t1Thread1of1ForFork1_push_#in~stack#1.offset, t1Thread1of1ForFork1_push_#in~x#1, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_#t~nondet40#1, t1Thread1of1ForFork1_get_top_#res#1, t1Thread1of1ForFork1_~tmp~0#1, #memory_int, t1Thread1of1ForFork1_push_~stack#1.offset, t1Thread1of1ForFork1_#t~nondet39#1, t1Thread1of1ForFork1_push_~stack#1.base, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1, t1Thread1of1ForFork1_push_#t~nondet33#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] and [579] L1022-4-->L1023-1: Formula: (= |v_ULTIMATE.start_main_#t~mem49#1_16| (select (select |v_#memory_int_99| |v_ULTIMATE.start_main_~#id1~0#1.base_17|) |v_ULTIMATE.start_main_~#id1~0#1.offset_17|)) InVars {#memory_int=|v_#memory_int_99|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_17|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_17|} OutVars{ULTIMATE.start_main_#t~mem49#1=|v_ULTIMATE.start_main_#t~mem49#1_16|, ULTIMATE.start_main_#t~nondet48#1=|v_ULTIMATE.start_main_#t~nondet48#1_13|, #memory_int=|v_#memory_int_99|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_23|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_17|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem49#1, ULTIMATE.start_main_#t~nondet48#1, ULTIMATE.start_main_#t~pre47#1] [2022-12-06 04:07:17,529 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [624] L991-6-->L945: Formula: (let ((.cse0 (select |v_#pthreadsMutex_391| |v_~#m~0.base_182|)) (.cse1 (mod |v_t1Thread1of1ForFork1_~tmp~0#1_91| 4294967296))) (and (= (select .cse0 |v_~#m~0.offset_182|) 0) (= (store |v_#pthreadsMutex_391| |v_~#m~0.base_182| (store .cse0 |v_~#m~0.offset_182| 1)) |v_#pthreadsMutex_390|) (= |v_~#arr~0.base_81| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68| |v_t1Thread1of1ForFork1_push_~stack#1.offset_90|) (= |v_t1Thread1of1ForFork1_get_top_#res#1_86| v_~top~0_404) (not (= 400 v_~top~0_404)) (< |v_t1Thread1of1ForFork1_~i~0#1_128| 400) (= |v_t1Thread1of1ForFork1_#t~nondet40#1_109| |v_t1Thread1of1ForFork1_~tmp~0#1_91|) (<= 0 (+ |v_t1Thread1of1ForFork1_get_top_#res#1_86| 2147483648)) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82| |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|) (= |v_t1Thread1of1ForFork1_push_~x#1_90| |v_t1Thread1of1ForFork1_push_#in~x#1_68|) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82| (ite (< .cse1 400) 1 0)) (not (= |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90| 0)) (= (store |v_#memory_int_165| |v_t1Thread1of1ForFork1_push_~stack#1.base_90| (store (select |v_#memory_int_165| |v_t1Thread1of1ForFork1_push_~stack#1.base_90|) (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_86| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_90|) |v_t1Thread1of1ForFork1_push_~x#1_90|)) |v_#memory_int_164|) (<= |v_t1Thread1of1ForFork1_get_top_#res#1_86| 2147483647) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68| |v_~#arr~0.offset_76|) (= (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) |v_t1Thread1of1ForFork1_push_#in~x#1_68|) (= |v_t1Thread1of1ForFork1_push_~stack#1.base_90| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_391|, ~#arr~0.offset=|v_~#arr~0.offset_76|, ~#m~0.base=|v_~#m~0.base_182|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_128|, ~#m~0.offset=|v_~#m~0.offset_182|, #memory_int=|v_#memory_int_165|, ~top~0=v_~top~0_404, ~#arr~0.base=|v_~#arr~0.base_81|, t1Thread1of1ForFork1_#t~nondet40#1=|v_t1Thread1of1ForFork1_#t~nondet40#1_109|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_390|, ~#arr~0.offset=|v_~#arr~0.offset_76|, t1Thread1of1ForFork1_push_~x#1=|v_t1Thread1of1ForFork1_push_~x#1_90|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_128|, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82|, t1Thread1of1ForFork1_push_#t~ret34#1=|v_t1Thread1of1ForFork1_push_#t~ret34#1_108|, t1Thread1of1ForFork1_push_#in~stack#1.base=|v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|, t1Thread1of1ForFork1_push_#in~stack#1.offset=|v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68|, ~top~0=v_~top~0_404, t1Thread1of1ForFork1_push_#in~x#1=|v_t1Thread1of1ForFork1_push_#in~x#1_68|, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_160|, t1Thread1of1ForFork1_get_top_#res#1=|v_t1Thread1of1ForFork1_get_top_#res#1_86|, ~#m~0.base=|v_~#m~0.base_182|, ~#m~0.offset=|v_~#m~0.offset_182|, t1Thread1of1ForFork1_~tmp~0#1=|v_t1Thread1of1ForFork1_~tmp~0#1_91|, #memory_int=|v_#memory_int_164|, t1Thread1of1ForFork1_push_~stack#1.offset=|v_t1Thread1of1ForFork1_push_~stack#1.offset_90|, t1Thread1of1ForFork1_#t~nondet39#1=|v_t1Thread1of1ForFork1_#t~nondet39#1_78|, t1Thread1of1ForFork1_push_~stack#1.base=|v_t1Thread1of1ForFork1_push_~stack#1.base_90|, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|, t1Thread1of1ForFork1_push_#t~nondet33#1=|v_t1Thread1of1ForFork1_push_#t~nondet33#1_61|, ~#arr~0.base=|v_~#arr~0.base_81|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_293|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_push_~x#1, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, t1Thread1of1ForFork1_push_#t~ret34#1, t1Thread1of1ForFork1_push_#in~stack#1.base, t1Thread1of1ForFork1_push_#in~stack#1.offset, t1Thread1of1ForFork1_push_#in~x#1, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_#t~nondet40#1, t1Thread1of1ForFork1_get_top_#res#1, t1Thread1of1ForFork1_~tmp~0#1, #memory_int, t1Thread1of1ForFork1_push_~stack#1.offset, t1Thread1of1ForFork1_#t~nondet39#1, t1Thread1of1ForFork1_push_~stack#1.base, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1, t1Thread1of1ForFork1_push_#t~nondet33#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] and [579] L1022-4-->L1023-1: Formula: (= |v_ULTIMATE.start_main_#t~mem49#1_16| (select (select |v_#memory_int_99| |v_ULTIMATE.start_main_~#id1~0#1.base_17|) |v_ULTIMATE.start_main_~#id1~0#1.offset_17|)) InVars {#memory_int=|v_#memory_int_99|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_17|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_17|} OutVars{ULTIMATE.start_main_#t~mem49#1=|v_ULTIMATE.start_main_#t~mem49#1_16|, ULTIMATE.start_main_#t~nondet48#1=|v_ULTIMATE.start_main_#t~nondet48#1_13|, #memory_int=|v_#memory_int_99|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_23|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_17|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem49#1, ULTIMATE.start_main_#t~nondet48#1, ULTIMATE.start_main_#t~pre47#1] [2022-12-06 04:07:18,248 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:07:18,249 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2189 [2022-12-06 04:07:18,249 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 245 transitions, 3346 flow [2022-12-06 04:07:18,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 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 04:07:18,249 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:07:18,249 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:07:18,256 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 04:07:18,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:07:18,456 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:07:18,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:07:18,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1779810245, now seen corresponding path program 1 times [2022-12-06 04:07:18,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:07:18,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497762469] [2022-12-06 04:07:18,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:07:18,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:07:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:07:18,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-06 04:07:18,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:07:18,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497762469] [2022-12-06 04:07:18,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497762469] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:07:18,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:07:18,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:07:18,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34863749] [2022-12-06 04:07:18,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:07:18,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:07:18,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:07:18,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:07:18,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:07:18,863 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 54 [2022-12-06 04:07:18,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 245 transitions, 3346 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 04:07:18,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:07:18,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 54 [2022-12-06 04:07:18,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:07:20,739 INFO L130 PetriNetUnfolder]: 5485/10584 cut-off events. [2022-12-06 04:07:20,739 INFO L131 PetriNetUnfolder]: For 64415/64415 co-relation queries the response was YES. [2022-12-06 04:07:20,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54074 conditions, 10584 events. 5485/10584 cut-off events. For 64415/64415 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 83583 event pairs, 2128 based on Foata normal form. 12/10596 useless extension candidates. Maximal degree in co-relation 52381. Up to 5587 conditions per place. [2022-12-06 04:07:20,809 INFO L137 encePairwiseOnDemand]: 37/54 looper letters, 354 selfloop transitions, 123 changer transitions 0/479 dead transitions. [2022-12-06 04:07:20,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 479 transitions, 7244 flow [2022-12-06 04:07:20,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 04:07:20,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 04:07:20,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 168 transitions. [2022-12-06 04:07:20,810 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3111111111111111 [2022-12-06 04:07:20,810 INFO L175 Difference]: Start difference. First operand has 107 places, 245 transitions, 3346 flow. Second operand 10 states and 168 transitions. [2022-12-06 04:07:20,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 479 transitions, 7244 flow [2022-12-06 04:07:20,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 479 transitions, 6736 flow, removed 189 selfloop flow, removed 2 redundant places. [2022-12-06 04:07:20,971 INFO L231 Difference]: Finished difference. Result has 118 places, 334 transitions, 4902 flow [2022-12-06 04:07:20,971 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3100, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4902, PETRI_PLACES=118, PETRI_TRANSITIONS=334} [2022-12-06 04:07:20,972 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 76 predicate places. [2022-12-06 04:07:20,972 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:07:20,972 INFO L89 Accepts]: Start accepts. Operand has 118 places, 334 transitions, 4902 flow [2022-12-06 04:07:20,973 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:07:20,973 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:07:20,973 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 334 transitions, 4902 flow [2022-12-06 04:07:20,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 334 transitions, 4902 flow [2022-12-06 04:07:21,481 INFO L130 PetriNetUnfolder]: 1557/4431 cut-off events. [2022-12-06 04:07:21,481 INFO L131 PetriNetUnfolder]: For 22922/23760 co-relation queries the response was YES. [2022-12-06 04:07:21,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19545 conditions, 4431 events. 1557/4431 cut-off events. For 22922/23760 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 43048 event pairs, 418 based on Foata normal form. 40/4249 useless extension candidates. Maximal degree in co-relation 18735. Up to 984 conditions per place. [2022-12-06 04:07:21,542 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 334 transitions, 4902 flow [2022-12-06 04:07:21,542 INFO L188 LiptonReduction]: Number of co-enabled transitions 2008 [2022-12-06 04:07:21,804 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [624] L991-6-->L945: Formula: (let ((.cse0 (select |v_#pthreadsMutex_391| |v_~#m~0.base_182|)) (.cse1 (mod |v_t1Thread1of1ForFork1_~tmp~0#1_91| 4294967296))) (and (= (select .cse0 |v_~#m~0.offset_182|) 0) (= (store |v_#pthreadsMutex_391| |v_~#m~0.base_182| (store .cse0 |v_~#m~0.offset_182| 1)) |v_#pthreadsMutex_390|) (= |v_~#arr~0.base_81| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68| |v_t1Thread1of1ForFork1_push_~stack#1.offset_90|) (= |v_t1Thread1of1ForFork1_get_top_#res#1_86| v_~top~0_404) (not (= 400 v_~top~0_404)) (< |v_t1Thread1of1ForFork1_~i~0#1_128| 400) (= |v_t1Thread1of1ForFork1_#t~nondet40#1_109| |v_t1Thread1of1ForFork1_~tmp~0#1_91|) (<= 0 (+ |v_t1Thread1of1ForFork1_get_top_#res#1_86| 2147483648)) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82| |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|) (= |v_t1Thread1of1ForFork1_push_~x#1_90| |v_t1Thread1of1ForFork1_push_#in~x#1_68|) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82| (ite (< .cse1 400) 1 0)) (not (= |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90| 0)) (= (store |v_#memory_int_165| |v_t1Thread1of1ForFork1_push_~stack#1.base_90| (store (select |v_#memory_int_165| |v_t1Thread1of1ForFork1_push_~stack#1.base_90|) (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_86| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_90|) |v_t1Thread1of1ForFork1_push_~x#1_90|)) |v_#memory_int_164|) (<= |v_t1Thread1of1ForFork1_get_top_#res#1_86| 2147483647) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68| |v_~#arr~0.offset_76|) (= (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) |v_t1Thread1of1ForFork1_push_#in~x#1_68|) (= |v_t1Thread1of1ForFork1_push_~stack#1.base_90| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_391|, ~#arr~0.offset=|v_~#arr~0.offset_76|, ~#m~0.base=|v_~#m~0.base_182|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_128|, ~#m~0.offset=|v_~#m~0.offset_182|, #memory_int=|v_#memory_int_165|, ~top~0=v_~top~0_404, ~#arr~0.base=|v_~#arr~0.base_81|, t1Thread1of1ForFork1_#t~nondet40#1=|v_t1Thread1of1ForFork1_#t~nondet40#1_109|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_390|, ~#arr~0.offset=|v_~#arr~0.offset_76|, t1Thread1of1ForFork1_push_~x#1=|v_t1Thread1of1ForFork1_push_~x#1_90|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_128|, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82|, t1Thread1of1ForFork1_push_#t~ret34#1=|v_t1Thread1of1ForFork1_push_#t~ret34#1_108|, t1Thread1of1ForFork1_push_#in~stack#1.base=|v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|, t1Thread1of1ForFork1_push_#in~stack#1.offset=|v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68|, ~top~0=v_~top~0_404, t1Thread1of1ForFork1_push_#in~x#1=|v_t1Thread1of1ForFork1_push_#in~x#1_68|, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_160|, t1Thread1of1ForFork1_get_top_#res#1=|v_t1Thread1of1ForFork1_get_top_#res#1_86|, ~#m~0.base=|v_~#m~0.base_182|, ~#m~0.offset=|v_~#m~0.offset_182|, t1Thread1of1ForFork1_~tmp~0#1=|v_t1Thread1of1ForFork1_~tmp~0#1_91|, #memory_int=|v_#memory_int_164|, t1Thread1of1ForFork1_push_~stack#1.offset=|v_t1Thread1of1ForFork1_push_~stack#1.offset_90|, t1Thread1of1ForFork1_#t~nondet39#1=|v_t1Thread1of1ForFork1_#t~nondet39#1_78|, t1Thread1of1ForFork1_push_~stack#1.base=|v_t1Thread1of1ForFork1_push_~stack#1.base_90|, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|, t1Thread1of1ForFork1_push_#t~nondet33#1=|v_t1Thread1of1ForFork1_push_#t~nondet33#1_61|, ~#arr~0.base=|v_~#arr~0.base_81|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_293|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_push_~x#1, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, t1Thread1of1ForFork1_push_#t~ret34#1, t1Thread1of1ForFork1_push_#in~stack#1.base, t1Thread1of1ForFork1_push_#in~stack#1.offset, t1Thread1of1ForFork1_push_#in~x#1, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_#t~nondet40#1, t1Thread1of1ForFork1_get_top_#res#1, t1Thread1of1ForFork1_~tmp~0#1, #memory_int, t1Thread1of1ForFork1_push_~stack#1.offset, t1Thread1of1ForFork1_#t~nondet39#1, t1Thread1of1ForFork1_push_~stack#1.base, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1, t1Thread1of1ForFork1_push_#t~nondet33#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] and [592] L1005-6-->t2EXIT: Formula: (and (not (< |v_t2Thread1of1ForFork0_~i~1#1_In_2| 400)) (= |v_t2Thread1of1ForFork0_#res#1.base_Out_4| 0) (= |v_t2Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {t2Thread1of1ForFork0_~i~1#1=|v_t2Thread1of1ForFork0_~i~1#1_In_2|} OutVars{t2Thread1of1ForFork0_~i~1#1=|v_t2Thread1of1ForFork0_~i~1#1_In_2|, t2Thread1of1ForFork0_#res#1.base=|v_t2Thread1of1ForFork0_#res#1.base_Out_4|, t2Thread1of1ForFork0_#res#1.offset=|v_t2Thread1of1ForFork0_#res#1.offset_Out_4|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_#res#1.base, t2Thread1of1ForFork0_#res#1.offset] [2022-12-06 04:07:23,441 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:07:23,442 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2470 [2022-12-06 04:07:23,442 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 334 transitions, 4934 flow [2022-12-06 04:07:23,442 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 04:07:23,442 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:07:23,442 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:07:23,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:07:23,442 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:07:23,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:07:23,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1607610805, now seen corresponding path program 1 times [2022-12-06 04:07:23,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:07:23,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081737008] [2022-12-06 04:07:23,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:07:23,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:07:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:07:23,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:07:23,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:07:23,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081737008] [2022-12-06 04:07:23,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081737008] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:07:23,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053949995] [2022-12-06 04:07:23,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:07:23,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:07:23,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:07:23,980 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 04:07:23,985 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 04:07:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:07:24,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 72 conjunts are in the unsatisfiable core [2022-12-06 04:07:24,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:07:24,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 04:07:24,109 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 10 treesize of output 12 [2022-12-06 04:07:24,129 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-06 04:07:24,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-12-06 04:07:24,180 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 13 treesize of output 15 [2022-12-06 04:07:24,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 22 treesize of output 17 [2022-12-06 04:07:24,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 26 [2022-12-06 04:07:28,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 55 [2022-12-06 04:07:28,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:07:28,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:07:28,890 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_410 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_410) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-12-06 04:07:28,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:07:28,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053949995] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:07:28,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:07:28,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 5] total 19 [2022-12-06 04:07:28,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597305415] [2022-12-06 04:07:28,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:07:28,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 04:07:28,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:07:28,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 04:07:28,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=283, Unknown=3, NotChecked=36, Total=420 [2022-12-06 04:07:28,899 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 62 [2022-12-06 04:07:28,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 334 transitions, 4934 flow. Second operand has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:07:28,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:07:28,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 62 [2022-12-06 04:07:28,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:07:40,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:07:43,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:07:49,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:07:50,144 INFO L130 PetriNetUnfolder]: 13174/25463 cut-off events. [2022-12-06 04:07:50,144 INFO L131 PetriNetUnfolder]: For 159371/159371 co-relation queries the response was YES. [2022-12-06 04:07:50,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128605 conditions, 25463 events. 13174/25463 cut-off events. For 159371/159371 co-relation queries the response was YES. Maximal size of possible extension queue 1240. Compared 231823 event pairs, 2633 based on Foata normal form. 84/25547 useless extension candidates. Maximal degree in co-relation 126217. Up to 7535 conditions per place. [2022-12-06 04:07:50,425 INFO L137 encePairwiseOnDemand]: 19/62 looper letters, 523 selfloop transitions, 781 changer transitions 111/1417 dead transitions. [2022-12-06 04:07:50,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 1417 transitions, 19790 flow [2022-12-06 04:07:50,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-12-06 04:07:50,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2022-12-06 04:07:50,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 951 transitions. [2022-12-06 04:07:50,429 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2018251273344652 [2022-12-06 04:07:50,429 INFO L175 Difference]: Start difference. First operand has 118 places, 334 transitions, 4934 flow. Second operand 76 states and 951 transitions. [2022-12-06 04:07:50,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 1417 transitions, 19790 flow [2022-12-06 04:07:50,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 1417 transitions, 19729 flow, removed 30 selfloop flow, removed 1 redundant places. [2022-12-06 04:07:50,911 INFO L231 Difference]: Finished difference. Result has 217 places, 841 transitions, 15159 flow [2022-12-06 04:07:50,911 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=4913, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=275, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=76, PETRI_FLOW=15159, PETRI_PLACES=217, PETRI_TRANSITIONS=841} [2022-12-06 04:07:50,912 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 175 predicate places. [2022-12-06 04:07:50,912 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:07:50,912 INFO L89 Accepts]: Start accepts. Operand has 217 places, 841 transitions, 15159 flow [2022-12-06 04:07:50,914 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:07:50,914 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:07:50,914 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 217 places, 841 transitions, 15159 flow [2022-12-06 04:07:50,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 217 places, 841 transitions, 15159 flow [2022-12-06 04:07:52,639 INFO L130 PetriNetUnfolder]: 3842/10979 cut-off events. [2022-12-06 04:07:52,640 INFO L131 PetriNetUnfolder]: For 82273/84327 co-relation queries the response was YES. [2022-12-06 04:07:52,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55327 conditions, 10979 events. 3842/10979 cut-off events. For 82273/84327 co-relation queries the response was YES. Maximal size of possible extension queue 854. Compared 123773 event pairs, 981 based on Foata normal form. 92/10536 useless extension candidates. Maximal degree in co-relation 53883. Up to 2646 conditions per place. [2022-12-06 04:07:52,822 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 217 places, 841 transitions, 15159 flow [2022-12-06 04:07:52,822 INFO L188 LiptonReduction]: Number of co-enabled transitions 4872 [2022-12-06 04:07:53,372 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [563] L1021-4-->L1022-3: Formula: (and (= |v_#pthreadsForks_26| |v_ULTIMATE.start_main_#t~pre47#1_21|) (= |v_#memory_int_87| (store |v_#memory_int_88| |v_ULTIMATE.start_main_~#id2~0#1.base_21| (store (select |v_#memory_int_88| |v_ULTIMATE.start_main_~#id2~0#1.base_21|) |v_ULTIMATE.start_main_~#id2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre47#1_21|))) (= |v_#pthreadsForks_25| (+ |v_#pthreadsForks_26| 1))) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_26|, #memory_int=|v_#memory_int_88|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~nondet46#1=|v_ULTIMATE.start_main_#t~nondet46#1_15|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_25|, #memory_int=|v_#memory_int_87|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_21|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_21|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre47#1, ULTIMATE.start_main_#t~pre45#1] and [630] L945-->L991-6: Formula: (and (= (store |v_#pthreadsMutex_417| |v_~#m~0.base_194| (store (select |v_#pthreadsMutex_417| |v_~#m~0.base_194|) |v_~#m~0.offset_194| 0)) |v_#pthreadsMutex_416|) (= |v_t1Thread1of1ForFork1_push_#res#1_170| 0) (= (+ v_~top~0_421 1) v_~top~0_420) (= |v_t1Thread1of1ForFork1_~i~0#1_144| (+ |v_t1Thread1of1ForFork1_~i~0#1_145| 1))) InVars {#pthreadsMutex=|v_#pthreadsMutex_417|, ~#m~0.base=|v_~#m~0.base_194|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_145|, ~#m~0.offset=|v_~#m~0.offset_194|, ~top~0=v_~top~0_421} OutVars{t1Thread1of1ForFork1_#t~post38#1=|v_t1Thread1of1ForFork1_#t~post38#1_73|, #pthreadsMutex=|v_#pthreadsMutex_416|, ~#m~0.base=|v_~#m~0.base_194|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_144|, ~#m~0.offset=|v_~#m~0.offset_194|, t1Thread1of1ForFork1_#t~ret41#1=|v_t1Thread1of1ForFork1_#t~ret41#1_202|, ~top~0=v_~top~0_420, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_170|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_305|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_#t~post38#1, #pthreadsMutex, t1Thread1of1ForFork1_~i~0#1, t1Thread1of1ForFork1_#t~ret41#1, ~top~0, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] [2022-12-06 04:07:54,966 INFO L203 LiptonReduction]: Total number of compositions: 10 [2022-12-06 04:07:54,966 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4054 [2022-12-06 04:07:54,966 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 833 transitions, 15115 flow [2022-12-06 04:07:54,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:07:54,967 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:07:54,967 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:07:54,985 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 04:07:55,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:07:55,172 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:07:55,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:07:55,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1915989312, now seen corresponding path program 1 times [2022-12-06 04:07:55,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:07:55,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321785310] [2022-12-06 04:07:55,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:07:55,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:07:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:07:55,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:07:55,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:07:55,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321785310] [2022-12-06 04:07:55,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321785310] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:07:55,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729877510] [2022-12-06 04:07:55,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:07:55,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:07:55,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:07:55,615 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 04:07:55,617 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 04:07:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:07:55,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 71 conjunts are in the unsatisfiable core [2022-12-06 04:07:55,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:07:55,820 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-06 04:07:55,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-12-06 04:07:55,861 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 15 treesize of output 11 [2022-12-06 04:07:55,921 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 38 [2022-12-06 04:07:56,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 04:07:56,015 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 52 treesize of output 38 [2022-12-06 04:07:56,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 46 [2022-12-06 04:07:59,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:07:59,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:07:59,924 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_478 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_478) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) is different from false [2022-12-06 04:07:59,940 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:07:59,941 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-06 04:07:59,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 57 [2022-12-06 04:07:59,948 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 28 treesize of output 22 [2022-12-06 04:07:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:07:59,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729877510] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:07:59,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:07:59,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 04:07:59,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388723095] [2022-12-06 04:07:59,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:07:59,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 04:07:59,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:07:59,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 04:07:59,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=170, Unknown=1, NotChecked=26, Total=240 [2022-12-06 04:07:59,975 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 73 [2022-12-06 04:07:59,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 833 transitions, 15115 flow. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:07:59,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:07:59,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 73 [2022-12-06 04:07:59,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:08:05,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:08:09,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:08:13,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:08:19,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:08:23,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:08:25,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 04:08:32,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:08:34,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:08:36,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:08:43,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 04:08:45,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 04:08:47,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 04:08:57,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:08:59,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:09:03,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:09:13,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:09:16,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:09:19,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:09:24,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:09:29,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:09:32,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:09:39,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:09:47,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:09:49,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:09:57,295 INFO L130 PetriNetUnfolder]: 31885/64472 cut-off events. [2022-12-06 04:09:57,295 INFO L131 PetriNetUnfolder]: For 595792/595792 co-relation queries the response was YES. [2022-12-06 04:09:58,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361061 conditions, 64472 events. 31885/64472 cut-off events. For 595792/595792 co-relation queries the response was YES. Maximal size of possible extension queue 2644. Compared 685019 event pairs, 8116 based on Foata normal form. 838/65310 useless extension candidates. Maximal degree in co-relation 355928. Up to 18237 conditions per place. [2022-12-06 04:09:58,421 INFO L137 encePairwiseOnDemand]: 27/73 looper letters, 1197 selfloop transitions, 2065 changer transitions 150/3414 dead transitions. [2022-12-06 04:09:58,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 3414 transitions, 61945 flow [2022-12-06 04:09:58,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-12-06 04:09:58,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2022-12-06 04:09:58,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 1270 transitions. [2022-12-06 04:09:58,425 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20467365028203063 [2022-12-06 04:09:58,425 INFO L175 Difference]: Start difference. First operand has 209 places, 833 transitions, 15115 flow. Second operand 85 states and 1270 transitions. [2022-12-06 04:09:58,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 3414 transitions, 61945 flow [2022-12-06 04:10:04,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 3414 transitions, 61164 flow, removed 343 selfloop flow, removed 12 redundant places. [2022-12-06 04:10:04,467 INFO L231 Difference]: Finished difference. Result has 338 places, 2547 transitions, 52319 flow [2022-12-06 04:10:04,468 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=12659, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=714, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=458, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=85, PETRI_FLOW=52319, PETRI_PLACES=338, PETRI_TRANSITIONS=2547} [2022-12-06 04:10:04,468 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 296 predicate places. [2022-12-06 04:10:04,468 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:04,468 INFO L89 Accepts]: Start accepts. Operand has 338 places, 2547 transitions, 52319 flow [2022-12-06 04:10:04,474 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:04,475 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:04,475 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 338 places, 2547 transitions, 52319 flow [2022-12-06 04:10:04,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 336 places, 2547 transitions, 52319 flow [2022-12-06 04:10:16,991 INFO L130 PetriNetUnfolder]: 11751/34616 cut-off events. [2022-12-06 04:10:16,991 INFO L131 PetriNetUnfolder]: For 3391998/3408149 co-relation queries the response was YES. [2022-12-06 04:10:17,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384671 conditions, 34616 events. 11751/34616 cut-off events. For 3391998/3408149 co-relation queries the response was YES. Maximal size of possible extension queue 2030. Compared 450792 event pairs, 1888 based on Foata normal form. 181/34165 useless extension candidates. Maximal degree in co-relation 380317. Up to 8123 conditions per place. [2022-12-06 04:10:18,487 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 336 places, 2547 transitions, 52319 flow [2022-12-06 04:10:18,488 INFO L188 LiptonReduction]: Number of co-enabled transitions 10640 [2022-12-06 04:10:18,496 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [624] L991-6-->L945: Formula: (let ((.cse0 (select |v_#pthreadsMutex_391| |v_~#m~0.base_182|)) (.cse1 (mod |v_t1Thread1of1ForFork1_~tmp~0#1_91| 4294967296))) (and (= (select .cse0 |v_~#m~0.offset_182|) 0) (= (store |v_#pthreadsMutex_391| |v_~#m~0.base_182| (store .cse0 |v_~#m~0.offset_182| 1)) |v_#pthreadsMutex_390|) (= |v_~#arr~0.base_81| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68| |v_t1Thread1of1ForFork1_push_~stack#1.offset_90|) (= |v_t1Thread1of1ForFork1_get_top_#res#1_86| v_~top~0_404) (not (= 400 v_~top~0_404)) (< |v_t1Thread1of1ForFork1_~i~0#1_128| 400) (= |v_t1Thread1of1ForFork1_#t~nondet40#1_109| |v_t1Thread1of1ForFork1_~tmp~0#1_91|) (<= 0 (+ |v_t1Thread1of1ForFork1_get_top_#res#1_86| 2147483648)) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82| |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|) (= |v_t1Thread1of1ForFork1_push_~x#1_90| |v_t1Thread1of1ForFork1_push_#in~x#1_68|) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82| (ite (< .cse1 400) 1 0)) (not (= |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90| 0)) (= (store |v_#memory_int_165| |v_t1Thread1of1ForFork1_push_~stack#1.base_90| (store (select |v_#memory_int_165| |v_t1Thread1of1ForFork1_push_~stack#1.base_90|) (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_86| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_90|) |v_t1Thread1of1ForFork1_push_~x#1_90|)) |v_#memory_int_164|) (<= |v_t1Thread1of1ForFork1_get_top_#res#1_86| 2147483647) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68| |v_~#arr~0.offset_76|) (= (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) |v_t1Thread1of1ForFork1_push_#in~x#1_68|) (= |v_t1Thread1of1ForFork1_push_~stack#1.base_90| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_391|, ~#arr~0.offset=|v_~#arr~0.offset_76|, ~#m~0.base=|v_~#m~0.base_182|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_128|, ~#m~0.offset=|v_~#m~0.offset_182|, #memory_int=|v_#memory_int_165|, ~top~0=v_~top~0_404, ~#arr~0.base=|v_~#arr~0.base_81|, t1Thread1of1ForFork1_#t~nondet40#1=|v_t1Thread1of1ForFork1_#t~nondet40#1_109|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_390|, ~#arr~0.offset=|v_~#arr~0.offset_76|, t1Thread1of1ForFork1_push_~x#1=|v_t1Thread1of1ForFork1_push_~x#1_90|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_128|, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82|, t1Thread1of1ForFork1_push_#t~ret34#1=|v_t1Thread1of1ForFork1_push_#t~ret34#1_108|, t1Thread1of1ForFork1_push_#in~stack#1.base=|v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|, t1Thread1of1ForFork1_push_#in~stack#1.offset=|v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68|, ~top~0=v_~top~0_404, t1Thread1of1ForFork1_push_#in~x#1=|v_t1Thread1of1ForFork1_push_#in~x#1_68|, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_160|, t1Thread1of1ForFork1_get_top_#res#1=|v_t1Thread1of1ForFork1_get_top_#res#1_86|, ~#m~0.base=|v_~#m~0.base_182|, ~#m~0.offset=|v_~#m~0.offset_182|, t1Thread1of1ForFork1_~tmp~0#1=|v_t1Thread1of1ForFork1_~tmp~0#1_91|, #memory_int=|v_#memory_int_164|, t1Thread1of1ForFork1_push_~stack#1.offset=|v_t1Thread1of1ForFork1_push_~stack#1.offset_90|, t1Thread1of1ForFork1_#t~nondet39#1=|v_t1Thread1of1ForFork1_#t~nondet39#1_78|, t1Thread1of1ForFork1_push_~stack#1.base=|v_t1Thread1of1ForFork1_push_~stack#1.base_90|, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|, t1Thread1of1ForFork1_push_#t~nondet33#1=|v_t1Thread1of1ForFork1_push_#t~nondet33#1_61|, ~#arr~0.base=|v_~#arr~0.base_81|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_293|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_push_~x#1, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, t1Thread1of1ForFork1_push_#t~ret34#1, t1Thread1of1ForFork1_push_#in~stack#1.base, t1Thread1of1ForFork1_push_#in~stack#1.offset, t1Thread1of1ForFork1_push_#in~x#1, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_#t~nondet40#1, t1Thread1of1ForFork1_get_top_#res#1, t1Thread1of1ForFork1_~tmp~0#1, #memory_int, t1Thread1of1ForFork1_push_~stack#1.offset, t1Thread1of1ForFork1_#t~nondet39#1, t1Thread1of1ForFork1_push_~stack#1.base, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1, t1Thread1of1ForFork1_push_#t~nondet33#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] and [563] L1021-4-->L1022-3: Formula: (and (= |v_#pthreadsForks_26| |v_ULTIMATE.start_main_#t~pre47#1_21|) (= |v_#memory_int_87| (store |v_#memory_int_88| |v_ULTIMATE.start_main_~#id2~0#1.base_21| (store (select |v_#memory_int_88| |v_ULTIMATE.start_main_~#id2~0#1.base_21|) |v_ULTIMATE.start_main_~#id2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre47#1_21|))) (= |v_#pthreadsForks_25| (+ |v_#pthreadsForks_26| 1))) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_26|, #memory_int=|v_#memory_int_88|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~nondet46#1=|v_ULTIMATE.start_main_#t~nondet46#1_15|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_25|, #memory_int=|v_#memory_int_87|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_21|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_21|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre47#1, ULTIMATE.start_main_#t~pre45#1] [2022-12-06 04:10:19,132 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [624] L991-6-->L945: Formula: (let ((.cse0 (select |v_#pthreadsMutex_391| |v_~#m~0.base_182|)) (.cse1 (mod |v_t1Thread1of1ForFork1_~tmp~0#1_91| 4294967296))) (and (= (select .cse0 |v_~#m~0.offset_182|) 0) (= (store |v_#pthreadsMutex_391| |v_~#m~0.base_182| (store .cse0 |v_~#m~0.offset_182| 1)) |v_#pthreadsMutex_390|) (= |v_~#arr~0.base_81| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68| |v_t1Thread1of1ForFork1_push_~stack#1.offset_90|) (= |v_t1Thread1of1ForFork1_get_top_#res#1_86| v_~top~0_404) (not (= 400 v_~top~0_404)) (< |v_t1Thread1of1ForFork1_~i~0#1_128| 400) (= |v_t1Thread1of1ForFork1_#t~nondet40#1_109| |v_t1Thread1of1ForFork1_~tmp~0#1_91|) (<= 0 (+ |v_t1Thread1of1ForFork1_get_top_#res#1_86| 2147483648)) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82| |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|) (= |v_t1Thread1of1ForFork1_push_~x#1_90| |v_t1Thread1of1ForFork1_push_#in~x#1_68|) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82| (ite (< .cse1 400) 1 0)) (not (= |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90| 0)) (= (store |v_#memory_int_165| |v_t1Thread1of1ForFork1_push_~stack#1.base_90| (store (select |v_#memory_int_165| |v_t1Thread1of1ForFork1_push_~stack#1.base_90|) (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_86| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_90|) |v_t1Thread1of1ForFork1_push_~x#1_90|)) |v_#memory_int_164|) (<= |v_t1Thread1of1ForFork1_get_top_#res#1_86| 2147483647) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68| |v_~#arr~0.offset_76|) (= (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) |v_t1Thread1of1ForFork1_push_#in~x#1_68|) (= |v_t1Thread1of1ForFork1_push_~stack#1.base_90| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_391|, ~#arr~0.offset=|v_~#arr~0.offset_76|, ~#m~0.base=|v_~#m~0.base_182|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_128|, ~#m~0.offset=|v_~#m~0.offset_182|, #memory_int=|v_#memory_int_165|, ~top~0=v_~top~0_404, ~#arr~0.base=|v_~#arr~0.base_81|, t1Thread1of1ForFork1_#t~nondet40#1=|v_t1Thread1of1ForFork1_#t~nondet40#1_109|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_390|, ~#arr~0.offset=|v_~#arr~0.offset_76|, t1Thread1of1ForFork1_push_~x#1=|v_t1Thread1of1ForFork1_push_~x#1_90|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_128|, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82|, t1Thread1of1ForFork1_push_#t~ret34#1=|v_t1Thread1of1ForFork1_push_#t~ret34#1_108|, t1Thread1of1ForFork1_push_#in~stack#1.base=|v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|, t1Thread1of1ForFork1_push_#in~stack#1.offset=|v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68|, ~top~0=v_~top~0_404, t1Thread1of1ForFork1_push_#in~x#1=|v_t1Thread1of1ForFork1_push_#in~x#1_68|, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_160|, t1Thread1of1ForFork1_get_top_#res#1=|v_t1Thread1of1ForFork1_get_top_#res#1_86|, ~#m~0.base=|v_~#m~0.base_182|, ~#m~0.offset=|v_~#m~0.offset_182|, t1Thread1of1ForFork1_~tmp~0#1=|v_t1Thread1of1ForFork1_~tmp~0#1_91|, #memory_int=|v_#memory_int_164|, t1Thread1of1ForFork1_push_~stack#1.offset=|v_t1Thread1of1ForFork1_push_~stack#1.offset_90|, t1Thread1of1ForFork1_#t~nondet39#1=|v_t1Thread1of1ForFork1_#t~nondet39#1_78|, t1Thread1of1ForFork1_push_~stack#1.base=|v_t1Thread1of1ForFork1_push_~stack#1.base_90|, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|, t1Thread1of1ForFork1_push_#t~nondet33#1=|v_t1Thread1of1ForFork1_push_#t~nondet33#1_61|, ~#arr~0.base=|v_~#arr~0.base_81|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_293|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_push_~x#1, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, t1Thread1of1ForFork1_push_#t~ret34#1, t1Thread1of1ForFork1_push_#in~stack#1.base, t1Thread1of1ForFork1_push_#in~stack#1.offset, t1Thread1of1ForFork1_push_#in~x#1, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_#t~nondet40#1, t1Thread1of1ForFork1_get_top_#res#1, t1Thread1of1ForFork1_~tmp~0#1, #memory_int, t1Thread1of1ForFork1_push_~stack#1.offset, t1Thread1of1ForFork1_#t~nondet39#1, t1Thread1of1ForFork1_push_~stack#1.base, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1, t1Thread1of1ForFork1_push_#t~nondet33#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] and [579] L1022-4-->L1023-1: Formula: (= |v_ULTIMATE.start_main_#t~mem49#1_16| (select (select |v_#memory_int_99| |v_ULTIMATE.start_main_~#id1~0#1.base_17|) |v_ULTIMATE.start_main_~#id1~0#1.offset_17|)) InVars {#memory_int=|v_#memory_int_99|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_17|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_17|} OutVars{ULTIMATE.start_main_#t~mem49#1=|v_ULTIMATE.start_main_#t~mem49#1_16|, ULTIMATE.start_main_#t~nondet48#1=|v_ULTIMATE.start_main_#t~nondet48#1_13|, #memory_int=|v_#memory_int_99|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_23|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_17|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem49#1, ULTIMATE.start_main_#t~nondet48#1, ULTIMATE.start_main_#t~pre47#1] [2022-12-06 04:10:19,294 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [624] L991-6-->L945: Formula: (let ((.cse0 (select |v_#pthreadsMutex_391| |v_~#m~0.base_182|)) (.cse1 (mod |v_t1Thread1of1ForFork1_~tmp~0#1_91| 4294967296))) (and (= (select .cse0 |v_~#m~0.offset_182|) 0) (= (store |v_#pthreadsMutex_391| |v_~#m~0.base_182| (store .cse0 |v_~#m~0.offset_182| 1)) |v_#pthreadsMutex_390|) (= |v_~#arr~0.base_81| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68| |v_t1Thread1of1ForFork1_push_~stack#1.offset_90|) (= |v_t1Thread1of1ForFork1_get_top_#res#1_86| v_~top~0_404) (not (= 400 v_~top~0_404)) (< |v_t1Thread1of1ForFork1_~i~0#1_128| 400) (= |v_t1Thread1of1ForFork1_#t~nondet40#1_109| |v_t1Thread1of1ForFork1_~tmp~0#1_91|) (<= 0 (+ |v_t1Thread1of1ForFork1_get_top_#res#1_86| 2147483648)) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82| |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|) (= |v_t1Thread1of1ForFork1_push_~x#1_90| |v_t1Thread1of1ForFork1_push_#in~x#1_68|) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82| (ite (< .cse1 400) 1 0)) (not (= |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90| 0)) (= (store |v_#memory_int_165| |v_t1Thread1of1ForFork1_push_~stack#1.base_90| (store (select |v_#memory_int_165| |v_t1Thread1of1ForFork1_push_~stack#1.base_90|) (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_86| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_90|) |v_t1Thread1of1ForFork1_push_~x#1_90|)) |v_#memory_int_164|) (<= |v_t1Thread1of1ForFork1_get_top_#res#1_86| 2147483647) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68| |v_~#arr~0.offset_76|) (= (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) |v_t1Thread1of1ForFork1_push_#in~x#1_68|) (= |v_t1Thread1of1ForFork1_push_~stack#1.base_90| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_391|, ~#arr~0.offset=|v_~#arr~0.offset_76|, ~#m~0.base=|v_~#m~0.base_182|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_128|, ~#m~0.offset=|v_~#m~0.offset_182|, #memory_int=|v_#memory_int_165|, ~top~0=v_~top~0_404, ~#arr~0.base=|v_~#arr~0.base_81|, t1Thread1of1ForFork1_#t~nondet40#1=|v_t1Thread1of1ForFork1_#t~nondet40#1_109|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_390|, ~#arr~0.offset=|v_~#arr~0.offset_76|, t1Thread1of1ForFork1_push_~x#1=|v_t1Thread1of1ForFork1_push_~x#1_90|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_128|, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82|, t1Thread1of1ForFork1_push_#t~ret34#1=|v_t1Thread1of1ForFork1_push_#t~ret34#1_108|, t1Thread1of1ForFork1_push_#in~stack#1.base=|v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|, t1Thread1of1ForFork1_push_#in~stack#1.offset=|v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68|, ~top~0=v_~top~0_404, t1Thread1of1ForFork1_push_#in~x#1=|v_t1Thread1of1ForFork1_push_#in~x#1_68|, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_160|, t1Thread1of1ForFork1_get_top_#res#1=|v_t1Thread1of1ForFork1_get_top_#res#1_86|, ~#m~0.base=|v_~#m~0.base_182|, ~#m~0.offset=|v_~#m~0.offset_182|, t1Thread1of1ForFork1_~tmp~0#1=|v_t1Thread1of1ForFork1_~tmp~0#1_91|, #memory_int=|v_#memory_int_164|, t1Thread1of1ForFork1_push_~stack#1.offset=|v_t1Thread1of1ForFork1_push_~stack#1.offset_90|, t1Thread1of1ForFork1_#t~nondet39#1=|v_t1Thread1of1ForFork1_#t~nondet39#1_78|, t1Thread1of1ForFork1_push_~stack#1.base=|v_t1Thread1of1ForFork1_push_~stack#1.base_90|, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|, t1Thread1of1ForFork1_push_#t~nondet33#1=|v_t1Thread1of1ForFork1_push_#t~nondet33#1_61|, ~#arr~0.base=|v_~#arr~0.base_81|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_293|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_push_~x#1, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, t1Thread1of1ForFork1_push_#t~ret34#1, t1Thread1of1ForFork1_push_#in~stack#1.base, t1Thread1of1ForFork1_push_#in~stack#1.offset, t1Thread1of1ForFork1_push_#in~x#1, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_#t~nondet40#1, t1Thread1of1ForFork1_get_top_#res#1, t1Thread1of1ForFork1_~tmp~0#1, #memory_int, t1Thread1of1ForFork1_push_~stack#1.offset, t1Thread1of1ForFork1_#t~nondet39#1, t1Thread1of1ForFork1_push_~stack#1.base, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1, t1Thread1of1ForFork1_push_#t~nondet33#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] and [592] L1005-6-->t2EXIT: Formula: (and (not (< |v_t2Thread1of1ForFork0_~i~1#1_In_2| 400)) (= |v_t2Thread1of1ForFork0_#res#1.base_Out_4| 0) (= |v_t2Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {t2Thread1of1ForFork0_~i~1#1=|v_t2Thread1of1ForFork0_~i~1#1_In_2|} OutVars{t2Thread1of1ForFork0_~i~1#1=|v_t2Thread1of1ForFork0_~i~1#1_In_2|, t2Thread1of1ForFork0_#res#1.base=|v_t2Thread1of1ForFork0_#res#1.base_Out_4|, t2Thread1of1ForFork0_#res#1.offset=|v_t2Thread1of1ForFork0_#res#1.offset_Out_4|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_#res#1.base, t2Thread1of1ForFork0_#res#1.offset] [2022-12-06 04:10:24,431 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [624] L991-6-->L945: Formula: (let ((.cse0 (select |v_#pthreadsMutex_391| |v_~#m~0.base_182|)) (.cse1 (mod |v_t1Thread1of1ForFork1_~tmp~0#1_91| 4294967296))) (and (= (select .cse0 |v_~#m~0.offset_182|) 0) (= (store |v_#pthreadsMutex_391| |v_~#m~0.base_182| (store .cse0 |v_~#m~0.offset_182| 1)) |v_#pthreadsMutex_390|) (= |v_~#arr~0.base_81| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68| |v_t1Thread1of1ForFork1_push_~stack#1.offset_90|) (= |v_t1Thread1of1ForFork1_get_top_#res#1_86| v_~top~0_404) (not (= 400 v_~top~0_404)) (< |v_t1Thread1of1ForFork1_~i~0#1_128| 400) (= |v_t1Thread1of1ForFork1_#t~nondet40#1_109| |v_t1Thread1of1ForFork1_~tmp~0#1_91|) (<= 0 (+ |v_t1Thread1of1ForFork1_get_top_#res#1_86| 2147483648)) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82| |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|) (= |v_t1Thread1of1ForFork1_push_~x#1_90| |v_t1Thread1of1ForFork1_push_#in~x#1_68|) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82| (ite (< .cse1 400) 1 0)) (not (= |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90| 0)) (= (store |v_#memory_int_165| |v_t1Thread1of1ForFork1_push_~stack#1.base_90| (store (select |v_#memory_int_165| |v_t1Thread1of1ForFork1_push_~stack#1.base_90|) (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_86| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_90|) |v_t1Thread1of1ForFork1_push_~x#1_90|)) |v_#memory_int_164|) (<= |v_t1Thread1of1ForFork1_get_top_#res#1_86| 2147483647) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68| |v_~#arr~0.offset_76|) (= (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) |v_t1Thread1of1ForFork1_push_#in~x#1_68|) (= |v_t1Thread1of1ForFork1_push_~stack#1.base_90| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_391|, ~#arr~0.offset=|v_~#arr~0.offset_76|, ~#m~0.base=|v_~#m~0.base_182|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_128|, ~#m~0.offset=|v_~#m~0.offset_182|, #memory_int=|v_#memory_int_165|, ~top~0=v_~top~0_404, ~#arr~0.base=|v_~#arr~0.base_81|, t1Thread1of1ForFork1_#t~nondet40#1=|v_t1Thread1of1ForFork1_#t~nondet40#1_109|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_390|, ~#arr~0.offset=|v_~#arr~0.offset_76|, t1Thread1of1ForFork1_push_~x#1=|v_t1Thread1of1ForFork1_push_~x#1_90|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_128|, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82|, t1Thread1of1ForFork1_push_#t~ret34#1=|v_t1Thread1of1ForFork1_push_#t~ret34#1_108|, t1Thread1of1ForFork1_push_#in~stack#1.base=|v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|, t1Thread1of1ForFork1_push_#in~stack#1.offset=|v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68|, ~top~0=v_~top~0_404, t1Thread1of1ForFork1_push_#in~x#1=|v_t1Thread1of1ForFork1_push_#in~x#1_68|, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_160|, t1Thread1of1ForFork1_get_top_#res#1=|v_t1Thread1of1ForFork1_get_top_#res#1_86|, ~#m~0.base=|v_~#m~0.base_182|, ~#m~0.offset=|v_~#m~0.offset_182|, t1Thread1of1ForFork1_~tmp~0#1=|v_t1Thread1of1ForFork1_~tmp~0#1_91|, #memory_int=|v_#memory_int_164|, t1Thread1of1ForFork1_push_~stack#1.offset=|v_t1Thread1of1ForFork1_push_~stack#1.offset_90|, t1Thread1of1ForFork1_#t~nondet39#1=|v_t1Thread1of1ForFork1_#t~nondet39#1_78|, t1Thread1of1ForFork1_push_~stack#1.base=|v_t1Thread1of1ForFork1_push_~stack#1.base_90|, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|, t1Thread1of1ForFork1_push_#t~nondet33#1=|v_t1Thread1of1ForFork1_push_#t~nondet33#1_61|, ~#arr~0.base=|v_~#arr~0.base_81|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_293|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_push_~x#1, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, t1Thread1of1ForFork1_push_#t~ret34#1, t1Thread1of1ForFork1_push_#in~stack#1.base, t1Thread1of1ForFork1_push_#in~stack#1.offset, t1Thread1of1ForFork1_push_#in~x#1, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_#t~nondet40#1, t1Thread1of1ForFork1_get_top_#res#1, t1Thread1of1ForFork1_~tmp~0#1, #memory_int, t1Thread1of1ForFork1_push_~stack#1.offset, t1Thread1of1ForFork1_#t~nondet39#1, t1Thread1of1ForFork1_push_~stack#1.base, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1, t1Thread1of1ForFork1_push_#t~nondet33#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] and [579] L1022-4-->L1023-1: Formula: (= |v_ULTIMATE.start_main_#t~mem49#1_16| (select (select |v_#memory_int_99| |v_ULTIMATE.start_main_~#id1~0#1.base_17|) |v_ULTIMATE.start_main_~#id1~0#1.offset_17|)) InVars {#memory_int=|v_#memory_int_99|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_17|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_17|} OutVars{ULTIMATE.start_main_#t~mem49#1=|v_ULTIMATE.start_main_#t~mem49#1_16|, ULTIMATE.start_main_#t~nondet48#1=|v_ULTIMATE.start_main_#t~nondet48#1_13|, #memory_int=|v_#memory_int_99|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_23|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_17|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem49#1, ULTIMATE.start_main_#t~nondet48#1, ULTIMATE.start_main_#t~pre47#1] [2022-12-06 04:10:27,316 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [624] L991-6-->L945: Formula: (let ((.cse0 (select |v_#pthreadsMutex_391| |v_~#m~0.base_182|)) (.cse1 (mod |v_t1Thread1of1ForFork1_~tmp~0#1_91| 4294967296))) (and (= (select .cse0 |v_~#m~0.offset_182|) 0) (= (store |v_#pthreadsMutex_391| |v_~#m~0.base_182| (store .cse0 |v_~#m~0.offset_182| 1)) |v_#pthreadsMutex_390|) (= |v_~#arr~0.base_81| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68| |v_t1Thread1of1ForFork1_push_~stack#1.offset_90|) (= |v_t1Thread1of1ForFork1_get_top_#res#1_86| v_~top~0_404) (not (= 400 v_~top~0_404)) (< |v_t1Thread1of1ForFork1_~i~0#1_128| 400) (= |v_t1Thread1of1ForFork1_#t~nondet40#1_109| |v_t1Thread1of1ForFork1_~tmp~0#1_91|) (<= 0 (+ |v_t1Thread1of1ForFork1_get_top_#res#1_86| 2147483648)) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82| |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|) (= |v_t1Thread1of1ForFork1_push_~x#1_90| |v_t1Thread1of1ForFork1_push_#in~x#1_68|) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82| (ite (< .cse1 400) 1 0)) (not (= |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90| 0)) (= (store |v_#memory_int_165| |v_t1Thread1of1ForFork1_push_~stack#1.base_90| (store (select |v_#memory_int_165| |v_t1Thread1of1ForFork1_push_~stack#1.base_90|) (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_86| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_90|) |v_t1Thread1of1ForFork1_push_~x#1_90|)) |v_#memory_int_164|) (<= |v_t1Thread1of1ForFork1_get_top_#res#1_86| 2147483647) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68| |v_~#arr~0.offset_76|) (= (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) |v_t1Thread1of1ForFork1_push_#in~x#1_68|) (= |v_t1Thread1of1ForFork1_push_~stack#1.base_90| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_391|, ~#arr~0.offset=|v_~#arr~0.offset_76|, ~#m~0.base=|v_~#m~0.base_182|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_128|, ~#m~0.offset=|v_~#m~0.offset_182|, #memory_int=|v_#memory_int_165|, ~top~0=v_~top~0_404, ~#arr~0.base=|v_~#arr~0.base_81|, t1Thread1of1ForFork1_#t~nondet40#1=|v_t1Thread1of1ForFork1_#t~nondet40#1_109|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_390|, ~#arr~0.offset=|v_~#arr~0.offset_76|, t1Thread1of1ForFork1_push_~x#1=|v_t1Thread1of1ForFork1_push_~x#1_90|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_128|, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82|, t1Thread1of1ForFork1_push_#t~ret34#1=|v_t1Thread1of1ForFork1_push_#t~ret34#1_108|, t1Thread1of1ForFork1_push_#in~stack#1.base=|v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|, t1Thread1of1ForFork1_push_#in~stack#1.offset=|v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68|, ~top~0=v_~top~0_404, t1Thread1of1ForFork1_push_#in~x#1=|v_t1Thread1of1ForFork1_push_#in~x#1_68|, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_160|, t1Thread1of1ForFork1_get_top_#res#1=|v_t1Thread1of1ForFork1_get_top_#res#1_86|, ~#m~0.base=|v_~#m~0.base_182|, ~#m~0.offset=|v_~#m~0.offset_182|, t1Thread1of1ForFork1_~tmp~0#1=|v_t1Thread1of1ForFork1_~tmp~0#1_91|, #memory_int=|v_#memory_int_164|, t1Thread1of1ForFork1_push_~stack#1.offset=|v_t1Thread1of1ForFork1_push_~stack#1.offset_90|, t1Thread1of1ForFork1_#t~nondet39#1=|v_t1Thread1of1ForFork1_#t~nondet39#1_78|, t1Thread1of1ForFork1_push_~stack#1.base=|v_t1Thread1of1ForFork1_push_~stack#1.base_90|, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|, t1Thread1of1ForFork1_push_#t~nondet33#1=|v_t1Thread1of1ForFork1_push_#t~nondet33#1_61|, ~#arr~0.base=|v_~#arr~0.base_81|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_293|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_push_~x#1, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, t1Thread1of1ForFork1_push_#t~ret34#1, t1Thread1of1ForFork1_push_#in~stack#1.base, t1Thread1of1ForFork1_push_#in~stack#1.offset, t1Thread1of1ForFork1_push_#in~x#1, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_#t~nondet40#1, t1Thread1of1ForFork1_get_top_#res#1, t1Thread1of1ForFork1_~tmp~0#1, #memory_int, t1Thread1of1ForFork1_push_~stack#1.offset, t1Thread1of1ForFork1_#t~nondet39#1, t1Thread1of1ForFork1_push_~stack#1.base, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1, t1Thread1of1ForFork1_push_#t~nondet33#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] and [592] L1005-6-->t2EXIT: Formula: (and (not (< |v_t2Thread1of1ForFork0_~i~1#1_In_2| 400)) (= |v_t2Thread1of1ForFork0_#res#1.base_Out_4| 0) (= |v_t2Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {t2Thread1of1ForFork0_~i~1#1=|v_t2Thread1of1ForFork0_~i~1#1_In_2|} OutVars{t2Thread1of1ForFork0_~i~1#1=|v_t2Thread1of1ForFork0_~i~1#1_In_2|, t2Thread1of1ForFork0_#res#1.base=|v_t2Thread1of1ForFork0_#res#1.base_Out_4|, t2Thread1of1ForFork0_#res#1.offset=|v_t2Thread1of1ForFork0_#res#1.offset_Out_4|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_#res#1.base, t2Thread1of1ForFork0_#res#1.offset] [2022-12-06 04:10:27,926 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [624] L991-6-->L945: Formula: (let ((.cse0 (select |v_#pthreadsMutex_391| |v_~#m~0.base_182|)) (.cse1 (mod |v_t1Thread1of1ForFork1_~tmp~0#1_91| 4294967296))) (and (= (select .cse0 |v_~#m~0.offset_182|) 0) (= (store |v_#pthreadsMutex_391| |v_~#m~0.base_182| (store .cse0 |v_~#m~0.offset_182| 1)) |v_#pthreadsMutex_390|) (= |v_~#arr~0.base_81| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68| |v_t1Thread1of1ForFork1_push_~stack#1.offset_90|) (= |v_t1Thread1of1ForFork1_get_top_#res#1_86| v_~top~0_404) (not (= 400 v_~top~0_404)) (< |v_t1Thread1of1ForFork1_~i~0#1_128| 400) (= |v_t1Thread1of1ForFork1_#t~nondet40#1_109| |v_t1Thread1of1ForFork1_~tmp~0#1_91|) (<= 0 (+ |v_t1Thread1of1ForFork1_get_top_#res#1_86| 2147483648)) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82| |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|) (= |v_t1Thread1of1ForFork1_push_~x#1_90| |v_t1Thread1of1ForFork1_push_#in~x#1_68|) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82| (ite (< .cse1 400) 1 0)) (not (= |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90| 0)) (= (store |v_#memory_int_165| |v_t1Thread1of1ForFork1_push_~stack#1.base_90| (store (select |v_#memory_int_165| |v_t1Thread1of1ForFork1_push_~stack#1.base_90|) (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_86| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_90|) |v_t1Thread1of1ForFork1_push_~x#1_90|)) |v_#memory_int_164|) (<= |v_t1Thread1of1ForFork1_get_top_#res#1_86| 2147483647) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68| |v_~#arr~0.offset_76|) (= (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) |v_t1Thread1of1ForFork1_push_#in~x#1_68|) (= |v_t1Thread1of1ForFork1_push_~stack#1.base_90| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_391|, ~#arr~0.offset=|v_~#arr~0.offset_76|, ~#m~0.base=|v_~#m~0.base_182|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_128|, ~#m~0.offset=|v_~#m~0.offset_182|, #memory_int=|v_#memory_int_165|, ~top~0=v_~top~0_404, ~#arr~0.base=|v_~#arr~0.base_81|, t1Thread1of1ForFork1_#t~nondet40#1=|v_t1Thread1of1ForFork1_#t~nondet40#1_109|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_390|, ~#arr~0.offset=|v_~#arr~0.offset_76|, t1Thread1of1ForFork1_push_~x#1=|v_t1Thread1of1ForFork1_push_~x#1_90|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_128|, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82|, t1Thread1of1ForFork1_push_#t~ret34#1=|v_t1Thread1of1ForFork1_push_#t~ret34#1_108|, t1Thread1of1ForFork1_push_#in~stack#1.base=|v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|, t1Thread1of1ForFork1_push_#in~stack#1.offset=|v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68|, ~top~0=v_~top~0_404, t1Thread1of1ForFork1_push_#in~x#1=|v_t1Thread1of1ForFork1_push_#in~x#1_68|, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_160|, t1Thread1of1ForFork1_get_top_#res#1=|v_t1Thread1of1ForFork1_get_top_#res#1_86|, ~#m~0.base=|v_~#m~0.base_182|, ~#m~0.offset=|v_~#m~0.offset_182|, t1Thread1of1ForFork1_~tmp~0#1=|v_t1Thread1of1ForFork1_~tmp~0#1_91|, #memory_int=|v_#memory_int_164|, t1Thread1of1ForFork1_push_~stack#1.offset=|v_t1Thread1of1ForFork1_push_~stack#1.offset_90|, t1Thread1of1ForFork1_#t~nondet39#1=|v_t1Thread1of1ForFork1_#t~nondet39#1_78|, t1Thread1of1ForFork1_push_~stack#1.base=|v_t1Thread1of1ForFork1_push_~stack#1.base_90|, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|, t1Thread1of1ForFork1_push_#t~nondet33#1=|v_t1Thread1of1ForFork1_push_#t~nondet33#1_61|, ~#arr~0.base=|v_~#arr~0.base_81|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_293|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_push_~x#1, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, t1Thread1of1ForFork1_push_#t~ret34#1, t1Thread1of1ForFork1_push_#in~stack#1.base, t1Thread1of1ForFork1_push_#in~stack#1.offset, t1Thread1of1ForFork1_push_#in~x#1, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_#t~nondet40#1, t1Thread1of1ForFork1_get_top_#res#1, t1Thread1of1ForFork1_~tmp~0#1, #memory_int, t1Thread1of1ForFork1_push_~stack#1.offset, t1Thread1of1ForFork1_#t~nondet39#1, t1Thread1of1ForFork1_push_~stack#1.base, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1, t1Thread1of1ForFork1_push_#t~nondet33#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] and [579] L1022-4-->L1023-1: Formula: (= |v_ULTIMATE.start_main_#t~mem49#1_16| (select (select |v_#memory_int_99| |v_ULTIMATE.start_main_~#id1~0#1.base_17|) |v_ULTIMATE.start_main_~#id1~0#1.offset_17|)) InVars {#memory_int=|v_#memory_int_99|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_17|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_17|} OutVars{ULTIMATE.start_main_#t~mem49#1=|v_ULTIMATE.start_main_#t~mem49#1_16|, ULTIMATE.start_main_#t~nondet48#1=|v_ULTIMATE.start_main_#t~nondet48#1_13|, #memory_int=|v_#memory_int_99|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_23|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_17|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem49#1, ULTIMATE.start_main_#t~nondet48#1, ULTIMATE.start_main_#t~pre47#1] [2022-12-06 04:10:28,243 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [624] L991-6-->L945: Formula: (let ((.cse0 (select |v_#pthreadsMutex_391| |v_~#m~0.base_182|)) (.cse1 (mod |v_t1Thread1of1ForFork1_~tmp~0#1_91| 4294967296))) (and (= (select .cse0 |v_~#m~0.offset_182|) 0) (= (store |v_#pthreadsMutex_391| |v_~#m~0.base_182| (store .cse0 |v_~#m~0.offset_182| 1)) |v_#pthreadsMutex_390|) (= |v_~#arr~0.base_81| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68| |v_t1Thread1of1ForFork1_push_~stack#1.offset_90|) (= |v_t1Thread1of1ForFork1_get_top_#res#1_86| v_~top~0_404) (not (= 400 v_~top~0_404)) (< |v_t1Thread1of1ForFork1_~i~0#1_128| 400) (= |v_t1Thread1of1ForFork1_#t~nondet40#1_109| |v_t1Thread1of1ForFork1_~tmp~0#1_91|) (<= 0 (+ |v_t1Thread1of1ForFork1_get_top_#res#1_86| 2147483648)) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82| |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|) (= |v_t1Thread1of1ForFork1_push_~x#1_90| |v_t1Thread1of1ForFork1_push_#in~x#1_68|) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82| (ite (< .cse1 400) 1 0)) (not (= |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90| 0)) (= (store |v_#memory_int_165| |v_t1Thread1of1ForFork1_push_~stack#1.base_90| (store (select |v_#memory_int_165| |v_t1Thread1of1ForFork1_push_~stack#1.base_90|) (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_86| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_90|) |v_t1Thread1of1ForFork1_push_~x#1_90|)) |v_#memory_int_164|) (<= |v_t1Thread1of1ForFork1_get_top_#res#1_86| 2147483647) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68| |v_~#arr~0.offset_76|) (= (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) |v_t1Thread1of1ForFork1_push_#in~x#1_68|) (= |v_t1Thread1of1ForFork1_push_~stack#1.base_90| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_391|, ~#arr~0.offset=|v_~#arr~0.offset_76|, ~#m~0.base=|v_~#m~0.base_182|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_128|, ~#m~0.offset=|v_~#m~0.offset_182|, #memory_int=|v_#memory_int_165|, ~top~0=v_~top~0_404, ~#arr~0.base=|v_~#arr~0.base_81|, t1Thread1of1ForFork1_#t~nondet40#1=|v_t1Thread1of1ForFork1_#t~nondet40#1_109|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_390|, ~#arr~0.offset=|v_~#arr~0.offset_76|, t1Thread1of1ForFork1_push_~x#1=|v_t1Thread1of1ForFork1_push_~x#1_90|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_128|, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82|, t1Thread1of1ForFork1_push_#t~ret34#1=|v_t1Thread1of1ForFork1_push_#t~ret34#1_108|, t1Thread1of1ForFork1_push_#in~stack#1.base=|v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|, t1Thread1of1ForFork1_push_#in~stack#1.offset=|v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68|, ~top~0=v_~top~0_404, t1Thread1of1ForFork1_push_#in~x#1=|v_t1Thread1of1ForFork1_push_#in~x#1_68|, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_160|, t1Thread1of1ForFork1_get_top_#res#1=|v_t1Thread1of1ForFork1_get_top_#res#1_86|, ~#m~0.base=|v_~#m~0.base_182|, ~#m~0.offset=|v_~#m~0.offset_182|, t1Thread1of1ForFork1_~tmp~0#1=|v_t1Thread1of1ForFork1_~tmp~0#1_91|, #memory_int=|v_#memory_int_164|, t1Thread1of1ForFork1_push_~stack#1.offset=|v_t1Thread1of1ForFork1_push_~stack#1.offset_90|, t1Thread1of1ForFork1_#t~nondet39#1=|v_t1Thread1of1ForFork1_#t~nondet39#1_78|, t1Thread1of1ForFork1_push_~stack#1.base=|v_t1Thread1of1ForFork1_push_~stack#1.base_90|, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|, t1Thread1of1ForFork1_push_#t~nondet33#1=|v_t1Thread1of1ForFork1_push_#t~nondet33#1_61|, ~#arr~0.base=|v_~#arr~0.base_81|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_293|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_push_~x#1, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, t1Thread1of1ForFork1_push_#t~ret34#1, t1Thread1of1ForFork1_push_#in~stack#1.base, t1Thread1of1ForFork1_push_#in~stack#1.offset, t1Thread1of1ForFork1_push_#in~x#1, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_#t~nondet40#1, t1Thread1of1ForFork1_get_top_#res#1, t1Thread1of1ForFork1_~tmp~0#1, #memory_int, t1Thread1of1ForFork1_push_~stack#1.offset, t1Thread1of1ForFork1_#t~nondet39#1, t1Thread1of1ForFork1_push_~stack#1.base, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1, t1Thread1of1ForFork1_push_#t~nondet33#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] and [579] L1022-4-->L1023-1: Formula: (= |v_ULTIMATE.start_main_#t~mem49#1_16| (select (select |v_#memory_int_99| |v_ULTIMATE.start_main_~#id1~0#1.base_17|) |v_ULTIMATE.start_main_~#id1~0#1.offset_17|)) InVars {#memory_int=|v_#memory_int_99|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_17|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_17|} OutVars{ULTIMATE.start_main_#t~mem49#1=|v_ULTIMATE.start_main_#t~mem49#1_16|, ULTIMATE.start_main_#t~nondet48#1=|v_ULTIMATE.start_main_#t~nondet48#1_13|, #memory_int=|v_#memory_int_99|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_23|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_17|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem49#1, ULTIMATE.start_main_#t~nondet48#1, ULTIMATE.start_main_#t~pre47#1] [2022-12-06 04:10:28,654 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [624] L991-6-->L945: Formula: (let ((.cse0 (select |v_#pthreadsMutex_391| |v_~#m~0.base_182|)) (.cse1 (mod |v_t1Thread1of1ForFork1_~tmp~0#1_91| 4294967296))) (and (= (select .cse0 |v_~#m~0.offset_182|) 0) (= (store |v_#pthreadsMutex_391| |v_~#m~0.base_182| (store .cse0 |v_~#m~0.offset_182| 1)) |v_#pthreadsMutex_390|) (= |v_~#arr~0.base_81| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68| |v_t1Thread1of1ForFork1_push_~stack#1.offset_90|) (= |v_t1Thread1of1ForFork1_get_top_#res#1_86| v_~top~0_404) (not (= 400 v_~top~0_404)) (< |v_t1Thread1of1ForFork1_~i~0#1_128| 400) (= |v_t1Thread1of1ForFork1_#t~nondet40#1_109| |v_t1Thread1of1ForFork1_~tmp~0#1_91|) (<= 0 (+ |v_t1Thread1of1ForFork1_get_top_#res#1_86| 2147483648)) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82| |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|) (= |v_t1Thread1of1ForFork1_push_~x#1_90| |v_t1Thread1of1ForFork1_push_#in~x#1_68|) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82| (ite (< .cse1 400) 1 0)) (not (= |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90| 0)) (= (store |v_#memory_int_165| |v_t1Thread1of1ForFork1_push_~stack#1.base_90| (store (select |v_#memory_int_165| |v_t1Thread1of1ForFork1_push_~stack#1.base_90|) (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_86| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_90|) |v_t1Thread1of1ForFork1_push_~x#1_90|)) |v_#memory_int_164|) (<= |v_t1Thread1of1ForFork1_get_top_#res#1_86| 2147483647) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68| |v_~#arr~0.offset_76|) (= (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) |v_t1Thread1of1ForFork1_push_#in~x#1_68|) (= |v_t1Thread1of1ForFork1_push_~stack#1.base_90| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_391|, ~#arr~0.offset=|v_~#arr~0.offset_76|, ~#m~0.base=|v_~#m~0.base_182|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_128|, ~#m~0.offset=|v_~#m~0.offset_182|, #memory_int=|v_#memory_int_165|, ~top~0=v_~top~0_404, ~#arr~0.base=|v_~#arr~0.base_81|, t1Thread1of1ForFork1_#t~nondet40#1=|v_t1Thread1of1ForFork1_#t~nondet40#1_109|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_390|, ~#arr~0.offset=|v_~#arr~0.offset_76|, t1Thread1of1ForFork1_push_~x#1=|v_t1Thread1of1ForFork1_push_~x#1_90|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_128|, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82|, t1Thread1of1ForFork1_push_#t~ret34#1=|v_t1Thread1of1ForFork1_push_#t~ret34#1_108|, t1Thread1of1ForFork1_push_#in~stack#1.base=|v_t1Thread1of1ForFork1_push_#in~stack#1.base_68|, t1Thread1of1ForFork1_push_#in~stack#1.offset=|v_t1Thread1of1ForFork1_push_#in~stack#1.offset_68|, ~top~0=v_~top~0_404, t1Thread1of1ForFork1_push_#in~x#1=|v_t1Thread1of1ForFork1_push_#in~x#1_68|, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_160|, t1Thread1of1ForFork1_get_top_#res#1=|v_t1Thread1of1ForFork1_get_top_#res#1_86|, ~#m~0.base=|v_~#m~0.base_182|, ~#m~0.offset=|v_~#m~0.offset_182|, t1Thread1of1ForFork1_~tmp~0#1=|v_t1Thread1of1ForFork1_~tmp~0#1_91|, #memory_int=|v_#memory_int_164|, t1Thread1of1ForFork1_push_~stack#1.offset=|v_t1Thread1of1ForFork1_push_~stack#1.offset_90|, t1Thread1of1ForFork1_#t~nondet39#1=|v_t1Thread1of1ForFork1_#t~nondet39#1_78|, t1Thread1of1ForFork1_push_~stack#1.base=|v_t1Thread1of1ForFork1_push_~stack#1.base_90|, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|, t1Thread1of1ForFork1_push_#t~nondet33#1=|v_t1Thread1of1ForFork1_push_#t~nondet33#1_61|, ~#arr~0.base=|v_~#arr~0.base_81|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_293|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_push_~x#1, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, t1Thread1of1ForFork1_push_#t~ret34#1, t1Thread1of1ForFork1_push_#in~stack#1.base, t1Thread1of1ForFork1_push_#in~stack#1.offset, t1Thread1of1ForFork1_push_#in~x#1, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_#t~nondet40#1, t1Thread1of1ForFork1_get_top_#res#1, t1Thread1of1ForFork1_~tmp~0#1, #memory_int, t1Thread1of1ForFork1_push_~stack#1.offset, t1Thread1of1ForFork1_#t~nondet39#1, t1Thread1of1ForFork1_push_~stack#1.base, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1, t1Thread1of1ForFork1_push_#t~nondet33#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] and [592] L1005-6-->t2EXIT: Formula: (and (not (< |v_t2Thread1of1ForFork0_~i~1#1_In_2| 400)) (= |v_t2Thread1of1ForFork0_#res#1.base_Out_4| 0) (= |v_t2Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {t2Thread1of1ForFork0_~i~1#1=|v_t2Thread1of1ForFork0_~i~1#1_In_2|} OutVars{t2Thread1of1ForFork0_~i~1#1=|v_t2Thread1of1ForFork0_~i~1#1_In_2|, t2Thread1of1ForFork0_#res#1.base=|v_t2Thread1of1ForFork0_#res#1.base_Out_4|, t2Thread1of1ForFork0_#res#1.offset=|v_t2Thread1of1ForFork0_#res#1.offset_Out_4|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_#res#1.base, t2Thread1of1ForFork0_#res#1.offset] [2022-12-06 04:10:29,193 INFO L203 LiptonReduction]: Total number of compositions: 15 [2022-12-06 04:10:29,194 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24726 [2022-12-06 04:10:29,194 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 2545 transitions, 52552 flow [2022-12-06 04:10:29,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:29,195 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:29,195 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:29,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 04:10:29,403 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,SelfDestructingSolverStorable12 [2022-12-06 04:10:29,403 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:29,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:29,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1956994740, now seen corresponding path program 1 times [2022-12-06 04:10:29,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:29,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678187226] [2022-12-06 04:10:29,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:29,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:29,513 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:29,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:29,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678187226] [2022-12-06 04:10:29,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678187226] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:10:29,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918580839] [2022-12-06 04:10:29,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:29,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:10:29,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:10:29,515 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 04:10:29,517 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 04:10:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:29,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 04:10:29,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:10:29,641 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:29,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:10:29,720 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:29,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918580839] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:10:29,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:10:29,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-12-06 04:10:29,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746107605] [2022-12-06 04:10:29,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:10:29,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 04:10:29,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:29,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 04:10:29,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2022-12-06 04:10:29,722 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 102 [2022-12-06 04:10:29,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 2545 transitions, 52552 flow. Second operand has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:29,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:29,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 102 [2022-12-06 04:10:29,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:23,570 INFO L130 PetriNetUnfolder]: 41933/84412 cut-off events. [2022-12-06 04:11:23,570 INFO L131 PetriNetUnfolder]: For 14839850/14839850 co-relation queries the response was YES. [2022-12-06 04:11:26,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1225033 conditions, 84412 events. 41933/84412 cut-off events. For 14839850/14839850 co-relation queries the response was YES. Maximal size of possible extension queue 3366. Compared 924713 event pairs, 8092 based on Foata normal form. 642/85054 useless extension candidates. Maximal degree in co-relation 1195782. Up to 23532 conditions per place. [2022-12-06 04:11:26,507 INFO L137 encePairwiseOnDemand]: 31/102 looper letters, 1499 selfloop transitions, 2521 changer transitions 143/4165 dead transitions. [2022-12-06 04:11:26,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 4165 transitions, 89239 flow [2022-12-06 04:11:26,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-06 04:11:26,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-06 04:11:26,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 496 transitions. [2022-12-06 04:11:26,509 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1870286576168929 [2022-12-06 04:11:26,509 INFO L175 Difference]: Start difference. First operand has 332 places, 2545 transitions, 52552 flow. Second operand 26 states and 496 transitions. [2022-12-06 04:11:26,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 4165 transitions, 89239 flow [2022-12-06 04:12:54,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 4165 transitions, 87177 flow, removed 1013 selfloop flow, removed 7 redundant places. [2022-12-06 04:12:54,842 INFO L231 Difference]: Finished difference. Result has 362 places, 3129 transitions, 72699 flow [2022-12-06 04:12:54,844 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=50632, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1967, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=72699, PETRI_PLACES=362, PETRI_TRANSITIONS=3129} [2022-12-06 04:12:54,844 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 320 predicate places. [2022-12-06 04:12:54,844 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:12:54,844 INFO L89 Accepts]: Start accepts. Operand has 362 places, 3129 transitions, 72699 flow [2022-12-06 04:12:54,857 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:12:54,857 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:12:54,857 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 362 places, 3129 transitions, 72699 flow [2022-12-06 04:12:54,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 360 places, 3129 transitions, 72699 flow