/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack_longer-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:15:25,381 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:15:25,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:15:25,490 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:15:25,490 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:15:25,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:15:25,496 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:15:25,500 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:15:25,505 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:15:25,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:15:25,511 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:15:25,513 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:15:25,513 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:15:25,529 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:15:25,530 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:15:25,532 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:15:25,532 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:15:25,533 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:15:25,536 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:15:25,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:15:25,542 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:15:25,543 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:15:25,543 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:15:25,544 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:15:25,551 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:15:25,551 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:15:25,567 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:15:25,570 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:15:25,571 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:15:25,572 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:15:25,572 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:15:25,574 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:15:25,575 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:15:25,576 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:15:25,576 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:15:25,577 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:15:25,577 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:15:25,577 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:15:25,578 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:15:25,578 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:15:25,579 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:15:25,580 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:15:25,636 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:15:25,636 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:15:25,638 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:15:25,638 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:15:25,638 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:15:25,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:15:25,639 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:15:25,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:15:25,639 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:15:25,639 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:15:25,640 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:15:25,640 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:15:25,640 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:15:25,640 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:15:25,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:15:25,640 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:15:25,640 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:15:25,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:15:25,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:15:25,641 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:15:25,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:15:25,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:15:25,641 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:15:25,641 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:15:25,641 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:15:25,641 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:15:25,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:15:25,642 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:15:25,642 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 06:15:26,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:15:26,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:15:26,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:15:26,270 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:15:26,270 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:15:26,271 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 06:15:27,485 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:15:27,822 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:15:27,822 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-2.i [2022-12-06 06:15:27,844 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57364ba05/e6cb07418009447d9d5a34a70424adcc/FLAGa93f84803 [2022-12-06 06:15:27,856 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57364ba05/e6cb07418009447d9d5a34a70424adcc [2022-12-06 06:15:27,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:15:27,860 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:15:27,861 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:15:27,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:15:27,864 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:15:27,865 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:15:27" (1/1) ... [2022-12-06 06:15:27,866 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fd6be5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:27, skipping insertion in model container [2022-12-06 06:15:27,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:15:27" (1/1) ... [2022-12-06 06:15:27,871 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:15:27,927 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:15:28,295 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 06:15:28,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:15:28,332 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:15:28,368 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 06:15:28,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:15:28,442 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:15:28,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:28 WrapperNode [2022-12-06 06:15:28,442 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:15:28,443 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:15:28,443 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:15:28,445 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:15:28,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:28" (1/1) ... [2022-12-06 06:15:28,480 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:28" (1/1) ... [2022-12-06 06:15:28,509 INFO L138 Inliner]: procedures = 277, calls = 38, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 148 [2022-12-06 06:15:28,509 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:15:28,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:15:28,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:15:28,512 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:15:28,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:28" (1/1) ... [2022-12-06 06:15:28,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:28" (1/1) ... [2022-12-06 06:15:28,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:28" (1/1) ... [2022-12-06 06:15:28,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:28" (1/1) ... [2022-12-06 06:15:28,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:28" (1/1) ... [2022-12-06 06:15:28,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:28" (1/1) ... [2022-12-06 06:15:28,544 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:28" (1/1) ... [2022-12-06 06:15:28,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:28" (1/1) ... [2022-12-06 06:15:28,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:15:28,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:15:28,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:15:28,557 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:15:28,557 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:28" (1/1) ... [2022-12-06 06:15:28,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:15:28,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:15:28,584 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 06:15:28,603 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 06:15:28,624 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-06 06:15:28,625 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-06 06:15:28,626 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-06 06:15:28,626 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-06 06:15:28,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:15:28,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:15:28,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 06:15:28,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:15:28,626 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 06:15:28,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:15:28,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:15:28,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:15:28,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:15:28,628 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 06:15:28,813 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:15:28,815 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:15:29,065 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:15:29,076 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:15:29,076 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 06:15:29,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:15:29 BoogieIcfgContainer [2022-12-06 06:15:29,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:15:29,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:15:29,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:15:29,096 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:15:29,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:15:27" (1/3) ... [2022-12-06 06:15:29,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d09ce9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:15:29, skipping insertion in model container [2022-12-06 06:15:29,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:28" (2/3) ... [2022-12-06 06:15:29,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d09ce9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:15:29, skipping insertion in model container [2022-12-06 06:15:29,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:15:29" (3/3) ... [2022-12-06 06:15:29,099 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longer-2.i [2022-12-06 06:15:29,113 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:15:29,113 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:15:29,113 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:15:29,167 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 06:15:29,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 150 transitions, 316 flow [2022-12-06 06:15:29,232 INFO L130 PetriNetUnfolder]: 10/148 cut-off events. [2022-12-06 06:15:29,233 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 06:15:29,237 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 06:15:29,238 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 150 transitions, 316 flow [2022-12-06 06:15:29,241 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 139 transitions, 287 flow [2022-12-06 06:15:29,242 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:29,255 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 139 transitions, 287 flow [2022-12-06 06:15:29,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 139 transitions, 287 flow [2022-12-06 06:15:29,305 INFO L130 PetriNetUnfolder]: 10/139 cut-off events. [2022-12-06 06:15:29,305 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 06:15:29,306 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 06:15:29,310 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 139 transitions, 287 flow [2022-12-06 06:15:29,310 INFO L188 LiptonReduction]: Number of co-enabled transitions 6382 [2022-12-06 06:15:32,702 INFO L203 LiptonReduction]: Total number of compositions: 109 [2022-12-06 06:15:32,714 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:15:32,719 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;@1634a1f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:15:32,720 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:15:32,723 INFO L130 PetriNetUnfolder]: 1/18 cut-off events. [2022-12-06 06:15:32,723 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 06:15:32,723 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:32,724 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-06 06:15:32,724 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 06:15:32,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:32,728 INFO L85 PathProgramCache]: Analyzing trace with hash 973860878, now seen corresponding path program 1 times [2022-12-06 06:15:32,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:32,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584414672] [2022-12-06 06:15:32,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:32,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:32,987 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 06:15:32,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:32,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584414672] [2022-12-06 06:15:32,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584414672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:32,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:32,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:15:32,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636279965] [2022-12-06 06:15:32,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:32,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:15:32,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:33,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:15:33,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:15:33,022 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 40 [2022-12-06 06:15:33,024 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 06:15:33,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:33,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 40 [2022-12-06 06:15:33,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:33,251 INFO L130 PetriNetUnfolder]: 828/1410 cut-off events. [2022-12-06 06:15:33,251 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-12-06 06:15:33,255 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 06:15:33,263 INFO L137 encePairwiseOnDemand]: 33/40 looper letters, 55 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2022-12-06 06:15:33,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 61 transitions, 253 flow [2022-12-06 06:15:33,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:15:33,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:15:33,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-06 06:15:33,274 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2022-12-06 06:15:33,276 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 89 flow. Second operand 3 states and 73 transitions. [2022-12-06 06:15:33,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 61 transitions, 253 flow [2022-12-06 06:15:33,280 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 06:15:33,283 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 97 flow [2022-12-06 06:15:33,284 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 06:15:33,289 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2022-12-06 06:15:33,289 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:33,290 INFO L89 Accepts]: Start accepts. Operand has 40 places, 39 transitions, 97 flow [2022-12-06 06:15:33,292 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:33,292 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:33,292 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 39 transitions, 97 flow [2022-12-06 06:15:33,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 39 transitions, 97 flow [2022-12-06 06:15:33,331 INFO L130 PetriNetUnfolder]: 9/67 cut-off events. [2022-12-06 06:15:33,332 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:15:33,332 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 06:15:33,333 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 39 transitions, 97 flow [2022-12-06 06:15:33,333 INFO L188 LiptonReduction]: Number of co-enabled transitions 656 [2022-12-06 06:15:33,369 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:15:33,375 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 06:15:33,375 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 97 flow [2022-12-06 06:15:33,375 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 06:15:33,375 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:33,375 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:33,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:15:33,377 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 06:15:33,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:33,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1325177997, now seen corresponding path program 1 times [2022-12-06 06:15:33,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:33,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375488703] [2022-12-06 06:15:33,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:33,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:33,457 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 06:15:33,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:33,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375488703] [2022-12-06 06:15:33,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375488703] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:33,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:33,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:15:33,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224170110] [2022-12-06 06:15:33,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:33,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:15:33,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:33,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:15:33,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:15:33,460 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2022-12-06 06:15:33,460 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 06:15:33,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:33,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2022-12-06 06:15:33,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:33,601 INFO L130 PetriNetUnfolder]: 686/1260 cut-off events. [2022-12-06 06:15:33,601 INFO L131 PetriNetUnfolder]: For 111/111 co-relation queries the response was YES. [2022-12-06 06:15:33,604 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 06:15:33,608 INFO L137 encePairwiseOnDemand]: 35/38 looper letters, 48 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2022-12-06 06:15:33,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 57 transitions, 242 flow [2022-12-06 06:15:33,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:15:33,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:15:33,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-12-06 06:15:33,611 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6052631578947368 [2022-12-06 06:15:33,611 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 97 flow. Second operand 3 states and 69 transitions. [2022-12-06 06:15:33,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 57 transitions, 242 flow [2022-12-06 06:15:33,613 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 06:15:33,614 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 109 flow [2022-12-06 06:15:33,614 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 06:15:33,614 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2022-12-06 06:15:33,615 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:33,615 INFO L89 Accepts]: Start accepts. Operand has 42 places, 40 transitions, 109 flow [2022-12-06 06:15:33,615 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:33,616 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:33,616 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 40 transitions, 109 flow [2022-12-06 06:15:33,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 40 transitions, 109 flow [2022-12-06 06:15:33,624 INFO L130 PetriNetUnfolder]: 12/93 cut-off events. [2022-12-06 06:15:33,624 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 06:15:33,625 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 06:15:33,625 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 40 transitions, 109 flow [2022-12-06 06:15:33,625 INFO L188 LiptonReduction]: Number of co-enabled transitions 696 [2022-12-06 06:15:33,634 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:15:33,636 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 06:15:33,637 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 109 flow [2022-12-06 06:15:33,637 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 06:15:33,637 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:33,637 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:33,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:15:33,637 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 06:15:33,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:33,638 INFO L85 PathProgramCache]: Analyzing trace with hash 963601012, now seen corresponding path program 1 times [2022-12-06 06:15:33,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:33,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680059631] [2022-12-06 06:15:33,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:33,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:33,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:33,785 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 06:15:33,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:33,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680059631] [2022-12-06 06:15:33,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680059631] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:15:33,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548881128] [2022-12-06 06:15:33,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:33,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:15:33,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:15:33,803 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 06:15:34,107 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 06:15:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:34,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 06:15:34,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:15:34,201 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 06:15:34,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:15:34,242 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 06:15:34,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548881128] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:15:34,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:15:34,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-06 06:15:34,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426029852] [2022-12-06 06:15:34,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:15:34,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 06:15:34,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:34,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 06:15:34,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-06 06:15:34,244 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 38 [2022-12-06 06:15:34,244 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 06:15:34,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:34,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 38 [2022-12-06 06:15:34,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:34,849 INFO L130 PetriNetUnfolder]: 2004/3438 cut-off events. [2022-12-06 06:15:34,849 INFO L131 PetriNetUnfolder]: For 880/880 co-relation queries the response was YES. [2022-12-06 06:15:34,853 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 06:15:34,867 INFO L137 encePairwiseOnDemand]: 30/38 looper letters, 166 selfloop transitions, 26 changer transitions 5/200 dead transitions. [2022-12-06 06:15:34,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 200 transitions, 913 flow [2022-12-06 06:15:34,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 06:15:34,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 06:15:34,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 236 transitions. [2022-12-06 06:15:34,869 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5175438596491229 [2022-12-06 06:15:34,869 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 109 flow. Second operand 12 states and 236 transitions. [2022-12-06 06:15:34,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 200 transitions, 913 flow [2022-12-06 06:15:34,873 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 06:15:34,875 INFO L231 Difference]: Finished difference. Result has 60 places, 65 transitions, 321 flow [2022-12-06 06:15:34,875 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 06:15:34,876 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2022-12-06 06:15:34,876 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:34,876 INFO L89 Accepts]: Start accepts. Operand has 60 places, 65 transitions, 321 flow [2022-12-06 06:15:34,877 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:34,877 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:34,877 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 65 transitions, 321 flow [2022-12-06 06:15:34,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 65 transitions, 321 flow [2022-12-06 06:15:34,891 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 06:15:34,892 INFO L382 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-12-06 06:15:34,892 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-06 06:15:34,892 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 06:15:34,892 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-06 06:15:34,892 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 06:15:34,892 INFO L382 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-12-06 06:15:34,892 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-06 06:15:34,892 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 06:15:34,892 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-06 06:15:34,896 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 06:15:34,896 INFO L382 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-06 06:15:34,896 INFO L385 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-06 06:15:34,896 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-06 06:15:34,896 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-06 06:15:34,897 INFO L130 PetriNetUnfolder]: 72/329 cut-off events. [2022-12-06 06:15:34,898 INFO L131 PetriNetUnfolder]: For 320/331 co-relation queries the response was YES. [2022-12-06 06:15:34,899 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 06:15:34,901 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 65 transitions, 321 flow [2022-12-06 06:15:34,901 INFO L188 LiptonReduction]: Number of co-enabled transitions 1108 [2022-12-06 06:15:34,920 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 06:15:34,928 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 06:15:34,956 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 06:15:35,005 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 06:15:35,049 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 06:15:35,070 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 06:15:35,071 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-06 06:15:35,071 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 63 transitions, 344 flow [2022-12-06 06:15:35,071 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 06:15:35,071 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:35,071 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:35,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 06:15:35,277 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 06:15:35,278 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 06:15:35,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:35,278 INFO L85 PathProgramCache]: Analyzing trace with hash 657019038, now seen corresponding path program 1 times [2022-12-06 06:15:35,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:35,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344100386] [2022-12-06 06:15:35,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:35,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:35,311 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 06:15:35,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:35,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344100386] [2022-12-06 06:15:35,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344100386] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:35,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:35,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:15:35,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681068074] [2022-12-06 06:15:35,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:35,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 06:15:35,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:35,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 06:15:35,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 06:15:35,317 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 46 [2022-12-06 06:15:35,317 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 06:15:35,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:35,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 46 [2022-12-06 06:15:35,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:35,567 INFO L130 PetriNetUnfolder]: 1584/2898 cut-off events. [2022-12-06 06:15:35,568 INFO L131 PetriNetUnfolder]: For 2985/3014 co-relation queries the response was YES. [2022-12-06 06:15:35,578 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 06:15:35,596 INFO L137 encePairwiseOnDemand]: 45/46 looper letters, 51 selfloop transitions, 0 changer transitions 0/62 dead transitions. [2022-12-06 06:15:35,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 433 flow [2022-12-06 06:15:35,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 06:15:35,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 06:15:35,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2022-12-06 06:15:35,598 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2022-12-06 06:15:35,598 INFO L175 Difference]: Start difference. First operand has 58 places, 63 transitions, 344 flow. Second operand 2 states and 52 transitions. [2022-12-06 06:15:35,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 433 flow [2022-12-06 06:15:35,613 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 06:15:35,615 INFO L231 Difference]: Finished difference. Result has 56 places, 62 transitions, 304 flow [2022-12-06 06:15:35,616 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 06:15:35,617 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2022-12-06 06:15:35,617 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:35,617 INFO L89 Accepts]: Start accepts. Operand has 56 places, 62 transitions, 304 flow [2022-12-06 06:15:35,618 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:35,618 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:35,618 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 62 transitions, 304 flow [2022-12-06 06:15:35,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 62 transitions, 304 flow [2022-12-06 06:15:35,673 INFO L130 PetriNetUnfolder]: 63/316 cut-off events. [2022-12-06 06:15:35,674 INFO L131 PetriNetUnfolder]: For 246/259 co-relation queries the response was YES. [2022-12-06 06:15:35,675 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 06:15:35,679 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 62 transitions, 304 flow [2022-12-06 06:15:35,680 INFO L188 LiptonReduction]: Number of co-enabled transitions 1044 [2022-12-06 06:15:35,691 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 06:15:35,702 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:15:35,704 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 06:15:35,704 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 62 transitions, 308 flow [2022-12-06 06:15:35,704 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 06:15:35,705 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:35,705 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 06:15:35,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:15:35,705 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 06:15:35,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:35,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1498366853, now seen corresponding path program 1 times [2022-12-06 06:15:35,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:35,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286762988] [2022-12-06 06:15:35,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:35,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:35,851 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 06:15:35,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:35,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286762988] [2022-12-06 06:15:35,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286762988] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:35,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:35,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:15:35,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994345697] [2022-12-06 06:15:35,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:35,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:15:35,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:35,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:15:35,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:15:35,853 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 45 [2022-12-06 06:15:35,854 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 06:15:35,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:35,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 45 [2022-12-06 06:15:35,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:35,990 INFO L130 PetriNetUnfolder]: 552/1117 cut-off events. [2022-12-06 06:15:35,991 INFO L131 PetriNetUnfolder]: For 400/400 co-relation queries the response was YES. [2022-12-06 06:15:35,994 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 06:15:35,999 INFO L137 encePairwiseOnDemand]: 39/45 looper letters, 40 selfloop transitions, 6 changer transitions 3/60 dead transitions. [2022-12-06 06:15:35,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 60 transitions, 327 flow [2022-12-06 06:15:36,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:15:36,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:15:36,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-06 06:15:36,000 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4740740740740741 [2022-12-06 06:15:36,001 INFO L175 Difference]: Start difference. First operand has 55 places, 62 transitions, 308 flow. Second operand 3 states and 64 transitions. [2022-12-06 06:15:36,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 60 transitions, 327 flow [2022-12-06 06:15:36,005 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 06:15:36,007 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 210 flow [2022-12-06 06:15:36,007 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 06:15:36,009 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2022-12-06 06:15:36,010 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:36,010 INFO L89 Accepts]: Start accepts. Operand has 52 places, 48 transitions, 210 flow [2022-12-06 06:15:36,011 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:36,011 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:36,011 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 48 transitions, 210 flow [2022-12-06 06:15:36,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 48 transitions, 210 flow [2022-12-06 06:15:36,028 INFO L130 PetriNetUnfolder]: 17/142 cut-off events. [2022-12-06 06:15:36,028 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-12-06 06:15:36,028 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 06:15:36,030 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 48 transitions, 210 flow [2022-12-06 06:15:36,030 INFO L188 LiptonReduction]: Number of co-enabled transitions 436 [2022-12-06 06:15:37,564 INFO L203 LiptonReduction]: Total number of compositions: 12 [2022-12-06 06:15:37,565 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1555 [2022-12-06 06:15:37,565 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 238 flow [2022-12-06 06:15:37,565 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 06:15:37,566 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:37,566 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:37,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:15:37,566 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 06:15:37,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:37,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1348600435, now seen corresponding path program 1 times [2022-12-06 06:15:37,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:37,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481992357] [2022-12-06 06:15:37,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:37,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:38,020 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 06:15:38,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:38,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481992357] [2022-12-06 06:15:38,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481992357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:38,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:38,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:15:38,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393399268] [2022-12-06 06:15:38,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:38,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:15:38,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:38,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:15:38,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:15:38,023 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 40 [2022-12-06 06:15:38,023 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 06:15:38,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:38,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 40 [2022-12-06 06:15:38,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:38,446 INFO L130 PetriNetUnfolder]: 840/1600 cut-off events. [2022-12-06 06:15:38,447 INFO L131 PetriNetUnfolder]: For 1704/1704 co-relation queries the response was YES. [2022-12-06 06:15:38,451 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 06:15:38,458 INFO L137 encePairwiseOnDemand]: 31/40 looper letters, 94 selfloop transitions, 11 changer transitions 9/118 dead transitions. [2022-12-06 06:15:38,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 118 transitions, 858 flow [2022-12-06 06:15:38,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:15:38,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:15:38,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2022-12-06 06:15:38,460 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5541666666666667 [2022-12-06 06:15:38,460 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 238 flow. Second operand 6 states and 133 transitions. [2022-12-06 06:15:38,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 118 transitions, 858 flow [2022-12-06 06:15:38,464 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 06:15:38,466 INFO L231 Difference]: Finished difference. Result has 50 places, 51 transitions, 326 flow [2022-12-06 06:15:38,467 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 06:15:38,467 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2022-12-06 06:15:38,467 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:38,468 INFO L89 Accepts]: Start accepts. Operand has 50 places, 51 transitions, 326 flow [2022-12-06 06:15:38,468 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:38,468 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:38,469 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 51 transitions, 326 flow [2022-12-06 06:15:38,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 51 transitions, 326 flow [2022-12-06 06:15:38,492 INFO L130 PetriNetUnfolder]: 48/235 cut-off events. [2022-12-06 06:15:38,492 INFO L131 PetriNetUnfolder]: For 309/310 co-relation queries the response was YES. [2022-12-06 06:15:38,493 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 06:15:38,495 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 51 transitions, 326 flow [2022-12-06 06:15:38,495 INFO L188 LiptonReduction]: Number of co-enabled transitions 450 [2022-12-06 06:15:38,811 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 06:15:38,812 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 345 [2022-12-06 06:15:38,812 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 46 transitions, 324 flow [2022-12-06 06:15:38,812 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 06:15:38,812 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:38,813 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:38,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:15:38,813 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 06:15:38,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:38,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1603038933, now seen corresponding path program 1 times [2022-12-06 06:15:38,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:38,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629445301] [2022-12-06 06:15:38,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:38,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:39,234 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 06:15:39,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:39,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629445301] [2022-12-06 06:15:39,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629445301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:39,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:39,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:15:39,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117137584] [2022-12-06 06:15:39,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:39,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:15:39,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:39,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:15:39,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:15:39,237 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2022-12-06 06:15:39,237 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 06:15:39,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:39,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2022-12-06 06:15:39,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:39,555 INFO L130 PetriNetUnfolder]: 867/1668 cut-off events. [2022-12-06 06:15:39,555 INFO L131 PetriNetUnfolder]: For 2550/2550 co-relation queries the response was YES. [2022-12-06 06:15:39,559 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 06:15:39,563 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 72 selfloop transitions, 14 changer transitions 11/100 dead transitions. [2022-12-06 06:15:39,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 100 transitions, 771 flow [2022-12-06 06:15:39,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:15:39,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:15:39,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2022-12-06 06:15:39,565 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.527027027027027 [2022-12-06 06:15:39,565 INFO L175 Difference]: Start difference. First operand has 44 places, 46 transitions, 324 flow. Second operand 6 states and 117 transitions. [2022-12-06 06:15:39,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 100 transitions, 771 flow [2022-12-06 06:15:39,569 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 06:15:39,570 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 346 flow [2022-12-06 06:15:39,570 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 06:15:39,571 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2022-12-06 06:15:39,571 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:39,571 INFO L89 Accepts]: Start accepts. Operand has 51 places, 48 transitions, 346 flow [2022-12-06 06:15:39,571 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:39,571 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:39,572 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 48 transitions, 346 flow [2022-12-06 06:15:39,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 48 transitions, 346 flow [2022-12-06 06:15:39,591 INFO L130 PetriNetUnfolder]: 39/224 cut-off events. [2022-12-06 06:15:39,592 INFO L131 PetriNetUnfolder]: For 326/330 co-relation queries the response was YES. [2022-12-06 06:15:39,593 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 06:15:39,594 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 48 transitions, 346 flow [2022-12-06 06:15:39,594 INFO L188 LiptonReduction]: Number of co-enabled transitions 406 [2022-12-06 06:15:39,749 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:15:39,751 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 06:15:39,751 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 344 flow [2022-12-06 06:15:39,751 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 06:15:39,751 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:39,751 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:39,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:15:39,752 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 06:15:39,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:39,752 INFO L85 PathProgramCache]: Analyzing trace with hash 477676419, now seen corresponding path program 1 times [2022-12-06 06:15:39,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:39,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464581273] [2022-12-06 06:15:39,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:39,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:39,902 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 06:15:39,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:39,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464581273] [2022-12-06 06:15:39,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464581273] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:15:39,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913587797] [2022-12-06 06:15:39,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:39,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:15:39,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:15:39,920 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 06:15:39,926 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 06:15:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:40,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 06:15:40,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:15:40,043 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 06:15:40,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:15:40,079 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 06:15:40,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913587797] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:15:40,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:15:40,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-06 06:15:40,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824454775] [2022-12-06 06:15:40,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:15:40,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 06:15:40,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:40,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 06:15:40,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2022-12-06 06:15:40,081 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-06 06:15:40,082 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 06:15:40,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:40,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-06 06:15:40,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:40,526 INFO L130 PetriNetUnfolder]: 1348/2588 cut-off events. [2022-12-06 06:15:40,526 INFO L131 PetriNetUnfolder]: For 4417/4417 co-relation queries the response was YES. [2022-12-06 06:15:40,535 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 06:15:40,547 INFO L137 encePairwiseOnDemand]: 17/32 looper letters, 146 selfloop transitions, 50 changer transitions 4/202 dead transitions. [2022-12-06 06:15:40,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 202 transitions, 1443 flow [2022-12-06 06:15:40,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 06:15:40,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 06:15:40,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 218 transitions. [2022-12-06 06:15:40,550 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3784722222222222 [2022-12-06 06:15:40,550 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 344 flow. Second operand 18 states and 218 transitions. [2022-12-06 06:15:40,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 202 transitions, 1443 flow [2022-12-06 06:15:40,560 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 06:15:40,563 INFO L231 Difference]: Finished difference. Result has 73 places, 83 transitions, 806 flow [2022-12-06 06:15:40,563 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 06:15:40,565 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places. [2022-12-06 06:15:40,565 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:40,565 INFO L89 Accepts]: Start accepts. Operand has 73 places, 83 transitions, 806 flow [2022-12-06 06:15:40,566 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:40,566 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:40,566 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 83 transitions, 806 flow [2022-12-06 06:15:40,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 83 transitions, 806 flow [2022-12-06 06:15:40,634 INFO L130 PetriNetUnfolder]: 65/347 cut-off events. [2022-12-06 06:15:40,634 INFO L131 PetriNetUnfolder]: For 885/889 co-relation queries the response was YES. [2022-12-06 06:15:40,636 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 06:15:40,639 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 83 transitions, 806 flow [2022-12-06 06:15:40,639 INFO L188 LiptonReduction]: Number of co-enabled transitions 708 [2022-12-06 06:15:41,026 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 06:15:41,027 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 462 [2022-12-06 06:15:41,027 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 77 transitions, 776 flow [2022-12-06 06:15:41,027 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 06:15:41,027 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:41,027 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:41,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 06:15:41,228 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 06:15:41,228 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 06:15:41,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:41,228 INFO L85 PathProgramCache]: Analyzing trace with hash 681524893, now seen corresponding path program 1 times [2022-12-06 06:15:41,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:41,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314970646] [2022-12-06 06:15:41,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:41,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:41,497 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 06:15:41,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:41,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314970646] [2022-12-06 06:15:41,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314970646] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:41,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:41,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:15:41,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400826422] [2022-12-06 06:15:41,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:41,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:15:41,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:41,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:15:41,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:15:41,499 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 44 [2022-12-06 06:15:41,499 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 06:15:41,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:41,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 44 [2022-12-06 06:15:41,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:42,122 INFO L130 PetriNetUnfolder]: 2108/4028 cut-off events. [2022-12-06 06:15:42,123 INFO L131 PetriNetUnfolder]: For 10031/10031 co-relation queries the response was YES. [2022-12-06 06:15:42,135 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 06:15:42,153 INFO L137 encePairwiseOnDemand]: 25/44 looper letters, 113 selfloop transitions, 76 changer transitions 1/192 dead transitions. [2022-12-06 06:15:42,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 192 transitions, 2024 flow [2022-12-06 06:15:42,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 06:15:42,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 06:15:42,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions. [2022-12-06 06:15:42,154 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37272727272727274 [2022-12-06 06:15:42,155 INFO L175 Difference]: Start difference. First operand has 67 places, 77 transitions, 776 flow. Second operand 10 states and 164 transitions. [2022-12-06 06:15:42,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 192 transitions, 2024 flow [2022-12-06 06:15:42,180 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 06:15:42,183 INFO L231 Difference]: Finished difference. Result has 80 places, 128 transitions, 1413 flow [2022-12-06 06:15:42,183 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 06:15:42,184 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 38 predicate places. [2022-12-06 06:15:42,184 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:42,184 INFO L89 Accepts]: Start accepts. Operand has 80 places, 128 transitions, 1413 flow [2022-12-06 06:15:42,187 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:42,187 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:42,187 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 128 transitions, 1413 flow [2022-12-06 06:15:42,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 128 transitions, 1413 flow [2022-12-06 06:15:42,258 INFO L130 PetriNetUnfolder]: 116/595 cut-off events. [2022-12-06 06:15:42,258 INFO L131 PetriNetUnfolder]: For 1599/1607 co-relation queries the response was YES. [2022-12-06 06:15:42,260 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 06:15:42,267 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 128 transitions, 1413 flow [2022-12-06 06:15:42,267 INFO L188 LiptonReduction]: Number of co-enabled transitions 1028 [2022-12-06 06:15:42,268 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:15:42,269 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 06:15:42,269 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 128 transitions, 1413 flow [2022-12-06 06:15:42,269 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 06:15:42,269 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:42,269 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:42,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:15:42,270 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 06:15:42,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:42,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1781957431, now seen corresponding path program 2 times [2022-12-06 06:15:42,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:42,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456210554] [2022-12-06 06:15:42,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:42,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:42,752 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 06:15:42,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:42,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456210554] [2022-12-06 06:15:42,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456210554] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:15:42,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739493144] [2022-12-06 06:15:42,753 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 06:15:42,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:15:42,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:15:42,768 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:15:42,819 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 06:15:42,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-06 06:15:42,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 06:15:42,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 06:15:42,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:15:42,919 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-06 06:15:42,920 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 06:15:42,985 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 06:15:43,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-12-06 06:15:43,142 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 06:15:48,636 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 06:15:48,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:15:48,718 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 06:15:48,761 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:15:48,762 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 06:15:48,772 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 06:15:48,788 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 06:15:48,840 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 06:15:48,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739493144] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:15:48,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:15:48,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:15:48,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059376106] [2022-12-06 06:15:48,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:15:48,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:15:48,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:48,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:15:48,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=194, Unknown=2, NotChecked=28, Total=272 [2022-12-06 06:15:48,843 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 44 [2022-12-06 06:15:48,843 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 06:15:48,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:48,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 44 [2022-12-06 06:15:48,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:00,086 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 06:16:02,591 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 06:16:05,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 06:16:07,796 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 06:16:14,423 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 06:16:16,979 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 06:16:19,650 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 06:16:21,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 06:16:25,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:16:27,150 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 06:16:30,498 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 06:16:31,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:16:33,743 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 06:16:35,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:16:37,861 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 06:16:38,093 INFO L130 PetriNetUnfolder]: 3052/5839 cut-off events. [2022-12-06 06:16:38,093 INFO L131 PetriNetUnfolder]: For 16799/16799 co-relation queries the response was YES. [2022-12-06 06:16:38,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20334 conditions, 5839 events. 3052/5839 cut-off events. For 16799/16799 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 42256 event pairs, 641 based on Foata normal form. 12/5851 useless extension candidates. Maximal degree in co-relation 19489. Up to 1035 conditions per place. [2022-12-06 06:16:38,180 INFO L137 encePairwiseOnDemand]: 19/44 looper letters, 160 selfloop transitions, 173 changer transitions 3/338 dead transitions. [2022-12-06 06:16:38,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 338 transitions, 3660 flow [2022-12-06 06:16:38,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 06:16:38,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 06:16:38,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 293 transitions. [2022-12-06 06:16:38,184 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30268595041322316 [2022-12-06 06:16:38,184 INFO L175 Difference]: Start difference. First operand has 80 places, 128 transitions, 1413 flow. Second operand 22 states and 293 transitions. [2022-12-06 06:16:38,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 338 transitions, 3660 flow [2022-12-06 06:16:38,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 338 transitions, 3625 flow, removed 17 selfloop flow, removed 1 redundant places. [2022-12-06 06:16:38,250 INFO L231 Difference]: Finished difference. Result has 106 places, 217 transitions, 2823 flow [2022-12-06 06:16:38,251 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=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2823, PETRI_PLACES=106, PETRI_TRANSITIONS=217} [2022-12-06 06:16:38,251 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 64 predicate places. [2022-12-06 06:16:38,251 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:38,252 INFO L89 Accepts]: Start accepts. Operand has 106 places, 217 transitions, 2823 flow [2022-12-06 06:16:38,255 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:38,255 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:38,255 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 217 transitions, 2823 flow [2022-12-06 06:16:38,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 217 transitions, 2823 flow [2022-12-06 06:16:38,455 INFO L130 PetriNetUnfolder]: 658/2067 cut-off events. [2022-12-06 06:16:38,455 INFO L131 PetriNetUnfolder]: For 7659/8011 co-relation queries the response was YES. [2022-12-06 06:16:38,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8364 conditions, 2067 events. 658/2067 cut-off events. For 7659/8011 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 18479 event pairs, 149 based on Foata normal form. 4/1841 useless extension candidates. Maximal degree in co-relation 7925. Up to 460 conditions per place. [2022-12-06 06:16:38,485 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 217 transitions, 2823 flow [2022-12-06 06:16:38,486 INFO L188 LiptonReduction]: Number of co-enabled transitions 1468 [2022-12-06 06:16:38,487 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 06:16:38,925 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 06:16:39,149 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 06:16:39,398 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 06:16:40,591 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 06:16:41,358 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 06:16:41,487 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:16:41,488 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3237 [2022-12-06 06:16:41,489 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 217 transitions, 2947 flow [2022-12-06 06:16:41,489 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 06:16:41,489 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:41,489 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:41,496 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 06:16:41,698 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 06:16:41,699 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 06:16:41,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:41,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1779810245, now seen corresponding path program 1 times [2022-12-06 06:16:41,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:41,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505236551] [2022-12-06 06:16:41,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:41,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:42,203 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 06:16:42,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:42,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505236551] [2022-12-06 06:16:42,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505236551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:42,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:42,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:16:42,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783164134] [2022-12-06 06:16:42,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:42,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:16:42,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:42,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:16:42,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:16:42,206 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 57 [2022-12-06 06:16:42,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 217 transitions, 2947 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 06:16:42,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:42,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 57 [2022-12-06 06:16:42,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:43,901 INFO L130 PetriNetUnfolder]: 4989/9610 cut-off events. [2022-12-06 06:16:43,902 INFO L131 PetriNetUnfolder]: For 56856/56856 co-relation queries the response was YES. [2022-12-06 06:16:43,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46978 conditions, 9610 events. 4989/9610 cut-off events. For 56856/56856 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 76281 event pairs, 2031 based on Foata normal form. 12/9622 useless extension candidates. Maximal degree in co-relation 45392. Up to 5072 conditions per place. [2022-12-06 06:16:43,982 INFO L137 encePairwiseOnDemand]: 38/57 looper letters, 318 selfloop transitions, 117 changer transitions 0/437 dead transitions. [2022-12-06 06:16:43,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 437 transitions, 6560 flow [2022-12-06 06:16:43,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 06:16:43,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 06:16:43,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2022-12-06 06:16:43,983 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3105263157894737 [2022-12-06 06:16:43,983 INFO L175 Difference]: Start difference. First operand has 106 places, 217 transitions, 2947 flow. Second operand 10 states and 177 transitions. [2022-12-06 06:16:43,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 437 transitions, 6560 flow [2022-12-06 06:16:44,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 437 transitions, 6128 flow, removed 158 selfloop flow, removed 2 redundant places. [2022-12-06 06:16:44,115 INFO L231 Difference]: Finished difference. Result has 118 places, 304 transitions, 4508 flow [2022-12-06 06:16:44,116 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=2738, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4508, PETRI_PLACES=118, PETRI_TRANSITIONS=304} [2022-12-06 06:16:44,116 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 76 predicate places. [2022-12-06 06:16:44,116 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:44,116 INFO L89 Accepts]: Start accepts. Operand has 118 places, 304 transitions, 4508 flow [2022-12-06 06:16:44,118 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:44,118 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:44,118 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 304 transitions, 4508 flow [2022-12-06 06:16:44,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 304 transitions, 4508 flow [2022-12-06 06:16:44,527 INFO L130 PetriNetUnfolder]: 1127/3515 cut-off events. [2022-12-06 06:16:44,528 INFO L131 PetriNetUnfolder]: For 15065/15198 co-relation queries the response was YES. [2022-12-06 06:16:44,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15501 conditions, 3515 events. 1127/3515 cut-off events. For 15065/15198 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 33812 event pairs, 291 based on Foata normal form. 5/3246 useless extension candidates. Maximal degree in co-relation 14803. Up to 826 conditions per place. [2022-12-06 06:16:44,575 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 304 transitions, 4508 flow [2022-12-06 06:16:44,576 INFO L188 LiptonReduction]: Number of co-enabled transitions 2086 [2022-12-06 06:16:44,577 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 06:16:47,372 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 06:16:47,661 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:16:47,662 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3546 [2022-12-06 06:16:47,662 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 303 transitions, 4542 flow [2022-12-06 06:16:47,663 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 06:16:47,663 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:47,663 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:47,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:16:47,663 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 06:16:47,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:47,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1607610805, now seen corresponding path program 1 times [2022-12-06 06:16:47,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:47,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016963982] [2022-12-06 06:16:47,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:47,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:48,315 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 06:16:48,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:48,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016963982] [2022-12-06 06:16:48,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016963982] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:16:48,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137524768] [2022-12-06 06:16:48,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:48,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:16:48,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:16:48,324 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 06:16:48,395 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 06:16:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:48,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 72 conjunts are in the unsatisfiable core [2022-12-06 06:16:48,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:16:48,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 06:16:48,510 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 06:16:48,529 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-06 06:16:48,529 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 06:16:48,574 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 06:16:48,618 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 06:16:48,729 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 06:16:48,920 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 06:16:49,010 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 06:16:49,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:16:49,194 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 06:16:49,202 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 06:16:49,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137524768] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:16:49,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:16:49,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 5] total 18 [2022-12-06 06:16:49,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134341737] [2022-12-06 06:16:49,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:16:49,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:16:49,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:49,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:16:49,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=255, Unknown=1, NotChecked=34, Total=380 [2022-12-06 06:16:49,204 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 68 [2022-12-06 06:16:49,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 303 transitions, 4542 flow. Second operand has 20 states, 20 states have (on average 4.1) internal successors, (82), 20 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:49,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:49,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 68 [2022-12-06 06:16:49,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:02,360 INFO L130 PetriNetUnfolder]: 11554/22105 cut-off events. [2022-12-06 06:17:02,360 INFO L131 PetriNetUnfolder]: For 137460/137460 co-relation queries the response was YES. [2022-12-06 06:17:02,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107556 conditions, 22105 events. 11554/22105 cut-off events. For 137460/137460 co-relation queries the response was YES. Maximal size of possible extension queue 1250. Compared 200736 event pairs, 2334 based on Foata normal form. 76/22181 useless extension candidates. Maximal degree in co-relation 105434. Up to 6401 conditions per place. [2022-12-06 06:17:02,685 INFO L137 encePairwiseOnDemand]: 20/68 looper letters, 433 selfloop transitions, 706 changer transitions 90/1231 dead transitions. [2022-12-06 06:17:02,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 1231 transitions, 17402 flow [2022-12-06 06:17:02,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-12-06 06:17:02,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2022-12-06 06:17:02,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 928 transitions. [2022-12-06 06:17:02,704 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20069204152249134 [2022-12-06 06:17:02,704 INFO L175 Difference]: Start difference. First operand has 117 places, 303 transitions, 4542 flow. Second operand 68 states and 928 transitions. [2022-12-06 06:17:02,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 1231 transitions, 17402 flow [2022-12-06 06:17:03,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 1231 transitions, 17287 flow, removed 57 selfloop flow, removed 1 redundant places. [2022-12-06 06:17:03,432 INFO L231 Difference]: Finished difference. Result has 209 places, 765 transitions, 13921 flow [2022-12-06 06:17:03,432 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=4503, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=249, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=68, PETRI_FLOW=13921, PETRI_PLACES=209, PETRI_TRANSITIONS=765} [2022-12-06 06:17:03,433 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 167 predicate places. [2022-12-06 06:17:03,433 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:03,433 INFO L89 Accepts]: Start accepts. Operand has 209 places, 765 transitions, 13921 flow [2022-12-06 06:17:03,442 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:03,442 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:03,442 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 209 places, 765 transitions, 13921 flow [2022-12-06 06:17:03,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 765 transitions, 13921 flow [2022-12-06 06:17:03,915 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([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][67], [Black: 170#(<= ~top~0 1), Black: 690#(and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (= |~#arr~0.offset| 0) (not (= 4294967294 (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 8))) 4294967296))) (exists ((|v_t1Thread1of1ForFork1_push_~stack#1.offset_152| Int) (|t1Thread1of1ForFork1_get_top_#res#1| Int) (|aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| Int) (|t1Thread1of1ForFork1_push_~stack#1.offset| Int) (|v_t1Thread1of1ForFork1_get_top_#res#1_145| Int) (v_ArrVal_413 Int)) (and (= (mod (select (store (store ((as const (Array Int Int)) 0) (+ |v_t1Thread1of1ForFork1_push_~stack#1.offset_152| (* |v_t1Thread1of1ForFork1_get_top_#res#1_145| 4)) (mod |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 4294967296)) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* 4 |t1Thread1of1ForFork1_get_top_#res#1|)) v_ArrVal_413) 0) 4294967296) |t2Thread1of1ForFork0_pop_#res#1|) (<= 1 |t1Thread1of1ForFork1_get_top_#res#1|) (< |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 400) (<= 0 |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48|) (<= 0 |t1Thread1of1ForFork1_push_~stack#1.offset|))) (<= (* ~top~0 4) 4) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), Black: 568#(and (= |~#arr~0.offset| 0) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))))) (< (* ~top~0 4) 8))), Black: 688#(and (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))))) (< (* ~top~0 4) 8))), Black: 714#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))))) (< (* ~top~0 4) 8)) (not (= 4294967294 (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 8))) 4294967296)))), Black: 215#(not (<= 400 ~top~0)), Black: 174#(<= ~top~0 0), Black: 619#(not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)), Black: 676#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (= |~#arr~0.offset| 0) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (< (* ~top~0 4) 4))), Black: 615#(exists ((|v_t1Thread1of1ForFork1_push_~stack#1.offset_152| Int) (|t1Thread1of1ForFork1_get_top_#res#1| Int) (|aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| Int) (|t1Thread1of1ForFork1_push_~stack#1.offset| Int) (|v_t1Thread1of1ForFork1_get_top_#res#1_145| Int) (v_ArrVal_413 Int)) (and (= (mod (select (store (store ((as const (Array Int Int)) 0) (+ |v_t1Thread1of1ForFork1_push_~stack#1.offset_152| (* |v_t1Thread1of1ForFork1_get_top_#res#1_145| 4)) (mod |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 4294967296)) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* 4 |t1Thread1of1ForFork1_get_top_#res#1|)) v_ArrVal_413) 0) 4294967296) |t2Thread1of1ForFork0_pop_#res#1|) (<= 1 |t1Thread1of1ForFork1_get_top_#res#1|) (< |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 400) (<= 0 |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48|) (<= 0 |t1Thread1of1ForFork1_push_~stack#1.offset|))), Black: 680#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (= ~top~0 1) (exists ((|v_t1Thread1of1ForFork1_push_~stack#1.offset_152| Int) (|t1Thread1of1ForFork1_get_top_#res#1| Int) (|aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| Int) (|t1Thread1of1ForFork1_push_~stack#1.offset| Int) (|v_t1Thread1of1ForFork1_get_top_#res#1_145| Int) (v_ArrVal_413 Int)) (and (= (select |#memory_int| |~#arr~0.base|) (store (store ((as const (Array Int Int)) 0) (+ |v_t1Thread1of1ForFork1_push_~stack#1.offset_152| (* |v_t1Thread1of1ForFork1_get_top_#res#1_145| 4)) (mod |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 4294967296)) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* 4 |t1Thread1of1ForFork1_get_top_#res#1|)) v_ArrVal_413)) (<= |~#arr~0.offset| |t1Thread1of1ForFork1_push_~stack#1.offset|) (< |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 400) (<= 0 |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48|) (<= ~top~0 |t1Thread1of1ForFork1_get_top_#res#1|))) (= 3 |~#arr~0.base|)), Black: 752#(and (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (exists ((|v_t1Thread1of1ForFork1_push_~stack#1.offset_152| Int) (|t1Thread1of1ForFork1_get_top_#res#1| Int) (|aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| Int) (|t1Thread1of1ForFork1_push_~stack#1.offset| Int) (|v_t1Thread1of1ForFork1_get_top_#res#1_145| Int) (v_ArrVal_413 Int)) (and (= (mod (select (store (store ((as const (Array Int Int)) 0) (+ |v_t1Thread1of1ForFork1_push_~stack#1.offset_152| (* |v_t1Thread1of1ForFork1_get_top_#res#1_145| 4)) (mod |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 4294967296)) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* 4 |t1Thread1of1ForFork1_get_top_#res#1|)) v_ArrVal_413) 0) 4294967296) |t2Thread1of1ForFork0_pop_#res#1|) (<= 1 |t1Thread1of1ForFork1_get_top_#res#1|) (< |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 400) (<= 0 |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48|) (<= 0 |t1Thread1of1ForFork1_push_~stack#1.offset|))) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (< (* ~top~0 4) 4))), Black: 716#(and (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))))) (< (* ~top~0 4) 8)) (not (= 4294967294 (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 8))) 4294967296))) (exists ((|v_t1Thread1of1ForFork1_push_~stack#1.offset_152| Int) (|t1Thread1of1ForFork1_get_top_#res#1| Int) (|aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| Int) (|t1Thread1of1ForFork1_push_~stack#1.offset| Int) (|v_t1Thread1of1ForFork1_get_top_#res#1_145| Int) (v_ArrVal_413 Int)) (and (= (mod (select (store (store ((as const (Array Int Int)) 0) (+ |v_t1Thread1of1ForFork1_push_~stack#1.offset_152| (* |v_t1Thread1of1ForFork1_get_top_#res#1_145| 4)) (mod |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 4294967296)) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* 4 |t1Thread1of1ForFork1_get_top_#res#1|)) v_ArrVal_413) 0) 4294967296) |t2Thread1of1ForFork0_pop_#res#1|) (<= 1 |t1Thread1of1ForFork1_get_top_#res#1|) (< |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 400) (<= 0 |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48|) (<= 0 |t1Thread1of1ForFork1_push_~stack#1.offset|)))), Black: 397#(and (= |~#arr~0.offset| 0) (or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 4294966897 |t2Thread1of1ForFork0_pop_#res#1|) 0))), Black: 597#(and (exists ((|t1Thread1of1ForFork1_get_top_#res#1| Int) (|aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| Int) (|t1Thread1of1ForFork1_push_~stack#1.offset| Int)) (and (< |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 400) (<= 0 |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48|) (= (select |#memory_int| |~#arr~0.base|) (store ((as const (Array Int Int)) 0) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* 4 |t1Thread1of1ForFork1_get_top_#res#1|)) (mod |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 4294967296))))) (= |~#arr~0.offset| 0) (= ~top~0 1) (= 3 |~#arr~0.base|)), Black: 391#(and (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 399) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 4294966897 |t2Thread1of1ForFork0_pop_#res#1|) 0))), Black: 738#(and (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (exists ((|v_t1Thread1of1ForFork1_push_~stack#1.offset_152| Int) (|t1Thread1of1ForFork1_get_top_#res#1| Int) (|aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| Int) (|t1Thread1of1ForFork1_push_~stack#1.offset| Int) (|v_t1Thread1of1ForFork1_get_top_#res#1_145| Int) (v_ArrVal_413 Int)) (and (= (mod (select (store (store ((as const (Array Int Int)) 0) (+ |v_t1Thread1of1ForFork1_push_~stack#1.offset_152| (* |v_t1Thread1of1ForFork1_get_top_#res#1_145| 4)) (mod |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 4294967296)) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* 4 |t1Thread1of1ForFork1_get_top_#res#1|)) v_ArrVal_413) 0) 4294967296) |t2Thread1of1ForFork0_pop_#res#1|) (<= 1 |t1Thread1of1ForFork1_get_top_#res#1|) (< |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 400) (<= 0 |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48|) (<= 0 |t1Thread1of1ForFork1_push_~stack#1.offset|)))), Black: 384#(= |~#arr~0.offset| 0), Black: 686#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (< (* ~top~0 4) 4))), Black: 692#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))))) (< (* ~top~0 4) 8))), Black: 493#(and (= |~#arr~0.offset| 0) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (= 3 |~#arr~0.base|)), Black: 718#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294))), Black: 567#(and (= |~#arr~0.offset| 0) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (< (* ~top~0 4) 4))), t2Thread1of1ForFork0InUse, Black: 527#(and (= |~#arr~0.offset| 0) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 2147483649 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (<= (+ (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))))) 4294967296) 4294967296) 4294966897 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) 0) (= 3 |~#arr~0.base|) (<= (+ 4294966897 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296)) 0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647) (forall ((v_ArrVal_306 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_306) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), Black: 491#(and (= |~#arr~0.offset| 0) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (exists ((aux_div_v_arrayElimCell_5_48 Int) (aux_mod_v_arrayElimCell_5_48 Int)) (and (<= (+ (* aux_div_v_arrayElimCell_5_48 4294967296) aux_mod_v_arrayElimCell_5_48 1) 0) (= (mod (+ 4294967295 (* 4294967295 aux_mod_v_arrayElimCell_5_48)) 4294967296) |t2Thread1of1ForFork0_pop_#res#1|) (< 0 (+ (* aux_div_v_arrayElimCell_5_48 4294967296) 4294967297 aux_mod_v_arrayElimCell_5_48)) (<= 4294966896 aux_mod_v_arrayElimCell_5_48) (< aux_mod_v_arrayElimCell_5_48 4294967296))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (= 3 |~#arr~0.base|) (<= (+ 4294966897 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296)) 0)), Black: 760#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (not (= 4294967294 (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 8))) 4294967296))) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (< (* ~top~0 4) 4))), Black: 664#(and (exists ((|v_t1Thread1of1ForFork1_push_~stack#1.offset_152| Int) (|t1Thread1of1ForFork1_get_top_#res#1| Int) (|aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| Int) (|t1Thread1of1ForFork1_push_~stack#1.offset| Int) (|v_t1Thread1of1ForFork1_get_top_#res#1_145| Int) (v_ArrVal_413 Int)) (and (= (select |#memory_int| |~#arr~0.base|) (store (store ((as const (Array Int Int)) 0) (+ |v_t1Thread1of1ForFork1_push_~stack#1.offset_152| (* |v_t1Thread1of1ForFork1_get_top_#res#1_145| 4)) (mod |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 4294967296)) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* 4 |t1Thread1of1ForFork1_get_top_#res#1|)) v_ArrVal_413)) (<= |~#arr~0.offset| |t1Thread1of1ForFork1_push_~stack#1.offset|) (< |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 400) (<= ~top~0 (+ |t1Thread1of1ForFork1_get_top_#res#1| 1)) (<= 0 |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48|))) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (= ~top~0 2) (= 3 |~#arr~0.base|)), Black: 510#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (= |~#arr~0.offset| 0) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (= 3 |~#arr~0.base|) (<= (+ 4294966897 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296)) 0) (forall ((v_ArrVal_306 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_306) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)))), Black: 726#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))))) (< (* ~top~0 4) 8)) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (< (* ~top~0 4) 4))), Black: 517#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (= |~#arr~0.offset| 0) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (<= (+ (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))))) 4294967296) 4294967296) 4294966897 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) 0) (= 3 |~#arr~0.base|) (<= (+ 4294966897 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296)) 0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647) (forall ((v_ArrVal_306 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_306) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), Black: 682#(and (= ~top~0 0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 399) (not (= 4294967294 (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 8))) 4294967296))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0)) (exists ((|v_t1Thread1of1ForFork1_push_~stack#1.offset_152| Int) (|t1Thread1of1ForFork1_get_top_#res#1| Int) (|aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| Int) (|t1Thread1of1ForFork1_push_~stack#1.offset| Int) (|v_t1Thread1of1ForFork1_get_top_#res#1_145| Int) (v_ArrVal_413 Int)) (and (= (mod (select (store (store ((as const (Array Int Int)) 0) (+ |v_t1Thread1of1ForFork1_push_~stack#1.offset_152| (* |v_t1Thread1of1ForFork1_get_top_#res#1_145| 4)) (mod |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 4294967296)) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* 4 |t1Thread1of1ForFork1_get_top_#res#1|)) v_ArrVal_413) 0) 4294967296) |t2Thread1of1ForFork0_pop_#res#1|) (<= 1 |t1Thread1of1ForFork1_get_top_#res#1|) (< |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 400) (<= 0 |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48|) (<= 0 |t1Thread1of1ForFork1_push_~stack#1.offset|))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), Black: 276#(or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 2147483649 |t2Thread1of1ForFork0_pop_#res#1|) 0)), Black: 758#(and (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (exists ((|v_t1Thread1of1ForFork1_push_~stack#1.offset_152| Int) (|t1Thread1of1ForFork1_get_top_#res#1| Int) (|aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| Int) (|t1Thread1of1ForFork1_push_~stack#1.offset| Int) (|v_t1Thread1of1ForFork1_get_top_#res#1_145| Int) (v_ArrVal_413 Int)) (and (= (mod (select (store (store ((as const (Array Int Int)) 0) (+ |v_t1Thread1of1ForFork1_push_~stack#1.offset_152| (* |v_t1Thread1of1ForFork1_get_top_#res#1_145| 4)) (mod |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 4294967296)) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* 4 |t1Thread1of1ForFork1_get_top_#res#1|)) v_ArrVal_413) 0) 4294967296) |t2Thread1of1ForFork0_pop_#res#1|) (<= 1 |t1Thread1of1ForFork1_get_top_#res#1|) (< |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 400) (<= 0 |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48|) (<= 0 |t1Thread1of1ForFork1_push_~stack#1.offset|)))), Black: 275#(and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0)) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0))) 2147483647)), Black: 770#(and (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (not (= 4294967294 (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 8))) 4294967296))) (exists ((|v_t1Thread1of1ForFork1_push_~stack#1.offset_152| Int) (|t1Thread1of1ForFork1_get_top_#res#1| Int) (|aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| Int) (|t1Thread1of1ForFork1_push_~stack#1.offset| Int) (|v_t1Thread1of1ForFork1_get_top_#res#1_145| Int) (v_ArrVal_413 Int)) (and (= (mod (select (store (store ((as const (Array Int Int)) 0) (+ |v_t1Thread1of1ForFork1_push_~stack#1.offset_152| (* |v_t1Thread1of1ForFork1_get_top_#res#1_145| 4)) (mod |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 4294967296)) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* 4 |t1Thread1of1ForFork1_get_top_#res#1|)) v_ArrVal_413) 0) 4294967296) |t2Thread1of1ForFork0_pop_#res#1|) (<= 1 |t1Thread1of1ForFork1_get_top_#res#1|) (< |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 400) (<= 0 |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48|) (<= 0 |t1Thread1of1ForFork1_push_~stack#1.offset|))) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (< (* ~top~0 4) 4))), Black: 732#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (< (* ~top~0 4) 4))), Black: 684#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294))), Black: 562#true, Black: 728#(and (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))))) (< (* ~top~0 4) 8)) (not (= 4294967294 (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 8))) 4294967296)))), Black: 160#(= ~top~0 0), Black: 289#(and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0)) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0))) 399) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 4294966897 |t2Thread1of1ForFork0_pop_#res#1|) 0))), Black: 285#(and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0)) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0))) 399) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|))), Black: 287#(or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 4294966897 |t2Thread1of1ForFork0_pop_#res#1|) 0)), 640#(not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)), 6#L1023-1true, 100#L1005-6true, Black: 546#(and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), Black: 554#(and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 4294966897 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (= 3 |~#arr~0.base|) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), Black: 550#(and (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 4294966897 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (= 3 |~#arr~0.base|)), Black: 548#(and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* |t1Thread1of1ForFork1_inc_top_#t~post31#1| 4))) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) (* |t1Thread1of1ForFork1_inc_top_#t~post31#1| 4)) 399) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (= 3 |~#arr~0.base|)), 282#true, 385#(and (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 399) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)))), 166#true, 271#true, 495#(and (= |~#arr~0.offset| 0) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (= 3 |~#arr~0.base|) (<= (+ 4294966897 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296)) 0) (forall ((v_ArrVal_306 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_306) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)))), 70#L945true, Black: 350#(< ~top~0 397), 538#(and (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|)), Black: 297#(<= ~top~0 2), Black: 299#(<= ~top~0 3), Black: 296#(<= ~top~0 1), Black: 339#(< ~top~0 399), Black: 331#(not (<= 400 ~top~0)), Black: 343#(< ~top~0 398), Black: 295#(= ~top~0 0), 293#true]) [2022-12-06 06:17:03,918 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-06 06:17:03,918 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 06:17:03,918 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 06:17:03,918 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 06:17:03,919 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([662] L991-6-->t2EXIT: Formula: (let ((.cse0 (select |v_#pthreadsMutex_575| |v_~#m~0.base_256|)) (.cse1 (mod |v_t1Thread1of1ForFork1_~tmp~0#1_133| 4294967296))) (and (= |v_t1Thread1of1ForFork1_push_~stack#1.base_130| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_108|) (= (select .cse0 |v_~#m~0.offset_256|) 0) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_108| |v_t1Thread1of1ForFork1_push_~stack#1.offset_130|) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_122| |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_130|) (not (< |v_t2Thread1of1ForFork0_~i~1#1_158| 400)) (< |v_t1Thread1of1ForFork1_~i~0#1_223| 400) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.base_108| |v_~#arr~0.base_119|) (= |v_t1Thread1of1ForFork1_get_top_#res#1_123| v_~top~0_518) (<= |v_t1Thread1of1ForFork1_get_top_#res#1_123| 2147483647) (= (store |v_#memory_int_235| |v_t1Thread1of1ForFork1_push_~stack#1.base_130| (store (select |v_#memory_int_235| |v_t1Thread1of1ForFork1_push_~stack#1.base_130|) (+ |v_t1Thread1of1ForFork1_push_~stack#1.offset_130| (* |v_t1Thread1of1ForFork1_get_top_#res#1_123| 4)) |v_t1Thread1of1ForFork1_push_~x#1_130|)) |v_#memory_int_234|) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_108| |v_~#arr~0.offset_114|) (= |v_t2Thread1of1ForFork0_#res#1.offset_14| 0) (not (= |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_130| 0)) (= |v_t1Thread1of1ForFork1_#t~nondet40#1_175| |v_t1Thread1of1ForFork1_~tmp~0#1_133|) (= |v_t2Thread1of1ForFork0_#res#1.base_14| 0) (= |v_t1Thread1of1ForFork1_push_#in~x#1_108| |v_t1Thread1of1ForFork1_push_~x#1_130|) (not (= 400 v_~top~0_518)) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_122| (ite (< .cse1 400) 1 0)) (= (store |v_#pthreadsMutex_575| |v_~#m~0.base_256| (store .cse0 |v_~#m~0.offset_256| 1)) |v_#pthreadsMutex_574|) (= |v_t1Thread1of1ForFork1_push_#in~x#1_108| (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) (<= 0 (+ |v_t1Thread1of1ForFork1_get_top_#res#1_123| 2147483648)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_575|, ~#arr~0.offset=|v_~#arr~0.offset_114|, ~#m~0.base=|v_~#m~0.base_256|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_223|, ~#m~0.offset=|v_~#m~0.offset_256|, #memory_int=|v_#memory_int_235|, t2Thread1of1ForFork0_~i~1#1=|v_t2Thread1of1ForFork0_~i~1#1_158|, ~top~0=v_~top~0_518, ~#arr~0.base=|v_~#arr~0.base_119|, t1Thread1of1ForFork1_#t~nondet40#1=|v_t1Thread1of1ForFork1_#t~nondet40#1_175|} OutVars{t2Thread1of1ForFork0_#res#1.base=|v_t2Thread1of1ForFork0_#res#1.base_14|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_223|, t2Thread1of1ForFork0_#res#1.offset=|v_t2Thread1of1ForFork0_#res#1.offset_14|, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_122|, t1Thread1of1ForFork1_push_#in~stack#1.offset=|v_t1Thread1of1ForFork1_push_#in~stack#1.offset_108|, t2Thread1of1ForFork0_~i~1#1=|v_t2Thread1of1ForFork0_~i~1#1_158|, ~top~0=v_~top~0_518, t1Thread1of1ForFork1_push_#in~x#1=|v_t1Thread1of1ForFork1_push_#in~x#1_108|, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_241|, t1Thread1of1ForFork1_get_top_#res#1=|v_t1Thread1of1ForFork1_get_top_#res#1_123|, t1Thread1of1ForFork1_#t~nondet39#1=|v_t1Thread1of1ForFork1_#t~nondet39#1_118|, t1Thread1of1ForFork1_push_~stack#1.base=|v_t1Thread1of1ForFork1_push_~stack#1.base_130|, ~#arr~0.base=|v_~#arr~0.base_119|, #pthreadsMutex=|v_#pthreadsMutex_574|, ~#arr~0.offset=|v_~#arr~0.offset_114|, t1Thread1of1ForFork1_push_~x#1=|v_t1Thread1of1ForFork1_push_~x#1_130|, t1Thread1of1ForFork1_push_#t~ret34#1=|v_t1Thread1of1ForFork1_push_#t~ret34#1_152|, t1Thread1of1ForFork1_push_#in~stack#1.base=|v_t1Thread1of1ForFork1_push_#in~stack#1.base_108|, ~#m~0.base=|v_~#m~0.base_256|, ~#m~0.offset=|v_~#m~0.offset_256|, t1Thread1of1ForFork1_~tmp~0#1=|v_t1Thread1of1ForFork1_~tmp~0#1_133|, #memory_int=|v_#memory_int_234|, t1Thread1of1ForFork1_push_~stack#1.offset=|v_t1Thread1of1ForFork1_push_~stack#1.offset_130|, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_130|, t1Thread1of1ForFork1_push_#t~nondet33#1=|v_t1Thread1of1ForFork1_push_#t~nondet33#1_107|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_385|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#res#1.base, t1Thread1of1ForFork1_push_~x#1, t2Thread1of1ForFork0_#res#1.offset, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, t1Thread1of1ForFork1_push_#in~stack#1.offset, t1Thread1of1ForFork1_push_#t~ret34#1, t1Thread1of1ForFork1_push_#in~stack#1.base, 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_#t~nondet39#1, t1Thread1of1ForFork1_push_~stack#1.offset, t1Thread1of1ForFork1_push_~stack#1.base, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1, t1Thread1of1ForFork1_push_#t~nondet33#1, t1Thread1of1ForFork1_inc_top_#t~post31#1][106], [Black: 170#(<= ~top~0 1), Black: 690#(and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (= |~#arr~0.offset| 0) (not (= 4294967294 (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 8))) 4294967296))) (exists ((|v_t1Thread1of1ForFork1_push_~stack#1.offset_152| Int) (|t1Thread1of1ForFork1_get_top_#res#1| Int) (|aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| Int) (|t1Thread1of1ForFork1_push_~stack#1.offset| Int) (|v_t1Thread1of1ForFork1_get_top_#res#1_145| Int) (v_ArrVal_413 Int)) (and (= (mod (select (store (store ((as const (Array Int Int)) 0) (+ |v_t1Thread1of1ForFork1_push_~stack#1.offset_152| (* |v_t1Thread1of1ForFork1_get_top_#res#1_145| 4)) (mod |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 4294967296)) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* 4 |t1Thread1of1ForFork1_get_top_#res#1|)) v_ArrVal_413) 0) 4294967296) |t2Thread1of1ForFork0_pop_#res#1|) (<= 1 |t1Thread1of1ForFork1_get_top_#res#1|) (< |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 400) (<= 0 |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48|) (<= 0 |t1Thread1of1ForFork1_push_~stack#1.offset|))) (<= (* ~top~0 4) 4) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), Black: 568#(and (= |~#arr~0.offset| 0) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))))) (< (* ~top~0 4) 8))), Black: 688#(and (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))))) (< (* ~top~0 4) 8))), Black: 714#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))))) (< (* ~top~0 4) 8)) (not (= 4294967294 (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 8))) 4294967296)))), Black: 215#(not (<= 400 ~top~0)), Black: 174#(<= ~top~0 0), Black: 619#(not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)), Black: 676#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (= |~#arr~0.offset| 0) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (< (* ~top~0 4) 4))), Black: 615#(exists ((|v_t1Thread1of1ForFork1_push_~stack#1.offset_152| Int) (|t1Thread1of1ForFork1_get_top_#res#1| Int) (|aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| Int) (|t1Thread1of1ForFork1_push_~stack#1.offset| Int) (|v_t1Thread1of1ForFork1_get_top_#res#1_145| Int) (v_ArrVal_413 Int)) (and (= (mod (select (store (store ((as const (Array Int Int)) 0) (+ |v_t1Thread1of1ForFork1_push_~stack#1.offset_152| (* |v_t1Thread1of1ForFork1_get_top_#res#1_145| 4)) (mod |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 4294967296)) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* 4 |t1Thread1of1ForFork1_get_top_#res#1|)) v_ArrVal_413) 0) 4294967296) |t2Thread1of1ForFork0_pop_#res#1|) (<= 1 |t1Thread1of1ForFork1_get_top_#res#1|) (< |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 400) (<= 0 |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48|) (<= 0 |t1Thread1of1ForFork1_push_~stack#1.offset|))), Black: 680#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (= ~top~0 1) (exists ((|v_t1Thread1of1ForFork1_push_~stack#1.offset_152| Int) (|t1Thread1of1ForFork1_get_top_#res#1| Int) (|aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| Int) (|t1Thread1of1ForFork1_push_~stack#1.offset| Int) (|v_t1Thread1of1ForFork1_get_top_#res#1_145| Int) (v_ArrVal_413 Int)) (and (= (select |#memory_int| |~#arr~0.base|) (store (store ((as const (Array Int Int)) 0) (+ |v_t1Thread1of1ForFork1_push_~stack#1.offset_152| (* |v_t1Thread1of1ForFork1_get_top_#res#1_145| 4)) (mod |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 4294967296)) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* 4 |t1Thread1of1ForFork1_get_top_#res#1|)) v_ArrVal_413)) (<= |~#arr~0.offset| |t1Thread1of1ForFork1_push_~stack#1.offset|) (< |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 400) (<= 0 |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48|) (<= ~top~0 |t1Thread1of1ForFork1_get_top_#res#1|))) (= 3 |~#arr~0.base|)), Black: 752#(and (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (exists ((|v_t1Thread1of1ForFork1_push_~stack#1.offset_152| Int) (|t1Thread1of1ForFork1_get_top_#res#1| Int) (|aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| Int) (|t1Thread1of1ForFork1_push_~stack#1.offset| Int) (|v_t1Thread1of1ForFork1_get_top_#res#1_145| Int) (v_ArrVal_413 Int)) (and (= (mod (select (store (store ((as const (Array Int Int)) 0) (+ |v_t1Thread1of1ForFork1_push_~stack#1.offset_152| (* |v_t1Thread1of1ForFork1_get_top_#res#1_145| 4)) (mod |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 4294967296)) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* 4 |t1Thread1of1ForFork1_get_top_#res#1|)) v_ArrVal_413) 0) 4294967296) |t2Thread1of1ForFork0_pop_#res#1|) (<= 1 |t1Thread1of1ForFork1_get_top_#res#1|) (< |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 400) (<= 0 |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48|) (<= 0 |t1Thread1of1ForFork1_push_~stack#1.offset|))) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (< (* ~top~0 4) 4))), Black: 716#(and (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))))) (< (* ~top~0 4) 8)) (not (= 4294967294 (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 8))) 4294967296))) (exists ((|v_t1Thread1of1ForFork1_push_~stack#1.offset_152| Int) (|t1Thread1of1ForFork1_get_top_#res#1| Int) (|aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| Int) (|t1Thread1of1ForFork1_push_~stack#1.offset| Int) (|v_t1Thread1of1ForFork1_get_top_#res#1_145| Int) (v_ArrVal_413 Int)) (and (= (mod (select (store (store ((as const (Array Int Int)) 0) (+ |v_t1Thread1of1ForFork1_push_~stack#1.offset_152| (* |v_t1Thread1of1ForFork1_get_top_#res#1_145| 4)) (mod |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 4294967296)) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* 4 |t1Thread1of1ForFork1_get_top_#res#1|)) v_ArrVal_413) 0) 4294967296) |t2Thread1of1ForFork0_pop_#res#1|) (<= 1 |t1Thread1of1ForFork1_get_top_#res#1|) (< |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 400) (<= 0 |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48|) (<= 0 |t1Thread1of1ForFork1_push_~stack#1.offset|)))), Black: 397#(and (= |~#arr~0.offset| 0) (or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 4294966897 |t2Thread1of1ForFork0_pop_#res#1|) 0))), Black: 597#(and (exists ((|t1Thread1of1ForFork1_get_top_#res#1| Int) (|aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| Int) (|t1Thread1of1ForFork1_push_~stack#1.offset| Int)) (and (< |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 400) (<= 0 |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48|) (= (select |#memory_int| |~#arr~0.base|) (store ((as const (Array Int Int)) 0) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* 4 |t1Thread1of1ForFork1_get_top_#res#1|)) (mod |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 4294967296))))) (= |~#arr~0.offset| 0) (= ~top~0 1) (= 3 |~#arr~0.base|)), Black: 391#(and (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 399) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 4294966897 |t2Thread1of1ForFork0_pop_#res#1|) 0))), Black: 738#(and (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (exists ((|v_t1Thread1of1ForFork1_push_~stack#1.offset_152| Int) (|t1Thread1of1ForFork1_get_top_#res#1| Int) (|aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| Int) (|t1Thread1of1ForFork1_push_~stack#1.offset| Int) (|v_t1Thread1of1ForFork1_get_top_#res#1_145| Int) (v_ArrVal_413 Int)) (and (= (mod (select (store (store ((as const (Array Int Int)) 0) (+ |v_t1Thread1of1ForFork1_push_~stack#1.offset_152| (* |v_t1Thread1of1ForFork1_get_top_#res#1_145| 4)) (mod |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 4294967296)) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* 4 |t1Thread1of1ForFork1_get_top_#res#1|)) v_ArrVal_413) 0) 4294967296) |t2Thread1of1ForFork0_pop_#res#1|) (<= 1 |t1Thread1of1ForFork1_get_top_#res#1|) (< |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 400) (<= 0 |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48|) (<= 0 |t1Thread1of1ForFork1_push_~stack#1.offset|)))), Black: 384#(= |~#arr~0.offset| 0), Black: 686#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (< (* ~top~0 4) 4))), Black: 692#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))))) (< (* ~top~0 4) 8))), Black: 493#(and (= |~#arr~0.offset| 0) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (= 3 |~#arr~0.base|)), Black: 718#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294))), Black: 495#(and (= |~#arr~0.offset| 0) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (= 3 |~#arr~0.base|) (<= (+ 4294966897 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296)) 0) (forall ((v_ArrVal_306 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_306) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)))), Black: 567#(and (= |~#arr~0.offset| 0) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (< (* ~top~0 4) 4))), t2Thread1of1ForFork0InUse, Black: 527#(and (= |~#arr~0.offset| 0) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 2147483649 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (<= (+ (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))))) 4294967296) 4294967296) 4294966897 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) 0) (= 3 |~#arr~0.base|) (<= (+ 4294966897 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296)) 0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647) (forall ((v_ArrVal_306 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_306) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), Black: 491#(and (= |~#arr~0.offset| 0) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (exists ((aux_div_v_arrayElimCell_5_48 Int) (aux_mod_v_arrayElimCell_5_48 Int)) (and (<= (+ (* aux_div_v_arrayElimCell_5_48 4294967296) aux_mod_v_arrayElimCell_5_48 1) 0) (= (mod (+ 4294967295 (* 4294967295 aux_mod_v_arrayElimCell_5_48)) 4294967296) |t2Thread1of1ForFork0_pop_#res#1|) (< 0 (+ (* aux_div_v_arrayElimCell_5_48 4294967296) 4294967297 aux_mod_v_arrayElimCell_5_48)) (<= 4294966896 aux_mod_v_arrayElimCell_5_48) (< aux_mod_v_arrayElimCell_5_48 4294967296))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (= 3 |~#arr~0.base|) (<= (+ 4294966897 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296)) 0)), Black: 760#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (not (= 4294967294 (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 8))) 4294967296))) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (< (* ~top~0 4) 4))), Black: 664#(and (exists ((|v_t1Thread1of1ForFork1_push_~stack#1.offset_152| Int) (|t1Thread1of1ForFork1_get_top_#res#1| Int) (|aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| Int) (|t1Thread1of1ForFork1_push_~stack#1.offset| Int) (|v_t1Thread1of1ForFork1_get_top_#res#1_145| Int) (v_ArrVal_413 Int)) (and (= (select |#memory_int| |~#arr~0.base|) (store (store ((as const (Array Int Int)) 0) (+ |v_t1Thread1of1ForFork1_push_~stack#1.offset_152| (* |v_t1Thread1of1ForFork1_get_top_#res#1_145| 4)) (mod |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 4294967296)) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* 4 |t1Thread1of1ForFork1_get_top_#res#1|)) v_ArrVal_413)) (<= |~#arr~0.offset| |t1Thread1of1ForFork1_push_~stack#1.offset|) (< |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 400) (<= ~top~0 (+ |t1Thread1of1ForFork1_get_top_#res#1| 1)) (<= 0 |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48|))) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (= ~top~0 2) (= 3 |~#arr~0.base|)), Black: 510#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (= |~#arr~0.offset| 0) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (= 3 |~#arr~0.base|) (<= (+ 4294966897 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296)) 0) (forall ((v_ArrVal_306 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_306) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)))), Black: 726#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))))) (< (* ~top~0 4) 8)) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (< (* ~top~0 4) 4))), Black: 517#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (= |~#arr~0.offset| 0) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (<= (+ (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))))) 4294967296) 4294967296) 4294966897 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) 0) (= 3 |~#arr~0.base|) (<= (+ 4294966897 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296)) 0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647) (forall ((v_ArrVal_306 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_306) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), Black: 682#(and (= ~top~0 0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 399) (not (= 4294967294 (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 8))) 4294967296))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0)) (exists ((|v_t1Thread1of1ForFork1_push_~stack#1.offset_152| Int) (|t1Thread1of1ForFork1_get_top_#res#1| Int) (|aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| Int) (|t1Thread1of1ForFork1_push_~stack#1.offset| Int) (|v_t1Thread1of1ForFork1_get_top_#res#1_145| Int) (v_ArrVal_413 Int)) (and (= (mod (select (store (store ((as const (Array Int Int)) 0) (+ |v_t1Thread1of1ForFork1_push_~stack#1.offset_152| (* |v_t1Thread1of1ForFork1_get_top_#res#1_145| 4)) (mod |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 4294967296)) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* 4 |t1Thread1of1ForFork1_get_top_#res#1|)) v_ArrVal_413) 0) 4294967296) |t2Thread1of1ForFork0_pop_#res#1|) (<= 1 |t1Thread1of1ForFork1_get_top_#res#1|) (< |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 400) (<= 0 |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48|) (<= 0 |t1Thread1of1ForFork1_push_~stack#1.offset|))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), Black: 276#(or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 2147483649 |t2Thread1of1ForFork0_pop_#res#1|) 0)), Black: 758#(and (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (exists ((|v_t1Thread1of1ForFork1_push_~stack#1.offset_152| Int) (|t1Thread1of1ForFork1_get_top_#res#1| Int) (|aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| Int) (|t1Thread1of1ForFork1_push_~stack#1.offset| Int) (|v_t1Thread1of1ForFork1_get_top_#res#1_145| Int) (v_ArrVal_413 Int)) (and (= (mod (select (store (store ((as const (Array Int Int)) 0) (+ |v_t1Thread1of1ForFork1_push_~stack#1.offset_152| (* |v_t1Thread1of1ForFork1_get_top_#res#1_145| 4)) (mod |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 4294967296)) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* 4 |t1Thread1of1ForFork1_get_top_#res#1|)) v_ArrVal_413) 0) 4294967296) |t2Thread1of1ForFork0_pop_#res#1|) (<= 1 |t1Thread1of1ForFork1_get_top_#res#1|) (< |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 400) (<= 0 |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48|) (<= 0 |t1Thread1of1ForFork1_push_~stack#1.offset|)))), Black: 275#(and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0)) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0))) 2147483647)), Black: 770#(and (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (not (= 4294967294 (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 8))) 4294967296))) (exists ((|v_t1Thread1of1ForFork1_push_~stack#1.offset_152| Int) (|t1Thread1of1ForFork1_get_top_#res#1| Int) (|aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| Int) (|t1Thread1of1ForFork1_push_~stack#1.offset| Int) (|v_t1Thread1of1ForFork1_get_top_#res#1_145| Int) (v_ArrVal_413 Int)) (and (= (mod (select (store (store ((as const (Array Int Int)) 0) (+ |v_t1Thread1of1ForFork1_push_~stack#1.offset_152| (* |v_t1Thread1of1ForFork1_get_top_#res#1_145| 4)) (mod |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 4294967296)) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* 4 |t1Thread1of1ForFork1_get_top_#res#1|)) v_ArrVal_413) 0) 4294967296) |t2Thread1of1ForFork0_pop_#res#1|) (<= 1 |t1Thread1of1ForFork1_get_top_#res#1|) (< |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48| 400) (<= 0 |aux_mod_t1Thread1of1ForFork1_~tmp~0#1_48|) (<= 0 |t1Thread1of1ForFork1_push_~stack#1.offset|))) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (< (* ~top~0 4) 4))), Black: 732#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (< (* ~top~0 4) 4))), Black: 684#(and (not (= (+ 2 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294))), Black: 562#true, Black: 728#(and (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (or (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))))) (< (* ~top~0 4) 8)) (not (= 4294967294 (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 8))) 4294967296)))), Black: 160#(= ~top~0 0), Black: 289#(and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0)) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0))) 399) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 4294966897 |t2Thread1of1ForFork0_pop_#res#1|) 0))), Black: 285#(and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0)) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0))) 399) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|))), Black: 287#(or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 4294966897 |t2Thread1of1ForFork0_pop_#res#1|) 0)), 640#(not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)), 6#L1023-1true, Black: 546#(and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), Black: 554#(and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 4294966897 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (= 3 |~#arr~0.base|) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))), Black: 550#(and (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (or (<= 0 |t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 4294966897 |t2Thread1of1ForFork0_pop_#res#1|) 0)) (= 3 |~#arr~0.base|)), Black: 548#(and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* |t1Thread1of1ForFork1_inc_top_#t~post31#1| 4))) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) (* |t1Thread1of1ForFork1_inc_top_#t~post31#1| 4)) 399) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (= 3 |~#arr~0.base|)), 282#true, 385#(and (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 399) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)))), 63#t2EXITtrue, 166#true, 498#(and (= |~#arr~0.offset| 0) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (= 3 |~#arr~0.base|) (<= (+ 4294966897 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))))) 4294967296) 4294967296)) 0)), 271#true, 70#L945true, Black: 350#(< ~top~0 397), 538#(and (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|)), Black: 297#(<= ~top~0 2), Black: 299#(<= ~top~0 3), Black: 296#(<= ~top~0 1), Black: 339#(< ~top~0 399), Black: 331#(not (<= 400 ~top~0)), Black: 343#(< ~top~0 398), Black: 295#(= ~top~0 0), 293#true]) [2022-12-06 06:17:03,919 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-06 06:17:03,919 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 06:17:03,919 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 06:17:03,919 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 06:17:04,966 INFO L130 PetriNetUnfolder]: 2567/7990 cut-off events. [2022-12-06 06:17:04,966 INFO L131 PetriNetUnfolder]: For 50895/51160 co-relation queries the response was YES. [2022-12-06 06:17:05,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41187 conditions, 7990 events. 2567/7990 cut-off events. For 50895/51160 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 90673 event pairs, 623 based on Foata normal form. 13/7375 useless extension candidates. Maximal degree in co-relation 40158. Up to 2003 conditions per place. [2022-12-06 06:17:05,161 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 765 transitions, 13921 flow [2022-12-06 06:17:05,161 INFO L188 LiptonReduction]: Number of co-enabled transitions 5040 [2022-12-06 06:17:06,035 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 06:17:09,005 INFO L203 LiptonReduction]: Total number of compositions: 14 [2022-12-06 06:17:09,006 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5573 [2022-12-06 06:17:09,006 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 756 transitions, 13869 flow [2022-12-06 06:17:09,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.1) internal successors, (82), 20 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:17:09,006 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:09,006 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:09,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 06:17:09,211 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 06:17:09,212 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 06:17:09,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:09,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1230819847, now seen corresponding path program 2 times [2022-12-06 06:17:09,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:09,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694386913] [2022-12-06 06:17:09,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:09,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:09,909 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 06:17:09,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:09,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694386913] [2022-12-06 06:17:09,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694386913] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:17:09,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043083347] [2022-12-06 06:17:09,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 06:17:09,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:17:09,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:17:09,920 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 06:17:09,975 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 06:17:10,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 06:17:10,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 06:17:10,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 71 conjunts are in the unsatisfiable core [2022-12-06 06:17:10,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:17:10,194 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-06 06:17:10,194 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 06:17:10,233 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 06:17:10,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 06:17:10,336 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 06:17:10,368 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 06:17:10,494 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 06:17:18,114 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 06:17:18,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:17:18,196 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_484 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_484) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) is different from false [2022-12-06 06:17:19,632 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 06:17:19,638 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:17:19,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2022-12-06 06:17:19,650 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 06:17:19,655 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 06:17:21,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:17:21,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043083347] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:17:21,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:17:21,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 20 [2022-12-06 06:17:21,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221516997] [2022-12-06 06:17:21,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:17:21,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 06:17:21,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:21,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 06:17:21,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=4, NotChecked=38, Total=462 [2022-12-06 06:17:21,721 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 82 [2022-12-06 06:17:21,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 756 transitions, 13869 flow. Second operand has 22 states, 22 states have (on average 3.772727272727273) internal successors, (83), 22 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:17:21,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:21,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 82 [2022-12-06 06:17:21,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:24,977 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 06:17:27,282 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 06:17:29,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 06:17:31,314 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 06:17:33,352 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 06:17:37,418 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 06:17:39,545 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 06:17:41,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 06:17:41,670 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_~top~0 4))) (let ((.cse0 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (+ |c_~#arr~0.offset| (- 4) .cse2))) (and (forall ((|v_t1Thread1of1ForFork1_get_top_#res#1_264| Int) (|v_t1Thread1of1ForFork1_push_~stack#1.offset_271| Int) (v_ArrVal_482 Int) (v_ArrVal_484 (Array Int Int))) (or (< |v_t1Thread1of1ForFork1_push_~stack#1.offset_271| |c_~#arr~0.offset|) (not (<= c_~top~0 |v_t1Thread1of1ForFork1_get_top_#res#1_264|)) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_264| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_271|) v_ArrVal_482)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_484) |c_~#arr~0.base|) .cse1) 4294967296))))) (forall ((|v_t1Thread1of1ForFork1_get_top_#res#1_264| Int) (|v_t1Thread1of1ForFork1_push_~stack#1.offset_271| Int) (v_ArrVal_482 Int) (v_ArrVal_484 (Array Int Int))) (or (< |v_t1Thread1of1ForFork1_push_~stack#1.offset_271| |c_~#arr~0.offset|) (not (<= (+ c_~top~0 1) |v_t1Thread1of1ForFork1_get_top_#res#1_264|)) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_264| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_271|) v_ArrVal_482)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_484) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse2)) 4294967296))))) (forall ((v_ArrVal_484 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_484) |c_~#arr~0.base|) .cse1) 4294967296))))))) is different from false [2022-12-06 06:17:43,691 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 [1] [2022-12-06 06:17:46,050 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 06:17:48,624 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 06:17:50,707 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 06:17:52,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 06:17:54,815 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 06:17:56,840 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 06:18:01,020 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 06:18:03,040 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 06:18:05,067 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 06:18:08,082 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 06:18:10,169 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 06:18:12,522 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 06:18:16,772 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, 1] [2022-12-06 06:18:19,706 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 06:18:21,752 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 06:18:23,952 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 06:18:26,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 06:18:29,240 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 06:18:34,449 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 06:18:36,619 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 06:18:38,660 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 06:18:40,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 06:18:42,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 06:18:56,260 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 06:18:58,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 06:19:00,152 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 06:19:11,787 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 06:19:13,868 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 06:19:14,542 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_~top~0 4))) (let ((.cse0 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (+ |c_~#arr~0.offset| (- 4) .cse2))) (and (not (= (+ 2 |c_t2Thread1of1ForFork0_pop_#res#1|) 0)) (forall ((|v_t1Thread1of1ForFork1_get_top_#res#1_264| Int) (|v_t1Thread1of1ForFork1_push_~stack#1.offset_271| Int) (v_ArrVal_482 Int) (v_ArrVal_484 (Array Int Int))) (or (< |v_t1Thread1of1ForFork1_push_~stack#1.offset_271| |c_~#arr~0.offset|) (not (<= c_~top~0 |v_t1Thread1of1ForFork1_get_top_#res#1_264|)) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_264| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_271|) v_ArrVal_482)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_484) |c_~#arr~0.base|) .cse1) 4294967296))))) (forall ((|v_t1Thread1of1ForFork1_get_top_#res#1_264| Int) (|v_t1Thread1of1ForFork1_push_~stack#1.offset_271| Int) (v_ArrVal_482 Int) (v_ArrVal_484 (Array Int Int))) (or (< |v_t1Thread1of1ForFork1_push_~stack#1.offset_271| |c_~#arr~0.offset|) (not (<= (+ c_~top~0 1) |v_t1Thread1of1ForFork1_get_top_#res#1_264|)) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_264| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_271|) v_ArrVal_482)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_484) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse2)) 4294967296))))) (forall ((v_ArrVal_484 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_484) |c_~#arr~0.base|) .cse1) 4294967296))))))) is different from false [2022-12-06 06:19:16,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 06:19:21,281 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 06:19:25,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:19:26,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:19:27,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:19:44,699 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 06:19:47,173 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 06:19:50,069 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 06:19:51,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:19:56,485 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 06:19:56,515 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_~top~0 4))) (let ((.cse0 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (+ |c_~#arr~0.offset| (- 4) .cse2))) (and (or (<= 0 |c_t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 2147483649 |c_t2Thread1of1ForFork0_pop_#res#1|) 0)) (forall ((|v_t1Thread1of1ForFork1_get_top_#res#1_264| Int) (|v_t1Thread1of1ForFork1_push_~stack#1.offset_271| Int) (v_ArrVal_482 Int) (v_ArrVal_484 (Array Int Int))) (or (< |v_t1Thread1of1ForFork1_push_~stack#1.offset_271| |c_~#arr~0.offset|) (not (<= c_~top~0 |v_t1Thread1of1ForFork1_get_top_#res#1_264|)) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_264| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_271|) v_ArrVal_482)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_484) |c_~#arr~0.base|) .cse1) 4294967296))))) (forall ((|v_t1Thread1of1ForFork1_get_top_#res#1_264| Int) (|v_t1Thread1of1ForFork1_push_~stack#1.offset_271| Int) (v_ArrVal_482 Int) (v_ArrVal_484 (Array Int Int))) (or (< |v_t1Thread1of1ForFork1_push_~stack#1.offset_271| |c_~#arr~0.offset|) (not (<= (+ c_~top~0 1) |v_t1Thread1of1ForFork1_get_top_#res#1_264|)) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_264| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_271|) v_ArrVal_482)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_484) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse2)) 4294967296))))) (forall ((v_ArrVal_484 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_484) |c_~#arr~0.base|) .cse1) 4294967296))))))) is different from false [2022-12-06 06:19:59,704 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 06:20:01,733 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 06:20:03,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:20:05,221 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (* c_~top~0 4))) (and (or (<= 0 |c_t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 2147483649 |c_t2Thread1of1ForFork0_pop_#res#1|) 0)) (forall ((|v_t1Thread1of1ForFork1_get_top_#res#1_264| Int) (|v_t1Thread1of1ForFork1_push_~stack#1.offset_271| Int) (v_ArrVal_482 Int) (v_ArrVal_484 (Array Int Int))) (or (< |v_t1Thread1of1ForFork1_push_~stack#1.offset_271| |c_~#arr~0.offset|) (not (<= c_~top~0 |v_t1Thread1of1ForFork1_get_top_#res#1_264|)) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_264| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_271|) v_ArrVal_482)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_484) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse1)) 4294967296))))) (forall ((|v_t1Thread1of1ForFork1_get_top_#res#1_264| Int) (|v_t1Thread1of1ForFork1_push_~stack#1.offset_271| Int) (v_ArrVal_482 Int) (v_ArrVal_484 (Array Int Int))) (or (< |v_t1Thread1of1ForFork1_push_~stack#1.offset_271| |c_~#arr~0.offset|) (not (<= (+ c_~top~0 1) |v_t1Thread1of1ForFork1_get_top_#res#1_264|)) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_264| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_271|) v_ArrVal_482)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_484) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse1)) 4294967296))))))) is different from false [2022-12-06 06:20:05,288 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (* c_~top~0 4))) (and (forall ((|v_t1Thread1of1ForFork1_get_top_#res#1_264| Int) (|v_t1Thread1of1ForFork1_push_~stack#1.offset_271| Int) (v_ArrVal_482 Int) (v_ArrVal_484 (Array Int Int))) (or (< |v_t1Thread1of1ForFork1_push_~stack#1.offset_271| |c_~#arr~0.offset|) (not (<= c_~top~0 |v_t1Thread1of1ForFork1_get_top_#res#1_264|)) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_264| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_271|) v_ArrVal_482)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_484) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse1)) 4294967296))))) (forall ((|v_t1Thread1of1ForFork1_get_top_#res#1_264| Int) (|v_t1Thread1of1ForFork1_push_~stack#1.offset_271| Int) (v_ArrVal_482 Int) (v_ArrVal_484 (Array Int Int))) (or (< |v_t1Thread1of1ForFork1_push_~stack#1.offset_271| |c_~#arr~0.offset|) (not (<= (+ c_~top~0 1) |v_t1Thread1of1ForFork1_get_top_#res#1_264|)) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_264| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_271|) v_ArrVal_482)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_484) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse1)) 4294967296))))) (exists ((aux_div_v_arrayElimCell_20_49 Int) (aux_mod_v_arrayElimCell_20_49 Int)) (let ((.cse2 (* aux_div_v_arrayElimCell_20_49 4294967296))) (and (<= (+ aux_mod_v_arrayElimCell_20_49 .cse2 1) 0) (< aux_mod_v_arrayElimCell_20_49 4294967296) (< 0 (+ aux_mod_v_arrayElimCell_20_49 4294967297 .cse2)) (= |c_t2Thread1of1ForFork0_pop_#res#1| (mod (+ 4294967295 (* 4294967295 aux_mod_v_arrayElimCell_20_49)) 4294967296)) (<= 4294966896 aux_mod_v_arrayElimCell_20_49)))))) is different from false [2022-12-06 06:20:09,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:20:20,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 06:20:22,362 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 06:20:23,266 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_~top~0 4))) (let ((.cse0 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (+ |c_~#arr~0.offset| (- 4) .cse2))) (and (forall ((|v_t1Thread1of1ForFork1_get_top_#res#1_264| Int) (|v_t1Thread1of1ForFork1_push_~stack#1.offset_271| Int) (v_ArrVal_482 Int) (v_ArrVal_484 (Array Int Int))) (or (< |v_t1Thread1of1ForFork1_push_~stack#1.offset_271| |c_~#arr~0.offset|) (not (<= c_~top~0 |v_t1Thread1of1ForFork1_get_top_#res#1_264|)) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_264| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_271|) v_ArrVal_482)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_484) |c_~#arr~0.base|) .cse1) 4294967296))))) (forall ((|v_t1Thread1of1ForFork1_get_top_#res#1_264| Int) (|v_t1Thread1of1ForFork1_push_~stack#1.offset_271| Int) (v_ArrVal_482 Int) (v_ArrVal_484 (Array Int Int))) (or (< |v_t1Thread1of1ForFork1_push_~stack#1.offset_271| |c_~#arr~0.offset|) (not (<= (+ c_~top~0 1) |v_t1Thread1of1ForFork1_get_top_#res#1_264|)) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_264| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_271|) v_ArrVal_482)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_484) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse2)) 4294967296))))) (forall ((v_ArrVal_484 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_484) |c_~#arr~0.base|) .cse1) 4294967296)))) (exists ((aux_div_v_arrayElimCell_20_49 Int) (aux_mod_v_arrayElimCell_20_49 Int)) (let ((.cse3 (* aux_div_v_arrayElimCell_20_49 4294967296))) (and (<= (+ aux_mod_v_arrayElimCell_20_49 .cse3 1) 0) (< aux_mod_v_arrayElimCell_20_49 4294967296) (< 0 (+ aux_mod_v_arrayElimCell_20_49 4294967297 .cse3)) (= |c_t2Thread1of1ForFork0_pop_#res#1| (mod (+ 4294967295 (* 4294967295 aux_mod_v_arrayElimCell_20_49)) 4294967296)) (<= 4294966896 aux_mod_v_arrayElimCell_20_49))))))) is different from false [2022-12-06 06:20:25,284 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 06:20:32,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 06:20:42,564 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 06:20:45,883 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 06:20:47,993 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 06:20:53,325 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 06:20:56,217 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, 1] [2022-12-06 06:21:02,601 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 06:21:03,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 06:21:11,765 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 06:21:14,092 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 06:21:15,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 06:21:19,425 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, 1] [2022-12-06 06:21:22,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 06:21:26,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, 1] [2022-12-06 06:21:28,846 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 06:21:31,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 06:21:32,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 06:21:35,179 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 06:21:36,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 06:21:39,232 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, 1] [2022-12-06 06:21:40,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 06:21:42,862 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 06:21:46,279 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 06:21:48,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 06:21:50,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 06:21:53,079 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 06:21:55,113 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, 1] [2022-12-06 06:21:55,285 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_~top~0 4))) (let ((.cse1 (+ |c_~#arr~0.offset| (- 4) .cse2)) (.cse0 (select |c_#memory_int| |c_~#arr~0.base|))) (and (or (<= 0 |c_t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 2147483649 |c_t2Thread1of1ForFork0_pop_#res#1|) 0)) (forall ((|v_t1Thread1of1ForFork1_get_top_#res#1_264| Int) (|v_t1Thread1of1ForFork1_push_~stack#1.offset_271| Int) (v_ArrVal_482 Int) (v_ArrVal_484 (Array Int Int))) (or (< |v_t1Thread1of1ForFork1_push_~stack#1.offset_271| |c_~#arr~0.offset|) (not (<= c_~top~0 |v_t1Thread1of1ForFork1_get_top_#res#1_264|)) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_264| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_271|) v_ArrVal_482)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_484) |c_~#arr~0.base|) .cse1) 4294967296))))) (forall ((|v_t1Thread1of1ForFork1_get_top_#res#1_264| Int) (|v_t1Thread1of1ForFork1_push_~stack#1.offset_271| Int) (v_ArrVal_482 Int) (v_ArrVal_484 (Array Int Int))) (or (< |v_t1Thread1of1ForFork1_push_~stack#1.offset_271| |c_~#arr~0.offset|) (not (<= (+ c_~top~0 1) |v_t1Thread1of1ForFork1_get_top_#res#1_264|)) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_264| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_271|) v_ArrVal_482)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_484) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse2)) 4294967296))))) (= |c_~#arr~0.offset| 0) (or (let ((.cse3 (select .cse0 (+ .cse2 (- 8))))) (and (<= .cse3 2147483647) (<= 0 .cse3))) (< .cse2 8)) (<= .cse2 8) (forall ((v_ArrVal_484 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_484) |c_~#arr~0.base|) .cse1) 4294967296)))) (or (<= c_~top~0 0) (let ((.cse4 (select .cse0 (+ (- 4) .cse2)))) (and (<= .cse4 2147483647) (<= 0 .cse4))))))) is different from false [2022-12-06 06:21:57,299 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 06:21:58,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 06:22:01,424 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 06:22:01,997 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~top~0 4))) (let ((.cse1 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse2 (+ |c_~#arr~0.offset| (- 4) .cse0))) (and (or (<= 0 |c_t2Thread1of1ForFork0_pop_#res#1|) (<= (+ 2147483649 |c_t2Thread1of1ForFork0_pop_#res#1|) 0)) (<= .cse0 4) (forall ((|v_t1Thread1of1ForFork1_get_top_#res#1_264| Int) (|v_t1Thread1of1ForFork1_push_~stack#1.offset_271| Int) (v_ArrVal_482 Int) (v_ArrVal_484 (Array Int Int))) (or (< |v_t1Thread1of1ForFork1_push_~stack#1.offset_271| |c_~#arr~0.offset|) (not (<= c_~top~0 |v_t1Thread1of1ForFork1_get_top_#res#1_264|)) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_264| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_271|) v_ArrVal_482)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_484) |c_~#arr~0.base|) .cse2) 4294967296))))) (forall ((|v_t1Thread1of1ForFork1_get_top_#res#1_264| Int) (|v_t1Thread1of1ForFork1_push_~stack#1.offset_271| Int) (v_ArrVal_482 Int) (v_ArrVal_484 (Array Int Int))) (or (< |v_t1Thread1of1ForFork1_push_~stack#1.offset_271| |c_~#arr~0.offset|) (not (<= (+ c_~top~0 1) |v_t1Thread1of1ForFork1_get_top_#res#1_264|)) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_264| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_271|) v_ArrVal_482)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_484) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse0)) 4294967296))))) (= |c_~#arr~0.offset| 0) (or (< .cse0 4) (let ((.cse3 (select .cse1 (+ (- 4) .cse0)))) (and (<= .cse3 2147483647) (<= 0 .cse3)))) (forall ((v_ArrVal_484 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_484) |c_~#arr~0.base|) .cse2) 4294967296))))))) is different from false [2022-12-06 06:22:04,137 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 06:22:06,299 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 06:22:08,321 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, 1] [2022-12-06 06:22:09,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 06:22:11,849 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 06:22:13,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 06:22:16,529 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 06:22:18,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:22:18,332 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse0 (* c_~top~0 4))) (and (not (= (+ 2 |c_t2Thread1of1ForFork0_pop_#res#1|) 0)) (<= .cse0 4) (forall ((|v_t1Thread1of1ForFork1_get_top_#res#1_264| Int) (|v_t1Thread1of1ForFork1_push_~stack#1.offset_271| Int) (v_ArrVal_482 Int) (v_ArrVal_484 (Array Int Int))) (or (< |v_t1Thread1of1ForFork1_push_~stack#1.offset_271| |c_~#arr~0.offset|) (not (<= c_~top~0 |v_t1Thread1of1ForFork1_get_top_#res#1_264|)) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_264| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_271|) v_ArrVal_482)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_484) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse0)) 4294967296))))) (forall ((|v_t1Thread1of1ForFork1_get_top_#res#1_264| Int) (|v_t1Thread1of1ForFork1_push_~stack#1.offset_271| Int) (v_ArrVal_482 Int) (v_ArrVal_484 (Array Int Int))) (or (< |v_t1Thread1of1ForFork1_push_~stack#1.offset_271| |c_~#arr~0.offset|) (not (<= (+ c_~top~0 1) |v_t1Thread1of1ForFork1_get_top_#res#1_264|)) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_264| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_271|) v_ArrVal_482)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_484) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse0)) 4294967296))))) (= |c_~#arr~0.offset| 0) (or (< .cse0 4) (let ((.cse2 (select .cse1 (+ (- 4) .cse0)))) (and (<= .cse2 2147483647) (<= 0 .cse2)))))) is different from false [2022-12-06 06:22:18,355 INFO L130 PetriNetUnfolder]: 29064/56099 cut-off events. [2022-12-06 06:22:18,355 INFO L131 PetriNetUnfolder]: For 502007/502007 co-relation queries the response was YES. [2022-12-06 06:22:18,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302694 conditions, 56099 events. 29064/56099 cut-off events. For 502007/502007 co-relation queries the response was YES. Maximal size of possible extension queue 2409. Compared 555587 event pairs, 6977 based on Foata normal form. 768/56867 useless extension candidates. Maximal degree in co-relation 297279. Up to 16566 conditions per place. [2022-12-06 06:22:19,238 INFO L137 encePairwiseOnDemand]: 15/82 looper letters, 1092 selfloop transitions, 1628 changer transitions 175/2897 dead transitions. [2022-12-06 06:22:19,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 2897 transitions, 51054 flow [2022-12-06 06:22:19,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2022-12-06 06:22:19,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2022-12-06 06:22:19,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 1615 transitions. [2022-12-06 06:22:19,244 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16143542582966813 [2022-12-06 06:22:19,244 INFO L175 Difference]: Start difference. First operand has 200 places, 756 transitions, 13869 flow. Second operand 122 states and 1615 transitions. [2022-12-06 06:22:19,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 2897 transitions, 51054 flow [2022-12-06 06:22:22,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 2897 transitions, 50143 flow, removed 408 selfloop flow, removed 14 redundant places. [2022-12-06 06:22:22,559 INFO L231 Difference]: Finished difference. Result has 376 places, 2139 transitions, 45284 flow [2022-12-06 06:22:22,559 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=11551, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=645, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=440, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=122, PETRI_FLOW=45284, PETRI_PLACES=376, PETRI_TRANSITIONS=2139} [2022-12-06 06:22:22,560 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 334 predicate places. [2022-12-06 06:22:22,560 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:22,560 INFO L89 Accepts]: Start accepts. Operand has 376 places, 2139 transitions, 45284 flow [2022-12-06 06:22:22,566 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:22,566 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:22,566 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 376 places, 2139 transitions, 45284 flow [2022-12-06 06:22:22,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 375 places, 2139 transitions, 45284 flow [2022-12-06 06:22:37,127 INFO L130 PetriNetUnfolder]: 18364/40235 cut-off events. [2022-12-06 06:22:37,128 INFO L131 PetriNetUnfolder]: For 3858931/3883949 co-relation queries the response was YES. [2022-12-06 06:22:38,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 529487 conditions, 40235 events. 18364/40235 cut-off events. For 3858931/3883949 co-relation queries the response was YES. Maximal size of possible extension queue 2192. Compared 443706 event pairs, 8086 based on Foata normal form. 118/38062 useless extension candidates. Maximal degree in co-relation 525021. Up to 20340 conditions per place. [2022-12-06 06:22:39,575 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 375 places, 2139 transitions, 45284 flow [2022-12-06 06:22:39,575 INFO L188 LiptonReduction]: Number of co-enabled transitions 11888 [2022-12-06 06:22:39,850 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 06:22:40,138 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 06:22:40,527 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 06:22:41,135 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 06:22:41,575 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [661] L991-6-->L1023-1: Formula: (let ((.cse0 (mod |v_t1Thread1of1ForFork1_~tmp~0#1_131| 4294967296)) (.cse1 (select |v_#pthreadsMutex_571| |v_~#m~0.base_254|))) (and (< |v_t1Thread1of1ForFork1_~i~0#1_221| 400) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_106| |v_~#arr~0.offset_112|) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_106| |v_t1Thread1of1ForFork1_push_~stack#1.offset_128|) (= |v_t1Thread1of1ForFork1_#t~nondet40#1_171| |v_t1Thread1of1ForFork1_~tmp~0#1_131|) (<= 0 (+ |v_t1Thread1of1ForFork1_get_top_#res#1_121| 2147483648)) (<= |v_t1Thread1of1ForFork1_get_top_#res#1_121| 2147483647) (not (= 400 v_~top~0_516)) (= |v_t1Thread1of1ForFork1_get_top_#res#1_121| v_~top~0_516) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_120| (ite (< .cse0 400) 1 0)) (= |v_t1Thread1of1ForFork1_push_~stack#1.base_128| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_106|) (not (= |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_128| 0)) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.base_106| |v_~#arr~0.base_117|) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_120| |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_128|) (= (store |v_#pthreadsMutex_571| |v_~#m~0.base_254| (store .cse1 |v_~#m~0.offset_254| 1)) |v_#pthreadsMutex_570|) (= |v_t1Thread1of1ForFork1_push_#in~x#1_106| (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) (= (select (select |v_#memory_int_230| |v_ULTIMATE.start_main_~#id1~0#1.base_29|) |v_ULTIMATE.start_main_~#id1~0#1.offset_29|) |v_ULTIMATE.start_main_#t~mem49#1_28|) (= |v_t1Thread1of1ForFork1_push_#in~x#1_106| |v_t1Thread1of1ForFork1_push_~x#1_128|) (= (select .cse1 |v_~#m~0.offset_254|) 0) (= |v_#memory_int_230| (store |v_#memory_int_231| |v_t1Thread1of1ForFork1_push_~stack#1.base_128| (store (select |v_#memory_int_231| |v_t1Thread1of1ForFork1_push_~stack#1.base_128|) (+ |v_t1Thread1of1ForFork1_push_~stack#1.offset_128| (* |v_t1Thread1of1ForFork1_get_top_#res#1_121| 4)) |v_t1Thread1of1ForFork1_push_~x#1_128|))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_571|, ~#arr~0.offset=|v_~#arr~0.offset_112|, ~#m~0.base=|v_~#m~0.base_254|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_221|, ~#m~0.offset=|v_~#m~0.offset_254|, #memory_int=|v_#memory_int_231|, ~top~0=v_~top~0_516, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_29|, ~#arr~0.base=|v_~#arr~0.base_117|, t1Thread1of1ForFork1_#t~nondet40#1=|v_t1Thread1of1ForFork1_#t~nondet40#1_171|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_29|} OutVars{t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_221|, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_120|, t1Thread1of1ForFork1_push_#in~stack#1.offset=|v_t1Thread1of1ForFork1_push_#in~stack#1.offset_106|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_46|, ~top~0=v_~top~0_516, t1Thread1of1ForFork1_push_#in~x#1=|v_t1Thread1of1ForFork1_push_#in~x#1_106|, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_239|, t1Thread1of1ForFork1_get_top_#res#1=|v_t1Thread1of1ForFork1_get_top_#res#1_121|, ULTIMATE.start_main_#t~nondet48#1=|v_ULTIMATE.start_main_#t~nondet48#1_25|, t1Thread1of1ForFork1_#t~nondet39#1=|v_t1Thread1of1ForFork1_#t~nondet39#1_116|, t1Thread1of1ForFork1_push_~stack#1.base=|v_t1Thread1of1ForFork1_push_~stack#1.base_128|, ~#arr~0.base=|v_~#arr~0.base_117|, #pthreadsMutex=|v_#pthreadsMutex_570|, ~#arr~0.offset=|v_~#arr~0.offset_112|, t1Thread1of1ForFork1_push_~x#1=|v_t1Thread1of1ForFork1_push_~x#1_128|, t1Thread1of1ForFork1_push_#t~ret34#1=|v_t1Thread1of1ForFork1_push_#t~ret34#1_150|, t1Thread1of1ForFork1_push_#in~stack#1.base=|v_t1Thread1of1ForFork1_push_#in~stack#1.base_106|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_29|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_29|, ULTIMATE.start_main_#t~mem49#1=|v_ULTIMATE.start_main_#t~mem49#1_28|, ~#m~0.base=|v_~#m~0.base_254|, ~#m~0.offset=|v_~#m~0.offset_254|, t1Thread1of1ForFork1_~tmp~0#1=|v_t1Thread1of1ForFork1_~tmp~0#1_131|, #memory_int=|v_#memory_int_230|, t1Thread1of1ForFork1_push_~stack#1.offset=|v_t1Thread1of1ForFork1_push_~stack#1.offset_128|, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_128|, t1Thread1of1ForFork1_push_#t~nondet33#1=|v_t1Thread1of1ForFork1_push_#t~nondet33#1_105|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_383|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_push_~x#1, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, t1Thread1of1ForFork1_push_#in~stack#1.offset, t1Thread1of1ForFork1_push_#t~ret34#1, t1Thread1of1ForFork1_push_#in~stack#1.base, ULTIMATE.start_main_#t~pre47#1, t1Thread1of1ForFork1_push_#in~x#1, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_#t~nondet40#1, t1Thread1of1ForFork1_get_top_#res#1, ULTIMATE.start_main_#t~mem49#1, ULTIMATE.start_main_#t~nondet48#1, t1Thread1of1ForFork1_~tmp~0#1, #memory_int, t1Thread1of1ForFork1_#t~nondet39#1, t1Thread1of1ForFork1_push_~stack#1.offset, t1Thread1of1ForFork1_push_~stack#1.base, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1, t1Thread1of1ForFork1_push_#t~nondet33#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] and [628] L945-->L991-6: Formula: (and (= (store |v_#pthreadsMutex_407| |v_~#m~0.base_190| (store (select |v_#pthreadsMutex_407| |v_~#m~0.base_190|) |v_~#m~0.offset_190| 0)) |v_#pthreadsMutex_406|) (= v_~top~0_414 (+ v_~top~0_415 1)) (= |v_t1Thread1of1ForFork1_~i~0#1_140| (+ |v_t1Thread1of1ForFork1_~i~0#1_141| 1)) (= |v_t1Thread1of1ForFork1_push_#res#1_168| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_407|, ~#m~0.base=|v_~#m~0.base_190|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_141|, ~#m~0.offset=|v_~#m~0.offset_190|, ~top~0=v_~top~0_415} OutVars{t1Thread1of1ForFork1_#t~post38#1=|v_t1Thread1of1ForFork1_#t~post38#1_71|, #pthreadsMutex=|v_#pthreadsMutex_406|, ~#m~0.base=|v_~#m~0.base_190|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_140|, ~#m~0.offset=|v_~#m~0.offset_190|, t1Thread1of1ForFork1_#t~ret41#1=|v_t1Thread1of1ForFork1_#t~ret41#1_198|, ~top~0=v_~top~0_414, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_168|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_303|} 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 06:22:41,789 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [661] L991-6-->L1023-1: Formula: (let ((.cse0 (mod |v_t1Thread1of1ForFork1_~tmp~0#1_131| 4294967296)) (.cse1 (select |v_#pthreadsMutex_571| |v_~#m~0.base_254|))) (and (< |v_t1Thread1of1ForFork1_~i~0#1_221| 400) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_106| |v_~#arr~0.offset_112|) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_106| |v_t1Thread1of1ForFork1_push_~stack#1.offset_128|) (= |v_t1Thread1of1ForFork1_#t~nondet40#1_171| |v_t1Thread1of1ForFork1_~tmp~0#1_131|) (<= 0 (+ |v_t1Thread1of1ForFork1_get_top_#res#1_121| 2147483648)) (<= |v_t1Thread1of1ForFork1_get_top_#res#1_121| 2147483647) (not (= 400 v_~top~0_516)) (= |v_t1Thread1of1ForFork1_get_top_#res#1_121| v_~top~0_516) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_120| (ite (< .cse0 400) 1 0)) (= |v_t1Thread1of1ForFork1_push_~stack#1.base_128| |v_t1Thread1of1ForFork1_push_#in~stack#1.base_106|) (not (= |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_128| 0)) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.base_106| |v_~#arr~0.base_117|) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_120| |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_128|) (= (store |v_#pthreadsMutex_571| |v_~#m~0.base_254| (store .cse1 |v_~#m~0.offset_254| 1)) |v_#pthreadsMutex_570|) (= |v_t1Thread1of1ForFork1_push_#in~x#1_106| (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) (= (select (select |v_#memory_int_230| |v_ULTIMATE.start_main_~#id1~0#1.base_29|) |v_ULTIMATE.start_main_~#id1~0#1.offset_29|) |v_ULTIMATE.start_main_#t~mem49#1_28|) (= |v_t1Thread1of1ForFork1_push_#in~x#1_106| |v_t1Thread1of1ForFork1_push_~x#1_128|) (= (select .cse1 |v_~#m~0.offset_254|) 0) (= |v_#memory_int_230| (store |v_#memory_int_231| |v_t1Thread1of1ForFork1_push_~stack#1.base_128| (store (select |v_#memory_int_231| |v_t1Thread1of1ForFork1_push_~stack#1.base_128|) (+ |v_t1Thread1of1ForFork1_push_~stack#1.offset_128| (* |v_t1Thread1of1ForFork1_get_top_#res#1_121| 4)) |v_t1Thread1of1ForFork1_push_~x#1_128|))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_571|, ~#arr~0.offset=|v_~#arr~0.offset_112|, ~#m~0.base=|v_~#m~0.base_254|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_221|, ~#m~0.offset=|v_~#m~0.offset_254|, #memory_int=|v_#memory_int_231|, ~top~0=v_~top~0_516, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_29|, ~#arr~0.base=|v_~#arr~0.base_117|, t1Thread1of1ForFork1_#t~nondet40#1=|v_t1Thread1of1ForFork1_#t~nondet40#1_171|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_29|} OutVars{t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_221|, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_120|, t1Thread1of1ForFork1_push_#in~stack#1.offset=|v_t1Thread1of1ForFork1_push_#in~stack#1.offset_106|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_46|, ~top~0=v_~top~0_516, t1Thread1of1ForFork1_push_#in~x#1=|v_t1Thread1of1ForFork1_push_#in~x#1_106|, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_239|, t1Thread1of1ForFork1_get_top_#res#1=|v_t1Thread1of1ForFork1_get_top_#res#1_121|, ULTIMATE.start_main_#t~nondet48#1=|v_ULTIMATE.start_main_#t~nondet48#1_25|, t1Thread1of1ForFork1_#t~nondet39#1=|v_t1Thread1of1ForFork1_#t~nondet39#1_116|, t1Thread1of1ForFork1_push_~stack#1.base=|v_t1Thread1of1ForFork1_push_~stack#1.base_128|, ~#arr~0.base=|v_~#arr~0.base_117|, #pthreadsMutex=|v_#pthreadsMutex_570|, ~#arr~0.offset=|v_~#arr~0.offset_112|, t1Thread1of1ForFork1_push_~x#1=|v_t1Thread1of1ForFork1_push_~x#1_128|, t1Thread1of1ForFork1_push_#t~ret34#1=|v_t1Thread1of1ForFork1_push_#t~ret34#1_150|, t1Thread1of1ForFork1_push_#in~stack#1.base=|v_t1Thread1of1ForFork1_push_#in~stack#1.base_106|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_29|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_29|, ULTIMATE.start_main_#t~mem49#1=|v_ULTIMATE.start_main_#t~mem49#1_28|, ~#m~0.base=|v_~#m~0.base_254|, ~#m~0.offset=|v_~#m~0.offset_254|, t1Thread1of1ForFork1_~tmp~0#1=|v_t1Thread1of1ForFork1_~tmp~0#1_131|, #memory_int=|v_#memory_int_230|, t1Thread1of1ForFork1_push_~stack#1.offset=|v_t1Thread1of1ForFork1_push_~stack#1.offset_128|, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_128|, t1Thread1of1ForFork1_push_#t~nondet33#1=|v_t1Thread1of1ForFork1_push_#t~nondet33#1_105|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_383|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_push_~x#1, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, t1Thread1of1ForFork1_push_#in~stack#1.offset, t1Thread1of1ForFork1_push_#t~ret34#1, t1Thread1of1ForFork1_push_#in~stack#1.base, ULTIMATE.start_main_#t~pre47#1, t1Thread1of1ForFork1_push_#in~x#1, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_#t~nondet40#1, t1Thread1of1ForFork1_get_top_#res#1, ULTIMATE.start_main_#t~mem49#1, ULTIMATE.start_main_#t~nondet48#1, t1Thread1of1ForFork1_~tmp~0#1, #memory_int, t1Thread1of1ForFork1_#t~nondet39#1, t1Thread1of1ForFork1_push_~stack#1.offset, 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 06:22:42,478 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 06:22:42,714 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 06:22:43,464 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L945-->L991-6: Formula: (and (= (+ v_~top~0_446 1) v_~top~0_445) (= |v_t1Thread1of1ForFork1_push_#res#1_190| 0) (= |v_t1Thread1of1ForFork1_~i~0#1_163| (+ |v_t1Thread1of1ForFork1_~i~0#1_164| 1)) (= (store |v_#pthreadsMutex_452| |v_~#m~0.base_208| (store (select |v_#pthreadsMutex_452| |v_~#m~0.base_208|) |v_~#m~0.offset_208| 0)) |v_#pthreadsMutex_451|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_452|, ~#m~0.base=|v_~#m~0.base_208|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_164|, ~#m~0.offset=|v_~#m~0.offset_208|, ~top~0=v_~top~0_446} OutVars{t1Thread1of1ForFork1_#t~post38#1=|v_t1Thread1of1ForFork1_#t~post38#1_83|, #pthreadsMutex=|v_#pthreadsMutex_451|, ~#m~0.base=|v_~#m~0.base_208|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_163|, ~#m~0.offset=|v_~#m~0.offset_208|, t1Thread1of1ForFork1_#t~ret41#1=|v_t1Thread1of1ForFork1_#t~ret41#1_221|, ~top~0=v_~top~0_445, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_190|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_320|} 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] 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 06:22:43,803 INFO L203 LiptonReduction]: Total number of compositions: 11 [2022-12-06 06:22:43,803 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21243 [2022-12-06 06:22:43,803 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 2132 transitions, 45355 flow [2022-12-06 06:22:43,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.772727272727273) internal successors, (83), 22 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:22:43,804 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:43,804 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:43,809 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 06:22:44,004 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 06:22:44,005 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 06:22:44,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:44,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1799370501, now seen corresponding path program 1 times [2022-12-06 06:22:44,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:44,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479131119] [2022-12-06 06:22:44,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:44,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:44,080 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:22:44,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:44,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479131119] [2022-12-06 06:22:44,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479131119] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:22:44,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934397684] [2022-12-06 06:22:44,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:44,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:22:44,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:22:44,082 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 06:22:44,090 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 06:22:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:44,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 06:22:44,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:22:44,208 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:22:44,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:22:44,267 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:22:44,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934397684] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:22:44,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:22:44,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-06 06:22:44,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749328687] [2022-12-06 06:22:44,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:22:44,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 06:22:44,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:44,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 06:22:44,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2022-12-06 06:22:44,269 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 93 [2022-12-06 06:22:44,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 2132 transitions, 45355 flow. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:22:44,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:44,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 93 [2022-12-06 06:22:44,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:23:22,164 INFO L130 PetriNetUnfolder]: 33281/64221 cut-off events. [2022-12-06 06:23:22,164 INFO L131 PetriNetUnfolder]: For 6748955/6748955 co-relation queries the response was YES. [2022-12-06 06:23:24,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 890218 conditions, 64221 events. 33281/64221 cut-off events. For 6748955/6748955 co-relation queries the response was YES. Maximal size of possible extension queue 2936. Compared 662011 event pairs, 6364 based on Foata normal form. 421/64642 useless extension candidates. Maximal degree in co-relation 886194. Up to 30761 conditions per place. [2022-12-06 06:23:24,585 INFO L137 encePairwiseOnDemand]: 37/93 looper letters, 1277 selfloop transitions, 1712 changer transitions 82/3073 dead transitions. [2022-12-06 06:23:24,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 3073 transitions, 68669 flow [2022-12-06 06:23:24,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 06:23:24,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 06:23:24,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 377 transitions. [2022-12-06 06:23:24,587 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1930363543266769 [2022-12-06 06:23:24,587 INFO L175 Difference]: Start difference. First operand has 368 places, 2132 transitions, 45355 flow. Second operand 21 states and 377 transitions. [2022-12-06 06:23:24,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 3073 transitions, 68669 flow [2022-12-06 06:24:32,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 3073 transitions, 66286 flow, removed 1144 selfloop flow, removed 20 redundant places. [2022-12-06 06:24:32,958 INFO L231 Difference]: Finished difference. Result has 357 places, 2379 transitions, 54943 flow [2022-12-06 06:24:32,961 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=40479, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1944, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1368, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=54943, PETRI_PLACES=357, PETRI_TRANSITIONS=2379} [2022-12-06 06:24:32,961 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 315 predicate places. [2022-12-06 06:24:32,961 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:24:32,961 INFO L89 Accepts]: Start accepts. Operand has 357 places, 2379 transitions, 54943 flow [2022-12-06 06:24:32,975 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:24:32,975 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:24:32,975 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 357 places, 2379 transitions, 54943 flow [2022-12-06 06:24:33,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 357 places, 2379 transitions, 54943 flow