/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 22:52:06,612 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 22:52:06,613 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 22:52:06,636 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 22:52:06,636 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 22:52:06,638 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 22:52:06,641 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 22:52:06,643 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 22:52:06,646 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 22:52:06,649 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 22:52:06,650 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 22:52:06,651 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 22:52:06,651 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 22:52:06,653 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 22:52:06,654 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 22:52:06,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 22:52:06,656 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 22:52:06,657 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 22:52:06,659 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 22:52:06,661 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 22:52:06,662 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 22:52:06,664 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 22:52:06,665 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 22:52:06,666 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 22:52:06,670 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 22:52:06,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 22:52:06,671 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 22:52:06,672 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 22:52:06,672 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 22:52:06,672 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 22:52:06,672 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 22:52:06,673 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 22:52:06,673 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 22:52:06,674 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 22:52:06,674 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 22:52:06,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 22:52:06,675 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 22:52:06,675 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 22:52:06,675 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 22:52:06,675 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 22:52:06,676 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 22:52:06,680 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 22:52:06,700 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 22:52:06,700 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 22:52:06,701 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 22:52:06,701 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 22:52:06,701 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 22:52:06,701 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 22:52:06,701 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 22:52:06,701 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 22:52:06,701 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 22:52:06,701 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 22:52:06,701 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 22:52:06,720 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 22:52:06,720 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 22:52:06,720 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 22:52:06,720 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 22:52:06,720 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 22:52:06,720 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 22:52:06,721 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 22:52:06,721 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 22:52:06,721 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 22:52:06,721 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 22:52:06,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:52:06,721 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 22:52:06,721 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 22:52:06,721 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 22:52:06,721 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 22:52:06,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 22:52:06,721 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 22:52:06,722 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-05 22:52:06,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 22:52:06,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 22:52:07,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 22:52:07,001 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 22:52:07,001 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 22:52:07,002 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack-1.i [2022-12-05 22:52:07,897 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 22:52:08,150 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 22:52:08,151 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i [2022-12-05 22:52:08,159 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/083f05762/936e4c1ae2834b3aaf55daffb14c5a3b/FLAG913dc3c89 [2022-12-05 22:52:08,169 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/083f05762/936e4c1ae2834b3aaf55daffb14c5a3b [2022-12-05 22:52:08,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 22:52:08,173 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 22:52:08,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 22:52:08,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 22:52:08,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 22:52:08,178 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:52:08" (1/1) ... [2022-12-05 22:52:08,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11e15a83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:08, skipping insertion in model container [2022-12-05 22:52:08,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:52:08" (1/1) ... [2022-12-05 22:52:08,184 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 22:52:08,206 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 22:52:08,472 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-1.i[41520,41533] [2022-12-05 22:52:08,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:52:08,510 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 22:52:08,553 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-1.i[41520,41533] [2022-12-05 22:52:08,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:52:08,611 INFO L208 MainTranslator]: Completed translation [2022-12-05 22:52:08,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:08 WrapperNode [2022-12-05 22:52:08,612 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 22:52:08,612 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 22:52:08,613 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 22:52:08,614 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 22:52:08,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:08" (1/1) ... [2022-12-05 22:52:08,634 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:08" (1/1) ... [2022-12-05 22:52:08,650 INFO L138 Inliner]: procedures = 277, calls = 43, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 152 [2022-12-05 22:52:08,650 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 22:52:08,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 22:52:08,651 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 22:52:08,651 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 22:52:08,657 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:08" (1/1) ... [2022-12-05 22:52:08,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:08" (1/1) ... [2022-12-05 22:52:08,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:08" (1/1) ... [2022-12-05 22:52:08,660 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:08" (1/1) ... [2022-12-05 22:52:08,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:08" (1/1) ... [2022-12-05 22:52:08,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:08" (1/1) ... [2022-12-05 22:52:08,668 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:08" (1/1) ... [2022-12-05 22:52:08,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:08" (1/1) ... [2022-12-05 22:52:08,671 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 22:52:08,671 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 22:52:08,671 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 22:52:08,672 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 22:52:08,672 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:08" (1/1) ... [2022-12-05 22:52:08,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:52:08,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:52:08,694 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-05 22:52:08,705 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-05 22:52:08,723 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-05 22:52:08,723 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-05 22:52:08,723 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-05 22:52:08,724 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-05 22:52:08,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 22:52:08,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 22:52:08,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 22:52:08,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 22:52:08,724 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-05 22:52:08,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 22:52:08,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 22:52:08,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 22:52:08,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 22:52:08,725 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 22:52:08,863 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 22:52:08,865 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 22:52:09,134 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 22:52:09,140 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 22:52:09,140 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-05 22:52:09,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:52:09 BoogieIcfgContainer [2022-12-05 22:52:09,142 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 22:52:09,143 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 22:52:09,143 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 22:52:09,149 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 22:52:09,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 10:52:08" (1/3) ... [2022-12-05 22:52:09,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ccedcc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:52:09, skipping insertion in model container [2022-12-05 22:52:09,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:08" (2/3) ... [2022-12-05 22:52:09,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ccedcc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:52:09, skipping insertion in model container [2022-12-05 22:52:09,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:52:09" (3/3) ... [2022-12-05 22:52:09,150 INFO L112 eAbstractionObserver]: Analyzing ICFG stack-1.i [2022-12-05 22:52:09,163 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 22:52:09,163 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 22:52:09,163 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 22:52:09,240 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-05 22:52:09,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 154 transitions, 324 flow [2022-12-05 22:52:09,335 INFO L130 PetriNetUnfolder]: 10/152 cut-off events. [2022-12-05 22:52:09,336 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 22:52:09,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 152 events. 10/152 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/140 useless extension candidates. Maximal degree in co-relation 110. Up to 3 conditions per place. [2022-12-05 22:52:09,341 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 154 transitions, 324 flow [2022-12-05 22:52:09,347 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 143 transitions, 295 flow [2022-12-05 22:52:09,348 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:09,365 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 143 transitions, 295 flow [2022-12-05 22:52:09,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 143 transitions, 295 flow [2022-12-05 22:52:09,410 INFO L130 PetriNetUnfolder]: 10/143 cut-off events. [2022-12-05 22:52:09,410 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 22:52:09,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 143 events. 10/143 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 310 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 110. Up to 3 conditions per place. [2022-12-05 22:52:09,415 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 143 transitions, 295 flow [2022-12-05 22:52:09,416 INFO L188 LiptonReduction]: Number of co-enabled transitions 6382 [2022-12-05 22:52:13,289 INFO L203 LiptonReduction]: Total number of compositions: 114 [2022-12-05 22:52:13,305 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 22:52:13,310 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5abd919a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 22:52:13,310 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 22:52:13,312 INFO L130 PetriNetUnfolder]: 1/20 cut-off events. [2022-12-05 22:52:13,313 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 22:52:13,313 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:13,313 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-05 22:52:13,313 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:52:13,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:13,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1180676574, now seen corresponding path program 1 times [2022-12-05 22:52:13,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:13,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686803973] [2022-12-05 22:52:13,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:13,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:13,521 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-05 22:52:13,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:13,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686803973] [2022-12-05 22:52:13,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686803973] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:52:13,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:52:13,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:52:13,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637509923] [2022-12-05 22:52:13,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:52:13,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:52:13,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:13,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:52:13,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:52:13,551 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 40 [2022-12-05 22:52:13,552 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-05 22:52:13,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:13,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 40 [2022-12-05 22:52:13,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:13,721 INFO L130 PetriNetUnfolder]: 828/1392 cut-off events. [2022-12-05 22:52:13,721 INFO L131 PetriNetUnfolder]: For 64/64 co-relation queries the response was YES. [2022-12-05 22:52:13,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2817 conditions, 1392 events. 828/1392 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5779 event pairs, 371 based on Foata normal form. 0/1022 useless extension candidates. Maximal degree in co-relation 2619. Up to 880 conditions per place. [2022-12-05 22:52:13,730 INFO L137 encePairwiseOnDemand]: 33/40 looper letters, 55 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2022-12-05 22:52:13,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 61 transitions, 253 flow [2022-12-05 22:52:13,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:52:13,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:52:13,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-05 22:52:13,740 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2022-12-05 22:52:13,741 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 89 flow. Second operand 3 states and 73 transitions. [2022-12-05 22:52:13,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 61 transitions, 253 flow [2022-12-05 22:52:13,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 61 transitions, 245 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 22:52:13,746 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 97 flow [2022-12-05 22:52:13,747 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-05 22:52:13,750 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2022-12-05 22:52:13,750 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:13,751 INFO L89 Accepts]: Start accepts. Operand has 40 places, 39 transitions, 97 flow [2022-12-05 22:52:13,752 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:13,753 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:13,753 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 39 transitions, 97 flow [2022-12-05 22:52:13,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 39 transitions, 97 flow [2022-12-05 22:52:13,770 INFO L130 PetriNetUnfolder]: 9/66 cut-off events. [2022-12-05 22:52:13,770 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:52:13,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 66 events. 9/66 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 144 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 73. Up to 9 conditions per place. [2022-12-05 22:52:13,771 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 39 transitions, 97 flow [2022-12-05 22:52:13,771 INFO L188 LiptonReduction]: Number of co-enabled transitions 660 [2022-12-05 22:52:13,800 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:52:13,801 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-05 22:52:13,801 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 97 flow [2022-12-05 22:52:13,801 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-05 22:52:13,801 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:13,801 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:13,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 22:52:13,802 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:52:13,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:13,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1910694523, now seen corresponding path program 1 times [2022-12-05 22:52:13,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:13,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313605281] [2022-12-05 22:52:13,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:13,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:13,882 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-05 22:52:13,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:13,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313605281] [2022-12-05 22:52:13,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313605281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:52:13,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:52:13,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:52:13,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532584391] [2022-12-05 22:52:13,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:52:13,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:52:13,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:13,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:52:13,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:52:13,890 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2022-12-05 22:52:13,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:13,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:13,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2022-12-05 22:52:13,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:14,062 INFO L130 PetriNetUnfolder]: 1126/1960 cut-off events. [2022-12-05 22:52:14,062 INFO L131 PetriNetUnfolder]: For 124/124 co-relation queries the response was YES. [2022-12-05 22:52:14,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4025 conditions, 1960 events. 1126/1960 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 10225 event pairs, 586 based on Foata normal form. 0/1459 useless extension candidates. Maximal degree in co-relation 3693. Up to 1284 conditions per place. [2022-12-05 22:52:14,069 INFO L137 encePairwiseOnDemand]: 35/38 looper letters, 56 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2022-12-05 22:52:14,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 63 transitions, 271 flow [2022-12-05 22:52:14,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:52:14,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:52:14,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-12-05 22:52:14,072 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6228070175438597 [2022-12-05 22:52:14,072 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 97 flow. Second operand 3 states and 71 transitions. [2022-12-05 22:52:14,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 63 transitions, 271 flow [2022-12-05 22:52:14,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 63 transitions, 267 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:52:14,076 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 109 flow [2022-12-05 22:52:14,076 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-05 22:52:14,077 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2022-12-05 22:52:14,077 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:14,077 INFO L89 Accepts]: Start accepts. Operand has 42 places, 40 transitions, 109 flow [2022-12-05 22:52:14,078 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:14,078 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:14,078 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 40 transitions, 109 flow [2022-12-05 22:52:14,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 40 transitions, 109 flow [2022-12-05 22:52:14,085 INFO L130 PetriNetUnfolder]: 12/97 cut-off events. [2022-12-05 22:52:14,085 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-05 22:52:14,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 97 events. 12/97 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 297 event pairs, 1 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 114. Up to 11 conditions per place. [2022-12-05 22:52:14,086 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 40 transitions, 109 flow [2022-12-05 22:52:14,086 INFO L188 LiptonReduction]: Number of co-enabled transitions 698 [2022-12-05 22:52:14,093 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:52:14,095 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-05 22:52:14,095 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 109 flow [2022-12-05 22:52:14,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:14,095 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:14,095 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:14,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 22:52:14,096 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:52:14,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:14,097 INFO L85 PathProgramCache]: Analyzing trace with hash -297744408, now seen corresponding path program 1 times [2022-12-05 22:52:14,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:14,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482577697] [2022-12-05 22:52:14,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:14,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:14,217 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-05 22:52:14,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:14,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482577697] [2022-12-05 22:52:14,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482577697] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:52:14,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418092314] [2022-12-05 22:52:14,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:14,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:52:14,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:52:14,221 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-05 22:52:14,243 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-05 22:52:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:14,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-05 22:52:14,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:52:14,383 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-05 22:52:14,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:52:14,424 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-05 22:52:14,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418092314] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:52:14,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:52:14,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-05 22:52:14,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532090103] [2022-12-05 22:52:14,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:52:14,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 22:52:14,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:14,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 22:52:14,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-05 22:52:14,426 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 38 [2022-12-05 22:52:14,426 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-05 22:52:14,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:14,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 38 [2022-12-05 22:52:14,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:14,925 INFO L130 PetriNetUnfolder]: 2279/3969 cut-off events. [2022-12-05 22:52:14,925 INFO L131 PetriNetUnfolder]: For 926/926 co-relation queries the response was YES. [2022-12-05 22:52:14,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8628 conditions, 3969 events. 2279/3969 cut-off events. For 926/926 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 21862 event pairs, 454 based on Foata normal form. 96/3479 useless extension candidates. Maximal degree in co-relation 8059. Up to 1258 conditions per place. [2022-12-05 22:52:14,938 INFO L137 encePairwiseOnDemand]: 30/38 looper letters, 166 selfloop transitions, 26 changer transitions 5/200 dead transitions. [2022-12-05 22:52:14,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 200 transitions, 913 flow [2022-12-05 22:52:14,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-05 22:52:14,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-05 22:52:14,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 236 transitions. [2022-12-05 22:52:14,940 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5175438596491229 [2022-12-05 22:52:14,940 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 109 flow. Second operand 12 states and 236 transitions. [2022-12-05 22:52:14,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 200 transitions, 913 flow [2022-12-05 22:52:14,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 200 transitions, 898 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:52:14,944 INFO L231 Difference]: Finished difference. Result has 60 places, 65 transitions, 321 flow [2022-12-05 22:52:14,944 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-05 22:52:14,945 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2022-12-05 22:52:14,945 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:14,945 INFO L89 Accepts]: Start accepts. Operand has 60 places, 65 transitions, 321 flow [2022-12-05 22:52:14,946 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:14,946 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:14,946 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 65 transitions, 321 flow [2022-12-05 22:52:14,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 65 transitions, 321 flow [2022-12-05 22:52:14,959 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([568] L1008-1-->L974: Formula: (and (= |v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_23| |v_~#arr~0.offset_37|) (= |v_~#arr~0.base_37| |v_t2Thread1of1ForFork1_pop_#in~stack#1.base_23|) (< 0 v_~top~0_87)) InVars {~#arr~0.offset=|v_~#arr~0.offset_37|, ~top~0=v_~top~0_87, ~#arr~0.base=|v_~#arr~0.base_37|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_37|, t2Thread1of1ForFork1_pop_#t~mem37#1=|v_t2Thread1of1ForFork1_pop_#t~mem37#1_31|, t2Thread1of1ForFork1_pop_~stack#1.base=|v_t2Thread1of1ForFork1_pop_~stack#1.base_37|, t2Thread1of1ForFork1_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_23|, t2Thread1of1ForFork1_#t~nondet43#1=|v_t2Thread1of1ForFork1_#t~nondet43#1_13|, t2Thread1of1ForFork1_pop_#t~ret36#1=|v_t2Thread1of1ForFork1_pop_#t~ret36#1_35|, t2Thread1of1ForFork1_pop_~stack#1.offset=|v_t2Thread1of1ForFork1_pop_~stack#1.offset_37|, t2Thread1of1ForFork1_pop_#t~nondet35#1=|v_t2Thread1of1ForFork1_pop_#t~nondet35#1_15|, ~top~0=v_~top~0_87, t2Thread1of1ForFork1_pop_#in~stack#1.base=|v_t2Thread1of1ForFork1_pop_#in~stack#1.base_23|, ~#arr~0.base=|v_~#arr~0.base_37|, t2Thread1of1ForFork1_pop_#res#1=|v_t2Thread1of1ForFork1_pop_#res#1_33|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_pop_#t~mem37#1, t2Thread1of1ForFork1_pop_~stack#1.base, t2Thread1of1ForFork1_pop_#in~stack#1.offset, t2Thread1of1ForFork1_#t~nondet43#1, t2Thread1of1ForFork1_pop_#t~ret36#1, t2Thread1of1ForFork1_pop_~stack#1.offset, t2Thread1of1ForFork1_pop_#t~nondet35#1, t2Thread1of1ForFork1_pop_#in~stack#1.base, t2Thread1of1ForFork1_pop_#res#1][38], [26#L1023-4true, Black: 164#(= ~top~0 0), 59#push_returnLabel#1true, Black: 170#true, Black: 255#(and (< |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4) (<= ~top~0 1)), 107#L974true, Black: 229#(< |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4), Black: 257#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork0_inc_top_#t~post31#1| 0)), Black: 259#(and (< |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4) (<= ~top~0 0)), Black: 174#(<= ~top~0 1), Black: 178#(<= ~top~0 0), 219#(not (<= 5 ~top~0)), t2Thread1of1ForFork1InUse, 168#(= |t1Thread1of1ForFork0_push_#res#1| 0)]) [2022-12-05 22:52:14,959 INFO L382 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-12-05 22:52:14,959 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-05 22:52:14,960 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 22:52:14,960 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-05 22:52:14,960 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L1008-1-->L1009-1: Formula: (not (< 0 v_~top~0_89)) InVars {~top~0=v_~top~0_89} OutVars{t2Thread1of1ForFork1_#t~nondet43#1=|v_t2Thread1of1ForFork1_#t~nondet43#1_15|, ~top~0=v_~top~0_89} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~nondet43#1][21], [26#L1023-4true, 59#push_returnLabel#1true, Black: 164#(= ~top~0 0), Black: 170#true, Black: 255#(and (< |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4) (<= ~top~0 1)), Black: 229#(< |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4), Black: 257#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork0_inc_top_#t~post31#1| 0)), Black: 259#(and (< |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4) (<= ~top~0 0)), Black: 174#(<= ~top~0 1), Black: 219#(not (<= 5 ~top~0)), t2Thread1of1ForFork1InUse, 76#L1009-1true, 168#(= |t1Thread1of1ForFork0_push_#res#1| 0), 178#(<= ~top~0 0)]) [2022-12-05 22:52:14,960 INFO L382 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-12-05 22:52:14,960 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-05 22:52:14,960 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-05 22:52:14,960 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 22:52:14,963 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L1008-1-->L1009-1: Formula: (not (< 0 v_~top~0_89)) InVars {~top~0=v_~top~0_89} OutVars{t2Thread1of1ForFork1_#t~nondet43#1=|v_t2Thread1of1ForFork1_#t~nondet43#1_15|, ~top~0=v_~top~0_89} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~nondet43#1][21], [26#L1023-4true, Black: 164#(= ~top~0 0), Black: 170#true, Black: 255#(and (< |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4) (<= ~top~0 1)), 104#L946-1true, Black: 229#(< |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4), Black: 168#(= |t1Thread1of1ForFork0_push_#res#1| 0), Black: 257#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork0_inc_top_#t~post31#1| 0)), Black: 259#(and (< |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4) (<= ~top~0 0)), Black: 174#(<= ~top~0 1), Black: 219#(not (<= 5 ~top~0)), t2Thread1of1ForFork1InUse, 76#L1009-1true, 178#(<= ~top~0 0)]) [2022-12-05 22:52:14,963 INFO L382 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-05 22:52:14,963 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-05 22:52:14,963 INFO L385 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-05 22:52:14,963 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-05 22:52:14,965 INFO L130 PetriNetUnfolder]: 72/348 cut-off events. [2022-12-05 22:52:14,965 INFO L131 PetriNetUnfolder]: For 317/328 co-relation queries the response was YES. [2022-12-05 22:52:14,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 704 conditions, 348 events. 72/348 cut-off events. For 317/328 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1910 event pairs, 2 based on Foata normal form. 1/256 useless extension candidates. Maximal degree in co-relation 683. Up to 47 conditions per place. [2022-12-05 22:52:14,968 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 65 transitions, 321 flow [2022-12-05 22:52:14,968 INFO L188 LiptonReduction]: Number of co-enabled transitions 1108 [2022-12-05 22:52:14,971 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [575] L974-->L1011-3: Formula: (and (= v_~top~0_122 0) (= |v_t2Thread1of1ForFork1_pop_~stack#1.base_51| |v_t2Thread1of1ForFork1_pop_#in~stack#1.base_35|) (= |v_t2Thread1of1ForFork1_#t~ret44#1_49| |v_t2Thread1of1ForFork1_pop_#res#1_45|) (= |v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_35| |v_t2Thread1of1ForFork1_pop_~stack#1.offset_51|) (= (+ 2 |v_t2Thread1of1ForFork1_pop_#res#1_45|) 0)) InVars {t2Thread1of1ForFork1_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_35|, ~top~0=v_~top~0_122, t2Thread1of1ForFork1_pop_#in~stack#1.base=|v_t2Thread1of1ForFork1_pop_#in~stack#1.base_35|} OutVars{t2Thread1of1ForFork1_pop_~stack#1.base=|v_t2Thread1of1ForFork1_pop_~stack#1.base_51|, t2Thread1of1ForFork1_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_35|, t2Thread1of1ForFork1_#t~ret44#1=|v_t2Thread1of1ForFork1_#t~ret44#1_49|, t2Thread1of1ForFork1_pop_~stack#1.offset=|v_t2Thread1of1ForFork1_pop_~stack#1.offset_51|, t2Thread1of1ForFork1_pop_#t~nondet35#1=|v_t2Thread1of1ForFork1_pop_#t~nondet35#1_25|, ~top~0=v_~top~0_122, t2Thread1of1ForFork1_pop_#in~stack#1.base=|v_t2Thread1of1ForFork1_pop_#in~stack#1.base_35|, t2Thread1of1ForFork1_pop_#res#1=|v_t2Thread1of1ForFork1_pop_#res#1_45|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_pop_~stack#1.base, t2Thread1of1ForFork1_#t~ret44#1, t2Thread1of1ForFork1_pop_~stack#1.offset, t2Thread1of1ForFork1_pop_#t~nondet35#1, t2Thread1of1ForFork1_pop_#res#1] and [565] L946-1-->push_returnLabel#1: Formula: (and (= (+ 1 |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_42|) v_~top~0_85) (= |v_t1Thread1of1ForFork0_push_#res#1_35| 0)) InVars {t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_42|} OutVars{t1Thread1of1ForFork0_push_#res#1=|v_t1Thread1of1ForFork0_push_#res#1_35|, ~top~0=v_~top~0_85} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#res#1, ~top~0, t1Thread1of1ForFork0_inc_top_#t~post31#1] [2022-12-05 22:52:15,009 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [569] L1008-1-->L1009-1: Formula: (not (< 0 v_~top~0_89)) InVars {~top~0=v_~top~0_89} OutVars{t2Thread1of1ForFork1_#t~nondet43#1=|v_t2Thread1of1ForFork1_#t~nondet43#1_15|, ~top~0=v_~top~0_89} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~nondet43#1] and [565] L946-1-->push_returnLabel#1: Formula: (and (= (+ 1 |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_42|) v_~top~0_85) (= |v_t1Thread1of1ForFork0_push_#res#1_35| 0)) InVars {t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_42|} OutVars{t1Thread1of1ForFork0_push_#res#1=|v_t1Thread1of1ForFork0_push_#res#1_35|, ~top~0=v_~top~0_85} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#res#1, ~top~0, t1Thread1of1ForFork0_inc_top_#t~post31#1] [2022-12-05 22:52:15,054 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [532] L969-3-->L946-1: Formula: (= v_~top~0_43 |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_27|) InVars {~top~0=v_~top~0_43} OutVars{t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_23|, ~top~0=v_~top~0_43, t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_27|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~ret34#1, t1Thread1of1ForFork0_inc_top_#t~post31#1] and [569] L1008-1-->L1009-1: Formula: (not (< 0 v_~top~0_89)) InVars {~top~0=v_~top~0_89} OutVars{t2Thread1of1ForFork1_#t~nondet43#1=|v_t2Thread1of1ForFork1_#t~nondet43#1_15|, ~top~0=v_~top~0_89} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~nondet43#1] [2022-12-05 22:52:15,064 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [532] L969-3-->L946-1: Formula: (= v_~top~0_43 |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_27|) InVars {~top~0=v_~top~0_43} OutVars{t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_23|, ~top~0=v_~top~0_43, t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_27|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~ret34#1, t1Thread1of1ForFork0_inc_top_#t~post31#1] and [500] L950-1-->L948: Formula: (= (+ v_~top~0_28 1) |v_t2Thread1of1ForFork1_dec_top_#t~post32#1_16|) InVars {t2Thread1of1ForFork1_dec_top_#t~post32#1=|v_t2Thread1of1ForFork1_dec_top_#t~post32#1_16|} OutVars{~top~0=v_~top~0_28} AuxVars[] AssignedVars[~top~0, t2Thread1of1ForFork1_dec_top_#t~post32#1] [2022-12-05 22:52:15,091 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-05 22:52:15,092 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 147 [2022-12-05 22:52:15,092 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 64 transitions, 352 flow [2022-12-05 22:52:15,092 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-05 22:52:15,092 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:15,092 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:15,104 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-05 22:52:15,297 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-05 22:52:15,297 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:52:15,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:15,298 INFO L85 PathProgramCache]: Analyzing trace with hash 52590737, now seen corresponding path program 1 times [2022-12-05 22:52:15,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:15,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041275394] [2022-12-05 22:52:15,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:15,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:15,321 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-05 22:52:15,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:15,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041275394] [2022-12-05 22:52:15,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041275394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:52:15,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:52:15,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:52:15,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556238924] [2022-12-05 22:52:15,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:52:15,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-05 22:52:15,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:15,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-05 22:52:15,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-05 22:52:15,323 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 46 [2022-12-05 22:52:15,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 64 transitions, 352 flow. Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 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-05 22:52:15,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:15,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 46 [2022-12-05 22:52:15,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:15,586 INFO L130 PetriNetUnfolder]: 1959/3540 cut-off events. [2022-12-05 22:52:15,586 INFO L131 PetriNetUnfolder]: For 3338/3356 co-relation queries the response was YES. [2022-12-05 22:52:15,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8912 conditions, 3540 events. 1959/3540 cut-off events. For 3338/3356 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 20606 event pairs, 1461 based on Foata normal form. 20/3014 useless extension candidates. Maximal degree in co-relation 8332. Up to 3235 conditions per place. [2022-12-05 22:52:15,599 INFO L137 encePairwiseOnDemand]: 44/46 looper letters, 56 selfloop transitions, 0 changer transitions 0/61 dead transitions. [2022-12-05 22:52:15,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 61 transitions, 429 flow [2022-12-05 22:52:15,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-05 22:52:15,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-05 22:52:15,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2022-12-05 22:52:15,601 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5543478260869565 [2022-12-05 22:52:15,601 INFO L175 Difference]: Start difference. First operand has 59 places, 64 transitions, 352 flow. Second operand 2 states and 51 transitions. [2022-12-05 22:52:15,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 61 transitions, 429 flow [2022-12-05 22:52:15,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 61 transitions, 408 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-05 22:52:15,613 INFO L231 Difference]: Finished difference. Result has 57 places, 61 transitions, 296 flow [2022-12-05 22:52:15,613 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=296, PETRI_PLACES=57, PETRI_TRANSITIONS=61} [2022-12-05 22:52:15,614 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2022-12-05 22:52:15,614 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:15,614 INFO L89 Accepts]: Start accepts. Operand has 57 places, 61 transitions, 296 flow [2022-12-05 22:52:15,616 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:15,616 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:15,616 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 61 transitions, 296 flow [2022-12-05 22:52:15,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 61 transitions, 296 flow [2022-12-05 22:52:15,633 INFO L130 PetriNetUnfolder]: 60/333 cut-off events. [2022-12-05 22:52:15,634 INFO L131 PetriNetUnfolder]: For 268/280 co-relation queries the response was YES. [2022-12-05 22:52:15,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 333 events. 60/333 cut-off events. For 268/280 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1837 event pairs, 2 based on Foata normal form. 1/241 useless extension candidates. Maximal degree in co-relation 618. Up to 41 conditions per place. [2022-12-05 22:52:15,636 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 61 transitions, 296 flow [2022-12-05 22:52:15,636 INFO L188 LiptonReduction]: Number of co-enabled transitions 1054 [2022-12-05 22:52:15,645 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:52:15,646 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-05 22:52:15,646 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 61 transitions, 296 flow [2022-12-05 22:52:15,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 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-05 22:52:15,646 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:15,647 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-05 22:52:15,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 22:52:15,647 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:52:15,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:15,647 INFO L85 PathProgramCache]: Analyzing trace with hash -386384014, now seen corresponding path program 1 times [2022-12-05 22:52:15,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:15,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181483723] [2022-12-05 22:52:15,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:15,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:15,743 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-05 22:52:15,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:15,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181483723] [2022-12-05 22:52:15,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181483723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:52:15,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:52:15,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:52:15,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704008962] [2022-12-05 22:52:15,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:52:15,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:52:15,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:15,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:52:15,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:52:15,747 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 44 [2022-12-05 22:52:15,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 61 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:15,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:15,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 44 [2022-12-05 22:52:15,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:15,893 INFO L130 PetriNetUnfolder]: 758/1527 cut-off events. [2022-12-05 22:52:15,893 INFO L131 PetriNetUnfolder]: For 699/699 co-relation queries the response was YES. [2022-12-05 22:52:15,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3590 conditions, 1527 events. 758/1527 cut-off events. For 699/699 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 7647 event pairs, 138 based on Foata normal form. 68/1421 useless extension candidates. Maximal degree in co-relation 3339. Up to 1054 conditions per place. [2022-12-05 22:52:15,898 INFO L137 encePairwiseOnDemand]: 38/44 looper letters, 46 selfloop transitions, 6 changer transitions 4/61 dead transitions. [2022-12-05 22:52:15,898 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 61 transitions, 349 flow [2022-12-05 22:52:15,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:52:15,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:52:15,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-12-05 22:52:15,899 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2022-12-05 22:52:15,899 INFO L175 Difference]: Start difference. First operand has 56 places, 61 transitions, 296 flow. Second operand 3 states and 62 transitions. [2022-12-05 22:52:15,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 61 transitions, 349 flow [2022-12-05 22:52:15,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 61 transitions, 342 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-05 22:52:15,902 INFO L231 Difference]: Finished difference. Result has 53 places, 48 transitions, 210 flow [2022-12-05 22:52:15,903 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2022-12-05 22:52:15,905 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2022-12-05 22:52:15,905 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:15,905 INFO L89 Accepts]: Start accepts. Operand has 53 places, 48 transitions, 210 flow [2022-12-05 22:52:15,906 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:15,906 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:15,906 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 48 transitions, 210 flow [2022-12-05 22:52:15,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 48 transitions, 210 flow [2022-12-05 22:52:15,915 INFO L130 PetriNetUnfolder]: 23/184 cut-off events. [2022-12-05 22:52:15,915 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-12-05 22:52:15,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343 conditions, 184 events. 23/184 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 761 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 326. Up to 26 conditions per place. [2022-12-05 22:52:15,917 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 48 transitions, 210 flow [2022-12-05 22:52:15,917 INFO L188 LiptonReduction]: Number of co-enabled transitions 438 [2022-12-05 22:52:16,562 INFO L203 LiptonReduction]: Total number of compositions: 10 [2022-12-05 22:52:16,563 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 658 [2022-12-05 22:52:16,563 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 220 flow [2022-12-05 22:52:16,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:16,563 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:16,563 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:16,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 22:52:16,563 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:52:16,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:16,564 INFO L85 PathProgramCache]: Analyzing trace with hash -135824068, now seen corresponding path program 1 times [2022-12-05 22:52:16,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:16,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445813014] [2022-12-05 22:52:16,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:16,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:16,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:16,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:52:16,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:16,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445813014] [2022-12-05 22:52:16,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445813014] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:52:16,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:52:16,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 22:52:16,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752395535] [2022-12-05 22:52:16,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:52:16,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 22:52:16,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:16,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 22:52:16,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-05 22:52:16,964 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 38 [2022-12-05 22:52:16,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 220 flow. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:16,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:16,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 38 [2022-12-05 22:52:16,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:17,252 INFO L130 PetriNetUnfolder]: 735/1458 cut-off events. [2022-12-05 22:52:17,252 INFO L131 PetriNetUnfolder]: For 1060/1060 co-relation queries the response was YES. [2022-12-05 22:52:17,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3907 conditions, 1458 events. 735/1458 cut-off events. For 1060/1060 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7720 event pairs, 215 based on Foata normal form. 50/1508 useless extension candidates. Maximal degree in co-relation 2292. Up to 885 conditions per place. [2022-12-05 22:52:17,258 INFO L137 encePairwiseOnDemand]: 21/38 looper letters, 72 selfloop transitions, 19 changer transitions 12/106 dead transitions. [2022-12-05 22:52:17,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 106 transitions, 658 flow [2022-12-05 22:52:17,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 22:52:17,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 22:52:17,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 132 transitions. [2022-12-05 22:52:17,260 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38596491228070173 [2022-12-05 22:52:17,260 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 220 flow. Second operand 9 states and 132 transitions. [2022-12-05 22:52:17,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 106 transitions, 658 flow [2022-12-05 22:52:17,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 106 transitions, 637 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:52:17,263 INFO L231 Difference]: Finished difference. Result has 56 places, 59 transitions, 403 flow [2022-12-05 22:52:17,264 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=203, 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=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=403, PETRI_PLACES=56, PETRI_TRANSITIONS=59} [2022-12-05 22:52:17,264 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2022-12-05 22:52:17,264 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:17,264 INFO L89 Accepts]: Start accepts. Operand has 56 places, 59 transitions, 403 flow [2022-12-05 22:52:17,265 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:17,265 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:17,265 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 59 transitions, 403 flow [2022-12-05 22:52:17,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 59 transitions, 403 flow [2022-12-05 22:52:17,285 INFO L130 PetriNetUnfolder]: 34/244 cut-off events. [2022-12-05 22:52:17,285 INFO L131 PetriNetUnfolder]: For 306/306 co-relation queries the response was YES. [2022-12-05 22:52:17,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 244 events. 34/244 cut-off events. For 306/306 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1287 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 328. Up to 32 conditions per place. [2022-12-05 22:52:17,287 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 59 transitions, 403 flow [2022-12-05 22:52:17,287 INFO L188 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-05 22:52:17,851 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 22:52:17,852 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 588 [2022-12-05 22:52:17,852 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 56 transitions, 399 flow [2022-12-05 22:52:17,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:17,852 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:17,852 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:17,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 22:52:17,852 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:52:17,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:17,853 INFO L85 PathProgramCache]: Analyzing trace with hash 517701343, now seen corresponding path program 1 times [2022-12-05 22:52:17,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:17,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018142937] [2022-12-05 22:52:17,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:17,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:18,289 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-05 22:52:18,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:18,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018142937] [2022-12-05 22:52:18,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018142937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:52:18,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:52:18,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 22:52:18,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224228249] [2022-12-05 22:52:18,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:52:18,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 22:52:18,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:18,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 22:52:18,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-05 22:52:18,291 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2022-12-05 22:52:18,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 56 transitions, 399 flow. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:18,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:18,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2022-12-05 22:52:18,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:18,650 INFO L130 PetriNetUnfolder]: 783/1577 cut-off events. [2022-12-05 22:52:18,651 INFO L131 PetriNetUnfolder]: For 2396/2396 co-relation queries the response was YES. [2022-12-05 22:52:18,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4558 conditions, 1577 events. 783/1577 cut-off events. For 2396/2396 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 8794 event pairs, 231 based on Foata normal form. 16/1581 useless extension candidates. Maximal degree in co-relation 3122. Up to 905 conditions per place. [2022-12-05 22:52:18,656 INFO L137 encePairwiseOnDemand]: 23/37 looper letters, 73 selfloop transitions, 14 changer transitions 12/102 dead transitions. [2022-12-05 22:52:18,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 102 transitions, 770 flow [2022-12-05 22:52:18,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 22:52:18,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 22:52:18,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2022-12-05 22:52:18,658 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3918918918918919 [2022-12-05 22:52:18,658 INFO L175 Difference]: Start difference. First operand has 53 places, 56 transitions, 399 flow. Second operand 8 states and 116 transitions. [2022-12-05 22:52:18,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 102 transitions, 770 flow [2022-12-05 22:52:18,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 102 transitions, 728 flow, removed 21 selfloop flow, removed 1 redundant places. [2022-12-05 22:52:18,663 INFO L231 Difference]: Finished difference. Result has 62 places, 60 transitions, 448 flow [2022-12-05 22:52:18,663 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=448, PETRI_PLACES=62, PETRI_TRANSITIONS=60} [2022-12-05 22:52:18,663 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2022-12-05 22:52:18,663 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:18,663 INFO L89 Accepts]: Start accepts. Operand has 62 places, 60 transitions, 448 flow [2022-12-05 22:52:18,664 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:18,664 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:18,664 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 60 transitions, 448 flow [2022-12-05 22:52:18,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 60 transitions, 448 flow [2022-12-05 22:52:18,679 INFO L130 PetriNetUnfolder]: 36/244 cut-off events. [2022-12-05 22:52:18,679 INFO L131 PetriNetUnfolder]: For 434/436 co-relation queries the response was YES. [2022-12-05 22:52:18,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 244 events. 36/244 cut-off events. For 434/436 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1284 event pairs, 0 based on Foata normal form. 2/204 useless extension candidates. Maximal degree in co-relation 501. Up to 38 conditions per place. [2022-12-05 22:52:18,681 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 60 transitions, 448 flow [2022-12-05 22:52:18,682 INFO L188 LiptonReduction]: Number of co-enabled transitions 486 [2022-12-05 22:52:18,938 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:52:18,939 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 276 [2022-12-05 22:52:18,939 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 445 flow [2022-12-05 22:52:18,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:18,939 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:18,939 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:18,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 22:52:18,940 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:52:18,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:18,940 INFO L85 PathProgramCache]: Analyzing trace with hash 74427463, now seen corresponding path program 2 times [2022-12-05 22:52:18,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:18,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918050870] [2022-12-05 22:52:18,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:18,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:19,375 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-05 22:52:19,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:19,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918050870] [2022-12-05 22:52:19,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918050870] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:52:19,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:52:19,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 22:52:19,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661237916] [2022-12-05 22:52:19,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:52:19,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 22:52:19,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:19,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 22:52:19,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-05 22:52:19,377 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2022-12-05 22:52:19,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 445 flow. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:19,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:19,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2022-12-05 22:52:19,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:19,814 INFO L130 PetriNetUnfolder]: 907/1824 cut-off events. [2022-12-05 22:52:19,814 INFO L131 PetriNetUnfolder]: For 3254/3254 co-relation queries the response was YES. [2022-12-05 22:52:19,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5442 conditions, 1824 events. 907/1824 cut-off events. For 3254/3254 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 10443 event pairs, 208 based on Foata normal form. 26/1838 useless extension candidates. Maximal degree in co-relation 3799. Up to 640 conditions per place. [2022-12-05 22:52:19,824 INFO L137 encePairwiseOnDemand]: 21/37 looper letters, 71 selfloop transitions, 26 changer transitions 12/112 dead transitions. [2022-12-05 22:52:19,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 112 transitions, 884 flow [2022-12-05 22:52:19,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 22:52:19,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 22:52:19,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2022-12-05 22:52:19,825 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35135135135135137 [2022-12-05 22:52:19,825 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 445 flow. Second operand 10 states and 130 transitions. [2022-12-05 22:52:19,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 112 transitions, 884 flow [2022-12-05 22:52:19,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 112 transitions, 858 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-05 22:52:19,832 INFO L231 Difference]: Finished difference. Result has 71 places, 67 transitions, 608 flow [2022-12-05 22:52:19,832 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=608, PETRI_PLACES=71, PETRI_TRANSITIONS=67} [2022-12-05 22:52:19,833 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 29 predicate places. [2022-12-05 22:52:19,833 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:19,833 INFO L89 Accepts]: Start accepts. Operand has 71 places, 67 transitions, 608 flow [2022-12-05 22:52:19,834 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:19,834 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:19,834 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 67 transitions, 608 flow [2022-12-05 22:52:19,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 67 transitions, 608 flow [2022-12-05 22:52:19,856 INFO L130 PetriNetUnfolder]: 40/279 cut-off events. [2022-12-05 22:52:19,856 INFO L131 PetriNetUnfolder]: For 892/894 co-relation queries the response was YES. [2022-12-05 22:52:19,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 279 events. 40/279 cut-off events. For 892/894 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1583 event pairs, 0 based on Foata normal form. 2/233 useless extension candidates. Maximal degree in co-relation 677. Up to 45 conditions per place. [2022-12-05 22:52:19,859 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 67 transitions, 608 flow [2022-12-05 22:52:19,859 INFO L188 LiptonReduction]: Number of co-enabled transitions 540 [2022-12-05 22:52:20,240 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:52:20,241 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 408 [2022-12-05 22:52:20,241 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 66 transitions, 608 flow [2022-12-05 22:52:20,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:20,242 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:20,242 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:20,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 22:52:20,242 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:52:20,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:20,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1755344352, now seen corresponding path program 1 times [2022-12-05 22:52:20,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:20,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849506328] [2022-12-05 22:52:20,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:20,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:20,722 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-05 22:52:20,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:20,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849506328] [2022-12-05 22:52:20,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849506328] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:52:20,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416532427] [2022-12-05 22:52:20,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:20,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:52:20,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:52:20,741 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-05 22:52:20,742 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-05 22:52:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:20,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-05 22:52:20,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:52:21,013 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 22 treesize of output 17 [2022-12-05 22:52:21,115 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-05 22:52:23,284 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-05 22:52:23,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:52:23,359 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 38 treesize of output 30 [2022-12-05 22:52:23,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 22:52:23,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416532427] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-05 22:52:23,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-05 22:52:23,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 7] total 19 [2022-12-05 22:52:23,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111736139] [2022-12-05 22:52:23,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:52:23,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:52:23,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:23,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:52:23,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=329, Unknown=1, NotChecked=0, Total=380 [2022-12-05 22:52:23,414 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 39 [2022-12-05 22:52:23,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 66 transitions, 608 flow. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:23,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:23,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 39 [2022-12-05 22:52:23,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:23,889 INFO L130 PetriNetUnfolder]: 1194/2392 cut-off events. [2022-12-05 22:52:23,889 INFO L131 PetriNetUnfolder]: For 6439/6439 co-relation queries the response was YES. [2022-12-05 22:52:23,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7720 conditions, 2392 events. 1194/2392 cut-off events. For 6439/6439 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 14763 event pairs, 414 based on Foata normal form. 0/2380 useless extension candidates. Maximal degree in co-relation 6710. Up to 923 conditions per place. [2022-12-05 22:52:23,905 INFO L137 encePairwiseOnDemand]: 21/39 looper letters, 81 selfloop transitions, 43 changer transitions 4/131 dead transitions. [2022-12-05 22:52:23,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 131 transitions, 1223 flow [2022-12-05 22:52:23,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 22:52:23,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 22:52:23,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2022-12-05 22:52:23,907 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40384615384615385 [2022-12-05 22:52:23,907 INFO L175 Difference]: Start difference. First operand has 70 places, 66 transitions, 608 flow. Second operand 8 states and 126 transitions. [2022-12-05 22:52:23,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 131 transitions, 1223 flow [2022-12-05 22:52:23,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 131 transitions, 1161 flow, removed 22 selfloop flow, removed 5 redundant places. [2022-12-05 22:52:23,920 INFO L231 Difference]: Finished difference. Result has 75 places, 84 transitions, 864 flow [2022-12-05 22:52:23,920 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=864, PETRI_PLACES=75, PETRI_TRANSITIONS=84} [2022-12-05 22:52:23,921 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places. [2022-12-05 22:52:23,921 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:23,921 INFO L89 Accepts]: Start accepts. Operand has 75 places, 84 transitions, 864 flow [2022-12-05 22:52:23,924 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:23,924 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:23,924 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 84 transitions, 864 flow [2022-12-05 22:52:23,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 84 transitions, 864 flow [2022-12-05 22:52:23,947 INFO L130 PetriNetUnfolder]: 55/367 cut-off events. [2022-12-05 22:52:23,947 INFO L131 PetriNetUnfolder]: For 1419/1422 co-relation queries the response was YES. [2022-12-05 22:52:23,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1140 conditions, 367 events. 55/367 cut-off events. For 1419/1422 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2384 event pairs, 0 based on Foata normal form. 2/308 useless extension candidates. Maximal degree in co-relation 964. Up to 56 conditions per place. [2022-12-05 22:52:23,950 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 84 transitions, 864 flow [2022-12-05 22:52:23,950 INFO L188 LiptonReduction]: Number of co-enabled transitions 660 [2022-12-05 22:52:24,422 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:52:24,423 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 502 [2022-12-05 22:52:24,423 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 83 transitions, 864 flow [2022-12-05 22:52:24,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:24,423 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:24,423 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:24,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-05 22:52:24,627 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,SelfDestructingSolverStorable8 [2022-12-05 22:52:24,628 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:52:24,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:24,628 INFO L85 PathProgramCache]: Analyzing trace with hash -628824304, now seen corresponding path program 2 times [2022-12-05 22:52:24,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:24,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209889671] [2022-12-05 22:52:24,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:24,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:25,119 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-05 22:52:25,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:25,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209889671] [2022-12-05 22:52:25,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209889671] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:52:25,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108499805] [2022-12-05 22:52:25,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 22:52:25,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:52:25,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:52:25,122 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-05 22:52:25,123 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-05 22:52:25,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-05 22:52:25,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:52:25,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-05 22:52:25,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:52:25,252 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-05 22:52:25,253 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-05 22:52:25,376 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 22 treesize of output 17 [2022-12-05 22:52:25,455 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 63 treesize of output 58 [2022-12-05 22:52:25,542 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-05 22:52:26,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 22:52:26,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:52:26,649 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_255 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_255) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-12-05 22:52:26,656 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 22:52:26,656 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-05 22:52:26,663 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 22:52:26,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2022-12-05 22:52:26,666 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-05 22:52:26,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-12-05 22:52:26,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108499805] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:52:26,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:52:26,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 20 [2022-12-05 22:52:26,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998938371] [2022-12-05 22:52:26,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:52:26,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-05 22:52:26,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:26,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-05 22:52:26,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=347, Unknown=5, NotChecked=38, Total=462 [2022-12-05 22:52:26,729 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 41 [2022-12-05 22:52:26,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 83 transitions, 864 flow. Second operand has 22 states, 22 states have (on average 5.318181818181818) internal successors, (117), 22 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:26,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:26,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 41 [2022-12-05 22:52:26,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:29,317 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-05 22:52:32,274 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-05 22:52:35,271 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-05 22:52:37,296 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-05 22:52:39,916 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-05 22:52:42,275 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-05 22:52:44,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-05 22:52:46,230 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-05 22:52:48,269 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-05 22:52:50,292 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-05 22:52:52,310 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-05 22:52:55,124 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-05 22:52:57,147 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-05 22:52:59,191 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-05 22:53:01,301 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-05 22:53:03,492 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-05 22:53:05,523 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-05 22:53:07,549 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-05 22:53:09,569 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-05 22:53:11,603 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-05 22:53:13,797 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-05 22:53:15,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-05 22:53:18,011 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-05 22:53:20,133 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-05 22:53:22,167 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-05 22:53:25,229 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-05 22:53:27,244 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-05 22:53:29,457 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-05 22:53:31,906 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-05 22:53:33,936 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-05 22:53:35,965 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-05 22:53:37,423 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-05 22:53:39,440 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-05 22:53:41,480 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-05 22:53:43,658 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-05 22:53:45,680 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-05 22:53:49,886 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-05 22:53:52,321 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-05 22:53:54,351 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-05 22:53:56,394 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-05 22:53:58,411 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-05 22:54:00,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-05 22:54:02,434 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-05 22:54:04,493 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-05 22:54:07,100 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-05 22:54:09,156 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-05 22:54:11,309 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-05 22:54:13,337 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-05 22:54:15,497 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-05 22:54:18,451 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-05 22:54:20,985 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-05 22:54:23,652 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-05 22:54:25,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-05 22:54:27,158 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-05 22:54:29,403 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-05 22:54:31,488 INFO L130 PetriNetUnfolder]: 1564/3181 cut-off events. [2022-12-05 22:54:31,489 INFO L131 PetriNetUnfolder]: For 12386/12386 co-relation queries the response was YES. [2022-12-05 22:54:31,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10582 conditions, 3181 events. 1564/3181 cut-off events. For 12386/12386 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 19470 event pairs, 322 based on Foata normal form. 78/3241 useless extension candidates. Maximal degree in co-relation 8795. Up to 704 conditions per place. [2022-12-05 22:54:31,503 INFO L137 encePairwiseOnDemand]: 12/41 looper letters, 134 selfloop transitions, 74 changer transitions 16/227 dead transitions. [2022-12-05 22:54:31,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 227 transitions, 2132 flow [2022-12-05 22:54:31,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-05 22:54:31,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-05 22:54:31,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 259 transitions. [2022-12-05 22:54:31,505 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3324775353016688 [2022-12-05 22:54:31,505 INFO L175 Difference]: Start difference. First operand has 74 places, 83 transitions, 864 flow. Second operand 19 states and 259 transitions. [2022-12-05 22:54:31,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 227 transitions, 2132 flow [2022-12-05 22:54:31,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 227 transitions, 2062 flow, removed 32 selfloop flow, removed 3 redundant places. [2022-12-05 22:54:31,522 INFO L231 Difference]: Finished difference. Result has 99 places, 116 transitions, 1458 flow [2022-12-05 22:54:31,522 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1458, PETRI_PLACES=99, PETRI_TRANSITIONS=116} [2022-12-05 22:54:31,523 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 57 predicate places. [2022-12-05 22:54:31,523 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:54:31,523 INFO L89 Accepts]: Start accepts. Operand has 99 places, 116 transitions, 1458 flow [2022-12-05 22:54:31,524 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:54:31,524 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:31,524 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 116 transitions, 1458 flow [2022-12-05 22:54:31,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 116 transitions, 1458 flow [2022-12-05 22:54:31,590 INFO L130 PetriNetUnfolder]: 225/909 cut-off events. [2022-12-05 22:54:31,590 INFO L131 PetriNetUnfolder]: For 4770/4809 co-relation queries the response was YES. [2022-12-05 22:54:31,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3261 conditions, 909 events. 225/909 cut-off events. For 4770/4809 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 6418 event pairs, 58 based on Foata normal form. 2/772 useless extension candidates. Maximal degree in co-relation 2916. Up to 218 conditions per place. [2022-12-05 22:54:31,601 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 116 transitions, 1458 flow [2022-12-05 22:54:31,602 INFO L188 LiptonReduction]: Number of co-enabled transitions 792 [2022-12-05 22:54:32,009 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [620] L962-->L969-3: Formula: (and (= |v_t1Thread1of1ForFork0_get_top_#res#1_62| |v_t1Thread1of1ForFork0_push_#t~ret34#1_102|) (<= 0 (+ |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 2147483648)) (= |v_t1Thread1of1ForFork0_get_top_#res#1_62| v_~top~0_376) (= (store |v_#memory_int_158| |v_t1Thread1of1ForFork0_push_~stack#1.base_66| (store (select |v_#memory_int_158| |v_t1Thread1of1ForFork0_push_~stack#1.base_66|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_66| (* |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 4)) |v_t1Thread1of1ForFork0_push_~x#1_66|)) |v_#memory_int_157|) (not (= 5 v_~top~0_376)) (<= |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 2147483647)) InVars {t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_66|, #memory_int=|v_#memory_int_158|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_66|, ~top~0=v_~top~0_376, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_66|} OutVars{t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_66|, t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_102|, #memory_int=|v_#memory_int_157|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_66|, t1Thread1of1ForFork0_get_top_#res#1=|v_t1Thread1of1ForFork0_get_top_#res#1_62|, ~top~0=v_~top~0_376, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_66|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~ret34#1, #memory_int, t1Thread1of1ForFork0_get_top_#res#1] and [564] L1023-4-->L1024-1: Formula: (= |v_ULTIMATE.start_main_#t~mem49#1_10| (select (select |v_#memory_int_98| |v_ULTIMATE.start_main_~#id1~0#1.base_15|) |v_ULTIMATE.start_main_~#id1~0#1.offset_15|)) InVars {#memory_int=|v_#memory_int_98|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_15|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_15|} OutVars{ULTIMATE.start_main_#t~mem49#1=|v_ULTIMATE.start_main_#t~mem49#1_10|, ULTIMATE.start_main_#t~nondet48#1=|v_ULTIMATE.start_main_#t~nondet48#1_5|, #memory_int=|v_#memory_int_98|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_13|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_15|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem49#1, ULTIMATE.start_main_#t~nondet48#1, ULTIMATE.start_main_#t~pre47#1] [2022-12-05 22:54:32,047 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:54:32,048 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 525 [2022-12-05 22:54:32,048 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 114 transitions, 1460 flow [2022-12-05 22:54:32,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.318181818181818) internal successors, (117), 22 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:54:32,048 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:32,048 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:32,053 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-05 22:54:32,248 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-05 22:54:32,249 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:54:32,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:32,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1036481584, now seen corresponding path program 1 times [2022-12-05 22:54:32,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:32,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987025724] [2022-12-05 22:54:32,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:32,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:32,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:54:32,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:54:32,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987025724] [2022-12-05 22:54:32,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987025724] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:54:32,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515072138] [2022-12-05 22:54:32,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:32,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:54:32,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:54:32,737 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-05 22:54:32,739 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-05 22:54:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:32,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-05 22:54:32,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:54:32,917 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 22 treesize of output 17 [2022-12-05 22:54:33,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:54:33,077 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 72 treesize of output 43 [2022-12-05 22:54:33,158 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-05 22:54:37,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:54:37,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:54:37,529 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 38 treesize of output 30 [2022-12-05 22:54:37,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:54:37,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515072138] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:54:37,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:54:37,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2022-12-05 22:54:37,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928405469] [2022-12-05 22:54:37,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:54:37,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-05 22:54:37,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:54:37,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-05 22:54:37,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=565, Unknown=2, NotChecked=0, Total=650 [2022-12-05 22:54:37,567 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 43 [2022-12-05 22:54:37,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 114 transitions, 1460 flow. Second operand has 26 states, 26 states have (on average 5.1923076923076925) internal successors, (135), 26 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:54:37,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:54:37,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 43 [2022-12-05 22:54:37,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:54:42,277 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-05 22:54:45,069 INFO L130 PetriNetUnfolder]: 2586/5242 cut-off events. [2022-12-05 22:54:45,069 INFO L131 PetriNetUnfolder]: For 27873/27873 co-relation queries the response was YES. [2022-12-05 22:54:45,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22053 conditions, 5242 events. 2586/5242 cut-off events. For 27873/27873 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 36187 event pairs, 597 based on Foata normal form. 0/5224 useless extension candidates. Maximal degree in co-relation 18558. Up to 1761 conditions per place. [2022-12-05 22:54:45,107 INFO L137 encePairwiseOnDemand]: 20/43 looper letters, 189 selfloop transitions, 118 changer transitions 20/330 dead transitions. [2022-12-05 22:54:45,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 330 transitions, 3843 flow [2022-12-05 22:54:45,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-05 22:54:45,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-05 22:54:45,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 337 transitions. [2022-12-05 22:54:45,111 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29026701119724374 [2022-12-05 22:54:45,111 INFO L175 Difference]: Start difference. First operand has 97 places, 114 transitions, 1460 flow. Second operand 27 states and 337 transitions. [2022-12-05 22:54:45,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 330 transitions, 3843 flow [2022-12-05 22:54:45,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 330 transitions, 3689 flow, removed 75 selfloop flow, removed 4 redundant places. [2022-12-05 22:54:45,200 INFO L231 Difference]: Finished difference. Result has 124 places, 162 transitions, 2330 flow [2022-12-05 22:54:45,200 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1386, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=2330, PETRI_PLACES=124, PETRI_TRANSITIONS=162} [2022-12-05 22:54:45,200 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 82 predicate places. [2022-12-05 22:54:45,201 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:54:45,201 INFO L89 Accepts]: Start accepts. Operand has 124 places, 162 transitions, 2330 flow [2022-12-05 22:54:45,203 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:54:45,203 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:45,203 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 162 transitions, 2330 flow [2022-12-05 22:54:45,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 162 transitions, 2330 flow [2022-12-05 22:54:45,309 INFO L130 PetriNetUnfolder]: 388/1429 cut-off events. [2022-12-05 22:54:45,309 INFO L131 PetriNetUnfolder]: For 8518/8621 co-relation queries the response was YES. [2022-12-05 22:54:45,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5437 conditions, 1429 events. 388/1429 cut-off events. For 8518/8621 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 11223 event pairs, 130 based on Foata normal form. 2/1213 useless extension candidates. Maximal degree in co-relation 5115. Up to 386 conditions per place. [2022-12-05 22:54:45,326 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 162 transitions, 2330 flow [2022-12-05 22:54:45,326 INFO L188 LiptonReduction]: Number of co-enabled transitions 1074 [2022-12-05 22:54:46,145 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-05 22:54:46,146 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 945 [2022-12-05 22:54:46,146 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 157 transitions, 2311 flow [2022-12-05 22:54:46,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.1923076923076925) internal successors, (135), 26 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:54:46,146 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:46,146 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:46,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-05 22:54:46,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:54:46,351 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:54:46,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:46,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1993809942, now seen corresponding path program 1 times [2022-12-05 22:54:46,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:46,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559273563] [2022-12-05 22:54:46,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:46,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:47,055 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:54:47,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:54:47,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559273563] [2022-12-05 22:54:47,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559273563] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:54:47,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079140364] [2022-12-05 22:54:47,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:47,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:54:47,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:54:47,057 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-05 22:54:47,058 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-05 22:54:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:47,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 85 conjunts are in the unsatisfiable core [2022-12-05 22:54:47,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:54:47,168 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-05 22:54:47,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-05 22:54:47,282 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 22 treesize of output 17 [2022-12-05 22:54:47,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:54:47,459 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-05 22:54:47,520 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-05 22:54:47,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 22:54:47,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 46 [2022-12-05 22:54:49,711 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:54:49,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:54:50,235 INFO L321 Elim1Store]: treesize reduction 21, result has 64.4 percent of original size [2022-12-05 22:54:50,235 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 2 case distinctions, treesize of input 55 treesize of output 56 [2022-12-05 22:54:50,243 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 22:54:50,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 66 [2022-12-05 22:54:50,249 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 29 treesize of output 22 [2022-12-05 22:54:50,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:54:50,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079140364] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:54:50,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:54:50,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 32 [2022-12-05 22:54:50,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039125084] [2022-12-05 22:54:50,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:54:50,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-05 22:54:50,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:54:50,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-05 22:54:50,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=858, Unknown=24, NotChecked=0, Total=1122 [2022-12-05 22:54:50,396 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 51 [2022-12-05 22:54:50,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 157 transitions, 2311 flow. Second operand has 34 states, 34 states have (on average 4.588235294117647) internal successors, (156), 34 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:54:50,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:54:50,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 51 [2022-12-05 22:54:50,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:54:52,780 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-05 22:54:54,931 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-05 22:54:57,141 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-05 22:54:59,511 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-05 22:55:02,763 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-05 22:55:05,315 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-05 22:55:07,549 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-05 22:55:09,592 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 [1] [2022-12-05 22:55:13,833 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-05 22:55:16,450 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-05 22:55:19,025 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-05 22:55:21,412 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-05 22:55:22,724 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-05 22:55:25,071 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-05 22:55:28,225 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-05 22:55:28,304 INFO L130 PetriNetUnfolder]: 4292/8452 cut-off events. [2022-12-05 22:55:28,304 INFO L131 PetriNetUnfolder]: For 59436/59436 co-relation queries the response was YES. [2022-12-05 22:55:28,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37853 conditions, 8452 events. 4292/8452 cut-off events. For 59436/59436 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 60284 event pairs, 891 based on Foata normal form. 94/8546 useless extension candidates. Maximal degree in co-relation 35566. Up to 2769 conditions per place. [2022-12-05 22:55:28,348 INFO L137 encePairwiseOnDemand]: 15/51 looper letters, 227 selfloop transitions, 179 changer transitions 42/451 dead transitions. [2022-12-05 22:55:28,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 451 transitions, 6181 flow [2022-12-05 22:55:28,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-05 22:55:28,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-05 22:55:28,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 375 transitions. [2022-12-05 22:55:28,350 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26260504201680673 [2022-12-05 22:55:28,350 INFO L175 Difference]: Start difference. First operand has 119 places, 157 transitions, 2311 flow. Second operand 28 states and 375 transitions. [2022-12-05 22:55:28,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 451 transitions, 6181 flow [2022-12-05 22:55:28,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 451 transitions, 5977 flow, removed 55 selfloop flow, removed 8 redundant places. [2022-12-05 22:55:28,439 INFO L231 Difference]: Finished difference. Result has 154 places, 278 transitions, 4748 flow [2022-12-05 22:55:28,440 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2200, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=4748, PETRI_PLACES=154, PETRI_TRANSITIONS=278} [2022-12-05 22:55:28,440 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 112 predicate places. [2022-12-05 22:55:28,440 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:55:28,441 INFO L89 Accepts]: Start accepts. Operand has 154 places, 278 transitions, 4748 flow [2022-12-05 22:55:28,444 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:55:28,444 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:55:28,444 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 278 transitions, 4748 flow [2022-12-05 22:55:28,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 278 transitions, 4748 flow [2022-12-05 22:55:28,710 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([620] L962-->L969-3: Formula: (and (= |v_t1Thread1of1ForFork0_get_top_#res#1_62| |v_t1Thread1of1ForFork0_push_#t~ret34#1_102|) (<= 0 (+ |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 2147483648)) (= |v_t1Thread1of1ForFork0_get_top_#res#1_62| v_~top~0_376) (= (store |v_#memory_int_158| |v_t1Thread1of1ForFork0_push_~stack#1.base_66| (store (select |v_#memory_int_158| |v_t1Thread1of1ForFork0_push_~stack#1.base_66|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_66| (* |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 4)) |v_t1Thread1of1ForFork0_push_~x#1_66|)) |v_#memory_int_157|) (not (= 5 v_~top~0_376)) (<= |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 2147483647)) InVars {t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_66|, #memory_int=|v_#memory_int_158|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_66|, ~top~0=v_~top~0_376, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_66|} OutVars{t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_66|, t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_102|, #memory_int=|v_#memory_int_157|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_66|, t1Thread1of1ForFork0_get_top_#res#1=|v_t1Thread1of1ForFork0_get_top_#res#1_62|, ~top~0=v_~top~0_376, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_66|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~ret34#1, #memory_int, t1Thread1of1ForFork0_get_top_#res#1][108], [Black: 986#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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|)), Black: 881#(and (<= (+ (select (select |#memory_int| |~#arr~0.base|) |~#arr~0.offset|) (* (div (+ (- 4294967297) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) |~#arr~0.offset|))) 4294967296) 4294967296) 8589934588) 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) |~#arr~0.offset|)) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (= ~top~0 1) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< (select (select |#memory_int| |~#arr~0.base|) |~#arr~0.offset|) 4294967296) (= 3 |~#arr~0.base|)), Black: 981#(and (= |~#arr~0.offset| 0) (forall ((v_ArrVal_373 Int) (|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (< ~top~0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|) (not (= 4294967294 (mod (select (select (store (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_373)) |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296))))) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (forall ((v_ArrVal_373 Int) (|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (< (+ ~top~0 1) |v_t2Thread1of1ForFork1_get_top_#res#1_117|) (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (not (= 4294967294 (mod (select (select (store (store |#memory_int| |~#arr~0.base| (store (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) 4) v_ArrVal_373)) |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296))))) (<= ~top~0 1) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0)) (= 3 |~#arr~0.base|)), Black: 1013#(and (not (= (+ |t2Thread1of1ForFork1_#t~ret44#1| 2) 0)) (forall ((v_ArrVal_373 Int) (|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (< (+ ~top~0 1) |v_t2Thread1of1ForFork1_get_top_#res#1_117|) (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (not (= 4294967294 (mod (select (select (store (store |#memory_int| |~#arr~0.base| (store (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) 4) v_ArrVal_373)) |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296)))))), Black: 866#(and (= ~top~0 0) (= |~#arr~0.offset| 0) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< (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|)), Black: 1000#(and (< (* ~top~0 4) 1) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0)) (= 3 |~#arr~0.base|)), Black: 174#(<= ~top~0 1), Black: 219#(not (<= 5 ~top~0)), Black: 178#(<= ~top~0 0), t2Thread1of1ForFork1InUse, Black: 278#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647) (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0)), Black: 281#(and (<= 1 ~top~0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 2147483647) (= |~#arr~0.offset| 0) (<= ~top~0 1) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 286#(and (= ~top~0 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 2147483647) (= |t1Thread1of1ForFork0_inc_top_#t~post31#1| 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647) (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 284#(and (= ~top~0 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 2147483647) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647) (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 164#(= ~top~0 0), Black: 279#(and (= ~top~0 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 2147483647) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 168#(= |t1Thread1of1ForFork0_push_#res#1| 0), 836#true, Black: 302#(and (<= 1 ~top~0) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (<= ~top~0 1) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 300#(and (= ~top~0 0) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 795#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (= 3 |~#arr~0.base|)), Black: 668#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (= 3 |~#arr~0.base|)), 170#true, 275#true, Black: 319#(and (= ~top~0 0) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 335#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_inc_top_#t~post31#1| 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (<= |t1Thread1of1ForFork0_push_~x#1| 4) (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0)) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |ULTIMATE.start_main_~#id2~0#1.base|))), Black: 321#(and (<= 1 ~top~0) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (<= ~top~0 1) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 333#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (<= |t1Thread1of1ForFork0_push_~x#1| 4) (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0)) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |ULTIMATE.start_main_~#id2~0#1.base|))), 49#L1024-1true, 22#L969-3true, 614#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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)))) (forall ((v_ArrVal_255 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_255) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294))) (= 3 |~#arr~0.base|)), 790#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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|)), 458#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296)))), Black: 592#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= |~#arr~0.offset| |~#m~0.offset|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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|) (= |~#m~0.offset| 0)), Black: 611#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= |~#arr~0.offset| |~#m~0.offset|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (= 3 |~#arr~0.base|) (= |~#m~0.offset| 0)), Black: 616#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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|)), Black: 979#(and (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (forall ((v_ArrVal_373 Int) (|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (< (+ ~top~0 1) |v_t2Thread1of1ForFork1_get_top_#res#1_117|) (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (not (= 4294967294 (mod (select (select (store (store |#memory_int| |~#arr~0.base| (store (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) 4) v_ArrVal_373)) |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296))))) (<= ~top~0 1) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0)) (= 3 |~#arr~0.base|)), Black: 622#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (<= (+ 8589934588 (* (div (+ (- 4294967297) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))))) 4294967296) 4294967296) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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) (- 4)))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (forall ((v_ArrVal_255 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_255) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294))) (= 3 |~#arr~0.base|)), Black: 1011#(and (< (* ~top~0 4) 1) (forall ((v_ArrVal_373 Int) (|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (< (+ ~top~0 1) |v_t2Thread1of1ForFork1_get_top_#res#1_117|) (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (not (= 4294967294 (mod (select (select (store (store |#memory_int| |~#arr~0.base| (store (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) 4) v_ArrVal_373)) |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296)))))), Black: 983#(and (= ~top~0 0) (= |~#arr~0.offset| 0) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (exists ((aux_mod_v_arrayElimCell_18_58 Int) (aux_div_v_arrayElimCell_18_58 Int)) (and (< aux_mod_v_arrayElimCell_18_58 4294967296) (= |t2Thread1of1ForFork1_#t~ret44#1| (mod (+ 4294967295 (* 4294967295 aux_mod_v_arrayElimCell_18_58)) 4294967296)) (<= (+ (* aux_div_v_arrayElimCell_18_58 4294967296) aux_mod_v_arrayElimCell_18_58 4294967297) 0) (< 0 (+ (* aux_div_v_arrayElimCell_18_58 4294967296) 8589934593 aux_mod_v_arrayElimCell_18_58)) (<= 4294967291 aux_mod_v_arrayElimCell_18_58))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (= 3 |~#arr~0.base|)), Black: 602#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= |~#arr~0.offset| |~#m~0.offset|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (<= (+ 8589934588 (* (div (+ (- 4294967297) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))))) 4294967296) 4294967296) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= 2 ~top~0) (<= ~top~0 2) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (= 3 |~#arr~0.base|) (= |~#m~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 2147483647)), Black: 996#(and (forall ((|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296) 4294967294)) (< ~top~0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|))) (not (= (+ |t2Thread1of1ForFork1_#t~ret44#1| 2) 0)) (or (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (not (< 0 ~top~0)))), Black: 597#(and (<= 1 ~top~0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (<= (+ 8589934588 (* (div (+ (- 4294967297) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))))) 4294967296) 4294967296) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) 0) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= ~top~0 1) (= 3 |~#arr~0.base|) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |ULTIMATE.start_main_~#id2~0#1.base|)) (= |~#m~0.offset| 0)), 13#L1006-6true, Black: 938#(forall ((|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296) 4294967294)) (< ~top~0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|))), Black: 607#(and (<= 1 ~top~0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647) (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= ~top~0 1) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (= 3 |~#arr~0.base|) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |ULTIMATE.start_main_~#id2~0#1.base|)) (= |~#m~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 2147483647)), Black: 998#(and (forall ((|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296) 4294967294)) (not (<= (+ |v_t2Thread1of1ForFork1_get_top_#res#1_117| 1) ~top~0)))) (or (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (not (< 0 ~top~0))) (forall ((|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int)) (or (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296) 4294967294)) (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (not (<= (+ |v_t2Thread1of1ForFork1_get_top_#res#1_117| 1) ~top~0))))), Black: 946#(forall ((v_ArrVal_373 Int) (|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (not (= 4294967294 (mod (select (select (store (store |#memory_int| |~#arr~0.base| (store (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)) v_ArrVal_373)) |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296))) (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (< ~top~0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|))), Black: 934#(forall ((|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296) 4294967294)) (not (<= (+ |v_t2Thread1of1ForFork1_get_top_#res#1_117| 1) ~top~0)))), Black: 993#(forall ((|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296) 4294967294)) (< ~top~0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|))), Black: 957#(forall ((v_ArrVal_373 Int) (|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (< (+ ~top~0 1) |v_t2Thread1of1ForFork1_get_top_#res#1_117|) (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (not (= 4294967294 (mod (select (select (store (store |#memory_int| |~#arr~0.base| (store (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) 4) v_ArrVal_373)) |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296)))))]) [2022-12-05 22:55:28,711 INFO L382 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-05 22:55:28,711 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-05 22:55:28,711 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-05 22:55:28,711 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 22:55:28,763 INFO L130 PetriNetUnfolder]: 767/2460 cut-off events. [2022-12-05 22:55:28,764 INFO L131 PetriNetUnfolder]: For 25007/25190 co-relation queries the response was YES. [2022-12-05 22:55:28,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11862 conditions, 2460 events. 767/2460 cut-off events. For 25007/25190 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 20346 event pairs, 220 based on Foata normal form. 3/2073 useless extension candidates. Maximal degree in co-relation 11548. Up to 663 conditions per place. [2022-12-05 22:55:28,794 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 278 transitions, 4748 flow [2022-12-05 22:55:28,795 INFO L188 LiptonReduction]: Number of co-enabled transitions 1678 [2022-12-05 22:55:31,891 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-05 22:55:31,892 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3452 [2022-12-05 22:55:31,892 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 275 transitions, 4818 flow [2022-12-05 22:55:31,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.588235294117647) internal successors, (156), 34 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:31,892 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:55:31,892 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:55:31,898 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-05 22:55:32,096 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,SelfDestructingSolverStorable11 [2022-12-05 22:55:32,099 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:55:32,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:55:32,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1425230774, now seen corresponding path program 1 times [2022-12-05 22:55:32,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:55:32,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169491669] [2022-12-05 22:55:32,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:55:32,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:55:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:55:32,180 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:55:32,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:55:32,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169491669] [2022-12-05 22:55:32,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169491669] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:55:32,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811019351] [2022-12-05 22:55:32,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:55:32,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:55:32,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:55:32,182 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-05 22:55:32,184 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-05 22:55:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:55:32,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-05 22:55:32,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:55:32,300 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:55:32,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:55:32,352 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:55:32,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811019351] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:55:32,352 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:55:32,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-12-05 22:55:32,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955812117] [2022-12-05 22:55:32,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:55:32,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-05 22:55:32,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:55:32,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-05 22:55:32,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-12-05 22:55:32,354 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 66 [2022-12-05 22:55:32,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 275 transitions, 4818 flow. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:32,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:55:32,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 66 [2022-12-05 22:55:32,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:55:33,765 INFO L130 PetriNetUnfolder]: 4004/7979 cut-off events. [2022-12-05 22:55:33,765 INFO L131 PetriNetUnfolder]: For 86351/86351 co-relation queries the response was YES. [2022-12-05 22:55:33,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40359 conditions, 7979 events. 4004/7979 cut-off events. For 86351/86351 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 58372 event pairs, 1505 based on Foata normal form. 139/8118 useless extension candidates. Maximal degree in co-relation 40050. Up to 2859 conditions per place. [2022-12-05 22:55:33,814 INFO L137 encePairwiseOnDemand]: 34/66 looper letters, 226 selfloop transitions, 157 changer transitions 8/394 dead transitions. [2022-12-05 22:55:33,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 394 transitions, 6735 flow [2022-12-05 22:55:33,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 22:55:33,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 22:55:33,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions. [2022-12-05 22:55:33,815 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30976430976430974 [2022-12-05 22:55:33,815 INFO L175 Difference]: Start difference. First operand has 151 places, 275 transitions, 4818 flow. Second operand 9 states and 184 transitions. [2022-12-05 22:55:33,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 394 transitions, 6735 flow [2022-12-05 22:55:33,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 394 transitions, 6048 flow, removed 319 selfloop flow, removed 9 redundant places. [2022-12-05 22:55:33,989 INFO L231 Difference]: Finished difference. Result has 154 places, 287 transitions, 4945 flow [2022-12-05 22:55:33,989 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=3700, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4945, PETRI_PLACES=154, PETRI_TRANSITIONS=287} [2022-12-05 22:55:33,990 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 112 predicate places. [2022-12-05 22:55:33,990 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:55:33,990 INFO L89 Accepts]: Start accepts. Operand has 154 places, 287 transitions, 4945 flow [2022-12-05 22:55:33,992 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:55:33,992 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:55:33,992 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 287 transitions, 4945 flow [2022-12-05 22:55:33,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 287 transitions, 4945 flow [2022-12-05 22:55:34,345 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([620] L962-->L969-3: Formula: (and (= |v_t1Thread1of1ForFork0_get_top_#res#1_62| |v_t1Thread1of1ForFork0_push_#t~ret34#1_102|) (<= 0 (+ |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 2147483648)) (= |v_t1Thread1of1ForFork0_get_top_#res#1_62| v_~top~0_376) (= (store |v_#memory_int_158| |v_t1Thread1of1ForFork0_push_~stack#1.base_66| (store (select |v_#memory_int_158| |v_t1Thread1of1ForFork0_push_~stack#1.base_66|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_66| (* |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 4)) |v_t1Thread1of1ForFork0_push_~x#1_66|)) |v_#memory_int_157|) (not (= 5 v_~top~0_376)) (<= |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 2147483647)) InVars {t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_66|, #memory_int=|v_#memory_int_158|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_66|, ~top~0=v_~top~0_376, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_66|} OutVars{t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_66|, t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_102|, #memory_int=|v_#memory_int_157|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_66|, t1Thread1of1ForFork0_get_top_#res#1=|v_t1Thread1of1ForFork0_get_top_#res#1_62|, ~top~0=v_~top~0_376, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_66|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~ret34#1, #memory_int, t1Thread1of1ForFork0_get_top_#res#1][68], [Black: 986#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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|)), Black: 1036#(<= ~top~0 1), Black: 881#(and (<= (+ (select (select |#memory_int| |~#arr~0.base|) |~#arr~0.offset|) (* (div (+ (- 4294967297) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) |~#arr~0.offset|))) 4294967296) 4294967296) 8589934588) 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) |~#arr~0.offset|)) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (= ~top~0 1) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< (select (select |#memory_int| |~#arr~0.base|) |~#arr~0.offset|) 4294967296) (= 3 |~#arr~0.base|)), Black: 981#(and (= |~#arr~0.offset| 0) (forall ((v_ArrVal_373 Int) (|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (< ~top~0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|) (not (= 4294967294 (mod (select (select (store (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_373)) |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296))))) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (forall ((v_ArrVal_373 Int) (|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (< (+ ~top~0 1) |v_t2Thread1of1ForFork1_get_top_#res#1_117|) (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (not (= 4294967294 (mod (select (select (store (store |#memory_int| |~#arr~0.base| (store (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) 4) v_ArrVal_373)) |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296))))) (<= ~top~0 1) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0)) (= 3 |~#arr~0.base|)), Black: 866#(and (= ~top~0 0) (= |~#arr~0.offset| 0) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< (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|)), Black: 1000#(and (< (* ~top~0 4) 1) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0)) (= 3 |~#arr~0.base|)), Black: 174#(<= ~top~0 1), Black: 219#(not (<= 5 ~top~0)), Black: 178#(<= ~top~0 0), 1032#true, 96#t2EXITtrue, t2Thread1of1ForFork1InUse, 815#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (<= (+ 8589934588 (* (div (+ (- 4294967297) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))))) 4294967296) 4294967296) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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) (- 4)))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (= 3 |~#arr~0.base|)), Black: 278#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647) (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0)), Black: 281#(and (<= 1 ~top~0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 2147483647) (= |~#arr~0.offset| 0) (<= ~top~0 1) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 284#(and (= ~top~0 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 2147483647) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647) (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 164#(= ~top~0 0), Black: 279#(and (= ~top~0 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 2147483647) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 168#(= |t1Thread1of1ForFork0_push_#res#1| 0), 836#true, Black: 302#(and (<= 1 ~top~0) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (<= ~top~0 1) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 300#(and (= ~top~0 0) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 795#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (= 3 |~#arr~0.base|)), Black: 668#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (= 3 |~#arr~0.base|)), 170#true, 275#true, Black: 319#(and (= ~top~0 0) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 321#(and (<= 1 ~top~0) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (<= ~top~0 1) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 333#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (<= |t1Thread1of1ForFork0_push_~x#1| 4) (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0)) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |ULTIMATE.start_main_~#id2~0#1.base|))), 49#L1024-1true, 22#L969-3true, 614#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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)))) (forall ((v_ArrVal_255 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_255) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294))) (= 3 |~#arr~0.base|)), 458#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296)))), Black: 592#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= |~#arr~0.offset| |~#m~0.offset|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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|) (= |~#m~0.offset| 0)), Black: 616#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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|)), Black: 979#(and (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (forall ((v_ArrVal_373 Int) (|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (< (+ ~top~0 1) |v_t2Thread1of1ForFork1_get_top_#res#1_117|) (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (not (= 4294967294 (mod (select (select (store (store |#memory_int| |~#arr~0.base| (store (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) 4) v_ArrVal_373)) |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296))))) (<= ~top~0 1) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0)) (= 3 |~#arr~0.base|)), Black: 622#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (<= (+ 8589934588 (* (div (+ (- 4294967297) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))))) 4294967296) 4294967296) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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) (- 4)))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (forall ((v_ArrVal_255 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_255) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294))) (= 3 |~#arr~0.base|)), Black: 1011#(and (< (* ~top~0 4) 1) (forall ((v_ArrVal_373 Int) (|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (< (+ ~top~0 1) |v_t2Thread1of1ForFork1_get_top_#res#1_117|) (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (not (= 4294967294 (mod (select (select (store (store |#memory_int| |~#arr~0.base| (store (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) 4) v_ArrVal_373)) |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296)))))), Black: 602#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= |~#arr~0.offset| |~#m~0.offset|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (<= (+ 8589934588 (* (div (+ (- 4294967297) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))))) 4294967296) 4294967296) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= 2 ~top~0) (<= ~top~0 2) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (= 3 |~#arr~0.base|) (= |~#m~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 2147483647)), Black: 597#(and (<= 1 ~top~0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (<= (+ 8589934588 (* (div (+ (- 4294967297) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))))) 4294967296) 4294967296) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) 0) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= ~top~0 1) (= 3 |~#arr~0.base|) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |ULTIMATE.start_main_~#id2~0#1.base|)) (= |~#m~0.offset| 0)), Black: 607#(and (<= 1 ~top~0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647) (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= ~top~0 1) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (= 3 |~#arr~0.base|) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |ULTIMATE.start_main_~#id2~0#1.base|)) (= |~#m~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 2147483647)), Black: 998#(and (forall ((|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296) 4294967294)) (not (<= (+ |v_t2Thread1of1ForFork1_get_top_#res#1_117| 1) ~top~0)))) (or (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (not (< 0 ~top~0))) (forall ((|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int)) (or (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296) 4294967294)) (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (not (<= (+ |v_t2Thread1of1ForFork1_get_top_#res#1_117| 1) ~top~0))))), Black: 946#(forall ((v_ArrVal_373 Int) (|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (not (= 4294967294 (mod (select (select (store (store |#memory_int| |~#arr~0.base| (store (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)) v_ArrVal_373)) |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296))) (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (< ~top~0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|))), Black: 934#(forall ((|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296) 4294967294)) (not (<= (+ |v_t2Thread1of1ForFork1_get_top_#res#1_117| 1) ~top~0)))), Black: 1034#(= ~top~0 0), Black: 993#(forall ((|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296) 4294967294)) (< ~top~0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|))), Black: 1037#(<= ~top~0 2), Black: 1038#(<= ~top~0 3), Black: 957#(forall ((v_ArrVal_373 Int) (|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (< (+ ~top~0 1) |v_t2Thread1of1ForFork1_get_top_#res#1_117|) (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (not (= 4294967294 (mod (select (select (store (store |#memory_int| |~#arr~0.base| (store (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) 4) v_ArrVal_373)) |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296)))))]) [2022-12-05 22:55:34,345 INFO L382 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-05 22:55:34,345 INFO L385 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-05 22:55:34,345 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-05 22:55:34,345 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-05 22:55:34,357 INFO L130 PetriNetUnfolder]: 838/2627 cut-off events. [2022-12-05 22:55:34,357 INFO L131 PetriNetUnfolder]: For 22985/23144 co-relation queries the response was YES. [2022-12-05 22:55:34,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12395 conditions, 2627 events. 838/2627 cut-off events. For 22985/23144 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 22209 event pairs, 277 based on Foata normal form. 2/2252 useless extension candidates. Maximal degree in co-relation 10417. Up to 907 conditions per place. [2022-12-05 22:55:34,385 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 287 transitions, 4945 flow [2022-12-05 22:55:34,386 INFO L188 LiptonReduction]: Number of co-enabled transitions 1712 [2022-12-05 22:55:34,783 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [596] L992-6-->L962: Formula: (let ((.cse1 (mod |v_t1Thread1of1ForFork0_~tmp~0#1_Out_8| 4294967296)) (.cse0 (select |v_#pthreadsMutex_In_13| |v_~#m~0.base_In_16|))) (and (not (= |v_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= |v_t1Thread1of1ForFork0_push_#in~stack#1.offset_Out_4| |v_t1Thread1of1ForFork0_push_~stack#1.offset_Out_10|) (= |v_t1Thread1of1ForFork0_#t~nondet40#1_In_3| |v_t1Thread1of1ForFork0_~tmp~0#1_Out_8|) (= |v_t1Thread1of1ForFork0_push_~stack#1.base_Out_10| |v_t1Thread1of1ForFork0_push_#in~stack#1.base_Out_4|) (< |v_t1Thread1of1ForFork0_~i~0#1_In_6| 5) (= |v_t1Thread1of1ForFork0_push_#in~stack#1.offset_Out_4| |v_~#arr~0.offset_In_9|) (= |v_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_t1Thread1of1ForFork0_push_~x#1_Out_12| |v_t1Thread1of1ForFork0_push_#in~x#1_Out_4|) (= (select .cse0 |v_~#m~0.offset_In_16|) 0) (= (ite (< .cse1 5) 1 0) |v_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_~#arr~0.base_In_9| |v_t1Thread1of1ForFork0_push_#in~stack#1.base_Out_4|) (= (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) |v_t1Thread1of1ForFork0_push_#in~x#1_Out_4|) (= |v_#pthreadsMutex_Out_28| (store |v_#pthreadsMutex_In_13| |v_~#m~0.base_In_16| (store .cse0 |v_~#m~0.offset_In_16| 1))))) InVars {~#arr~0.offset=|v_~#arr~0.offset_In_9|, #pthreadsMutex=|v_#pthreadsMutex_In_13|, ~#m~0.base=|v_~#m~0.base_In_16|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_In_6|, ~#m~0.offset=|v_~#m~0.offset_In_16|, ~#arr~0.base=|v_~#arr~0.base_In_9|, t1Thread1of1ForFork0_#t~nondet40#1=|v_t1Thread1of1ForFork0_#t~nondet40#1_In_3|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_In_9|, #pthreadsMutex=|v_#pthreadsMutex_Out_28|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_In_6|, t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_Out_12|, t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_Out_8|, t1Thread1of1ForFork0_push_#in~stack#1.offset=|v_t1Thread1of1ForFork0_push_#in~stack#1.offset_Out_4|, t1Thread1of1ForFork0_push_#in~x#1=|v_t1Thread1of1ForFork0_push_#in~x#1_Out_4|, t1Thread1of1ForFork0_push_#in~stack#1.base=|v_t1Thread1of1ForFork0_push_#in~stack#1.base_Out_4|, t1Thread1of1ForFork0_push_#res#1=|v_t1Thread1of1ForFork0_push_#res#1_Out_14|, ~#m~0.base=|v_~#m~0.base_In_16|, t1Thread1of1ForFork0_~tmp~0#1=|v_t1Thread1of1ForFork0_~tmp~0#1_Out_8|, ~#m~0.offset=|v_~#m~0.offset_In_16|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_Out_10|, t1Thread1of1ForFork0_push_#t~nondet33#1=|v_t1Thread1of1ForFork0_push_#t~nondet33#1_Out_10|, t1Thread1of1ForFork0_#t~nondet39#1=|v_t1Thread1of1ForFork0_#t~nondet39#1_Out_6|, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_Out_10|, ~#arr~0.base=|v_~#arr~0.base_In_9|, t1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork0_push_~x#1, t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, t1Thread1of1ForFork0_push_#t~ret34#1, t1Thread1of1ForFork0_push_#in~stack#1.offset, t1Thread1of1ForFork0_push_#in~x#1, t1Thread1of1ForFork0_push_#in~stack#1.base, t1Thread1of1ForFork0_#t~nondet40#1, t1Thread1of1ForFork0_push_#res#1, t1Thread1of1ForFork0_~tmp~0#1, t1Thread1of1ForFork0_push_~stack#1.base, t1Thread1of1ForFork0_push_#t~nondet33#1, t1Thread1of1ForFork0_#t~nondet39#1, t1Thread1of1ForFork0_push_~stack#1.offset, t1Thread1of1ForFork0_assume_abort_if_not_~cond#1] and [600] L1006-6-->t2EXIT: Formula: (and (not (< |v_t2Thread1of1ForFork1_~i~1#1_In_6| 5)) (= |v_t2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_t2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_In_6|} OutVars{t2Thread1of1ForFork1_#res#1.base=|v_t2Thread1of1ForFork1_#res#1.base_Out_4|, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_In_6|, t2Thread1of1ForFork1_#res#1.offset=|v_t2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#res#1.base, t2Thread1of1ForFork1_#res#1.offset] [2022-12-05 22:55:35,159 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:55:35,160 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1170 [2022-12-05 22:55:35,160 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 287 transitions, 4967 flow [2022-12-05 22:55:35,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:35,160 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:55:35,160 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:55:35,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-05 22:55:35,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:55:35,367 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:55:35,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:55:35,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1507384398, now seen corresponding path program 1 times [2022-12-05 22:55:35,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:55:35,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683358743] [2022-12-05 22:55:35,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:55:35,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:55:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:55:35,516 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:55:35,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:55:35,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683358743] [2022-12-05 22:55:35,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683358743] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:55:35,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726085403] [2022-12-05 22:55:35,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:55:35,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:55:35,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:55:35,518 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:55:35,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-05 22:55:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:55:35,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-05 22:55:35,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:55:35,659 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:55:35,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:55:35,711 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:55:35,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726085403] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:55:35,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:55:35,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-12-05 22:55:35,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129373205] [2022-12-05 22:55:35,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:55:35,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-05 22:55:35,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:55:35,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-05 22:55:35,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-12-05 22:55:35,712 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 67 [2022-12-05 22:55:35,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 287 transitions, 4967 flow. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:35,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:55:35,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 67 [2022-12-05 22:55:35,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:55:37,366 INFO L130 PetriNetUnfolder]: 4742/9407 cut-off events. [2022-12-05 22:55:37,367 INFO L131 PetriNetUnfolder]: For 93450/93450 co-relation queries the response was YES. [2022-12-05 22:55:37,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47170 conditions, 9407 events. 4742/9407 cut-off events. For 93450/93450 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 70561 event pairs, 1716 based on Foata normal form. 77/9430 useless extension candidates. Maximal degree in co-relation 41612. Up to 3444 conditions per place. [2022-12-05 22:55:37,439 INFO L137 encePairwiseOnDemand]: 35/67 looper letters, 244 selfloop transitions, 207 changer transitions 8/462 dead transitions. [2022-12-05 22:55:37,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 462 transitions, 7847 flow [2022-12-05 22:55:37,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-05 22:55:37,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-05 22:55:37,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 225 transitions. [2022-12-05 22:55:37,441 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2798507462686567 [2022-12-05 22:55:37,441 INFO L175 Difference]: Start difference. First operand has 152 places, 287 transitions, 4967 flow. Second operand 12 states and 225 transitions. [2022-12-05 22:55:37,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 462 transitions, 7847 flow [2022-12-05 22:55:37,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 462 transitions, 7757 flow, removed 45 selfloop flow, removed 1 redundant places. [2022-12-05 22:55:37,642 INFO L231 Difference]: Finished difference. Result has 167 places, 333 transitions, 6555 flow [2022-12-05 22:55:37,643 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=4881, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6555, PETRI_PLACES=167, PETRI_TRANSITIONS=333} [2022-12-05 22:55:37,643 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 125 predicate places. [2022-12-05 22:55:37,643 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:55:37,643 INFO L89 Accepts]: Start accepts. Operand has 167 places, 333 transitions, 6555 flow [2022-12-05 22:55:37,645 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:55:37,645 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:55:37,645 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 333 transitions, 6555 flow [2022-12-05 22:55:37,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 333 transitions, 6555 flow [2022-12-05 22:55:38,047 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([620] L962-->L969-3: Formula: (and (= |v_t1Thread1of1ForFork0_get_top_#res#1_62| |v_t1Thread1of1ForFork0_push_#t~ret34#1_102|) (<= 0 (+ |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 2147483648)) (= |v_t1Thread1of1ForFork0_get_top_#res#1_62| v_~top~0_376) (= (store |v_#memory_int_158| |v_t1Thread1of1ForFork0_push_~stack#1.base_66| (store (select |v_#memory_int_158| |v_t1Thread1of1ForFork0_push_~stack#1.base_66|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_66| (* |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 4)) |v_t1Thread1of1ForFork0_push_~x#1_66|)) |v_#memory_int_157|) (not (= 5 v_~top~0_376)) (<= |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 2147483647)) InVars {t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_66|, #memory_int=|v_#memory_int_158|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_66|, ~top~0=v_~top~0_376, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_66|} OutVars{t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_66|, t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_102|, #memory_int=|v_#memory_int_157|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_66|, t1Thread1of1ForFork0_get_top_#res#1=|v_t1Thread1of1ForFork0_get_top_#res#1_62|, ~top~0=v_~top~0_376, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_66|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~ret34#1, #memory_int, t1Thread1of1ForFork0_get_top_#res#1][68], [Black: 986#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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|)), Black: 1036#(<= ~top~0 1), Black: 881#(and (<= (+ (select (select |#memory_int| |~#arr~0.base|) |~#arr~0.offset|) (* (div (+ (- 4294967297) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) |~#arr~0.offset|))) 4294967296) 4294967296) 8589934588) 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) |~#arr~0.offset|)) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (= ~top~0 1) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< (select (select |#memory_int| |~#arr~0.base|) |~#arr~0.offset|) 4294967296) (= 3 |~#arr~0.base|)), Black: 866#(and (= ~top~0 0) (= |~#arr~0.offset| 0) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< (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|)), Black: 1000#(and (< (* ~top~0 4) 1) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0)) (= 3 |~#arr~0.base|)), Black: 1228#(not (<= 5 ~top~0)), Black: 174#(<= ~top~0 1), Black: 1159#(<= ~top~0 1), Black: 219#(not (<= 5 ~top~0)), Black: 1160#(<= ~top~0 2), Black: 178#(<= ~top~0 0), 1032#true, Black: 1157#(= ~top~0 0), 96#t2EXITtrue, t2Thread1of1ForFork1InUse, 815#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (<= (+ 8589934588 (* (div (+ (- 4294967297) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))))) 4294967296) 4294967296) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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) (- 4)))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (= 3 |~#arr~0.base|)), Black: 278#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647) (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0)), Black: 281#(and (<= 1 ~top~0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 2147483647) (= |~#arr~0.offset| 0) (<= ~top~0 1) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 164#(= ~top~0 0), Black: 284#(and (= ~top~0 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 2147483647) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647) (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 279#(and (= ~top~0 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 2147483647) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 168#(= |t1Thread1of1ForFork0_push_#res#1| 0), Black: 302#(and (<= 1 ~top~0) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (<= ~top~0 1) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), 836#true, Black: 300#(and (= ~top~0 0) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 795#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (= 3 |~#arr~0.base|)), Black: 668#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (= 3 |~#arr~0.base|)), 170#true, 275#true, Black: 319#(and (= ~top~0 0) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 321#(and (<= 1 ~top~0) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (<= ~top~0 1) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 333#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (<= |t1Thread1of1ForFork0_push_~x#1| 4) (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0)) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |ULTIMATE.start_main_~#id2~0#1.base|))), 49#L1024-1true, 22#L969-3true, 1162#(<= ~top~0 3), 614#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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)))) (forall ((v_ArrVal_255 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_255) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294))) (= 3 |~#arr~0.base|)), 458#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296)))), Black: 592#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= |~#arr~0.offset| |~#m~0.offset|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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|) (= |~#m~0.offset| 0)), Black: 979#(and (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (forall ((v_ArrVal_373 Int) (|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (< (+ ~top~0 1) |v_t2Thread1of1ForFork1_get_top_#res#1_117|) (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (not (= 4294967294 (mod (select (select (store (store |#memory_int| |~#arr~0.base| (store (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) 4) v_ArrVal_373)) |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296))))) (<= ~top~0 1) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0)) (= 3 |~#arr~0.base|)), Black: 616#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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|)), Black: 1011#(and (< (* ~top~0 4) 1) (forall ((v_ArrVal_373 Int) (|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (< (+ ~top~0 1) |v_t2Thread1of1ForFork1_get_top_#res#1_117|) (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (not (= 4294967294 (mod (select (select (store (store |#memory_int| |~#arr~0.base| (store (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) 4) v_ArrVal_373)) |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296)))))), Black: 622#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (<= (+ 8589934588 (* (div (+ (- 4294967297) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))))) 4294967296) 4294967296) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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) (- 4)))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (forall ((v_ArrVal_255 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_255) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294))) (= 3 |~#arr~0.base|)), Black: 602#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= |~#arr~0.offset| |~#m~0.offset|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (<= (+ 8589934588 (* (div (+ (- 4294967297) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))))) 4294967296) 4294967296) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= 2 ~top~0) (<= ~top~0 2) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (= 3 |~#arr~0.base|) (= |~#m~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 2147483647)), Black: 597#(and (<= 1 ~top~0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (<= (+ 8589934588 (* (div (+ (- 4294967297) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))))) 4294967296) 4294967296) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) 0) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= ~top~0 1) (= 3 |~#arr~0.base|) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |ULTIMATE.start_main_~#id2~0#1.base|)) (= |~#m~0.offset| 0)), Black: 607#(and (<= 1 ~top~0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647) (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= ~top~0 1) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (= 3 |~#arr~0.base|) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |ULTIMATE.start_main_~#id2~0#1.base|)) (= |~#m~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 2147483647)), Black: 998#(and (forall ((|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296) 4294967294)) (not (<= (+ |v_t2Thread1of1ForFork1_get_top_#res#1_117| 1) ~top~0)))) (or (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (not (< 0 ~top~0))) (forall ((|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int)) (or (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296) 4294967294)) (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (not (<= (+ |v_t2Thread1of1ForFork1_get_top_#res#1_117| 1) ~top~0))))), Black: 946#(forall ((v_ArrVal_373 Int) (|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (not (= 4294967294 (mod (select (select (store (store |#memory_int| |~#arr~0.base| (store (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)) v_ArrVal_373)) |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296))) (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (< ~top~0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|))), Black: 934#(forall ((|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296) 4294967294)) (not (<= (+ |v_t2Thread1of1ForFork1_get_top_#res#1_117| 1) ~top~0)))), Black: 1034#(= ~top~0 0), Black: 993#(forall ((|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296) 4294967294)) (< ~top~0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|))), Black: 1037#(<= ~top~0 2), Black: 957#(forall ((v_ArrVal_373 Int) (|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (< (+ ~top~0 1) |v_t2Thread1of1ForFork1_get_top_#res#1_117|) (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (not (= 4294967294 (mod (select (select (store (store |#memory_int| |~#arr~0.base| (store (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) 4) v_ArrVal_373)) |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296))))), Black: 1038#(<= ~top~0 3)]) [2022-12-05 22:55:38,048 INFO L382 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-05 22:55:38,048 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-05 22:55:38,048 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-05 22:55:38,048 INFO L385 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-05 22:55:38,063 INFO L130 PetriNetUnfolder]: 1058/3113 cut-off events. [2022-12-05 22:55:38,063 INFO L131 PetriNetUnfolder]: For 33097/33304 co-relation queries the response was YES. [2022-12-05 22:55:38,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16079 conditions, 3113 events. 1058/3113 cut-off events. For 33097/33304 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 26925 event pairs, 365 based on Foata normal form. 5/2689 useless extension candidates. Maximal degree in co-relation 13974. Up to 1214 conditions per place. [2022-12-05 22:55:38,115 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 333 transitions, 6555 flow [2022-12-05 22:55:38,115 INFO L188 LiptonReduction]: Number of co-enabled transitions 1998 [2022-12-05 22:55:38,287 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:55:38,288 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 645 [2022-12-05 22:55:38,288 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 333 transitions, 6560 flow [2022-12-05 22:55:38,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:38,288 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:55:38,288 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:55:38,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-05 22:55:38,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:55:38,493 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:55:38,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:55:38,494 INFO L85 PathProgramCache]: Analyzing trace with hash 131619188, now seen corresponding path program 1 times [2022-12-05 22:55:38,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:55:38,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141152705] [2022-12-05 22:55:38,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:55:38,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:55:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:55:39,056 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:55:39,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:55:39,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141152705] [2022-12-05 22:55:39,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141152705] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:55:39,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930527255] [2022-12-05 22:55:39,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:55:39,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:55:39,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:55:39,058 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:55:39,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-05 22:55:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:55:39,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-05 22:55:39,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:55:39,188 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-05 22:55:39,188 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-05 22:55:39,387 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 20 treesize of output 15 [2022-12-05 22:55:39,434 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 51 treesize of output 46 [2022-12-05 22:55:39,517 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-05 22:55:39,761 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:55:39,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:55:39,863 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 22:55:39,864 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-05 22:55:39,869 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 22:55:39,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2022-12-05 22:55:39,873 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-05 22:55:39,961 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-05 22:55:39,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930527255] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:55:39,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:55:39,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 21 [2022-12-05 22:55:39,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032388170] [2022-12-05 22:55:39,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:55:39,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-05 22:55:39,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:55:39,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-05 22:55:39,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=429, Unknown=3, NotChecked=0, Total=506 [2022-12-05 22:55:39,963 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 72 [2022-12-05 22:55:39,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 333 transitions, 6560 flow. Second operand has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 23 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:39,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:55:39,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 72 [2022-12-05 22:55:39,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:55:42,664 INFO L130 PetriNetUnfolder]: 4584/9279 cut-off events. [2022-12-05 22:55:42,664 INFO L131 PetriNetUnfolder]: For 98170/98170 co-relation queries the response was YES. [2022-12-05 22:55:42,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47782 conditions, 9279 events. 4584/9279 cut-off events. For 98170/98170 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 71441 event pairs, 1323 based on Foata normal form. 90/9315 useless extension candidates. Maximal degree in co-relation 41697. Up to 3670 conditions per place. [2022-12-05 22:55:42,741 INFO L137 encePairwiseOnDemand]: 39/72 looper letters, 306 selfloop transitions, 102 changer transitions 5/416 dead transitions. [2022-12-05 22:55:42,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 416 transitions, 7830 flow [2022-12-05 22:55:42,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 22:55:42,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 22:55:42,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 200 transitions. [2022-12-05 22:55:42,742 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25252525252525254 [2022-12-05 22:55:42,743 INFO L175 Difference]: Start difference. First operand has 165 places, 333 transitions, 6560 flow. Second operand 11 states and 200 transitions. [2022-12-05 22:55:42,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 416 transitions, 7830 flow [2022-12-05 22:55:42,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 416 transitions, 7131 flow, removed 281 selfloop flow, removed 10 redundant places. [2022-12-05 22:55:42,987 INFO L231 Difference]: Finished difference. Result has 167 places, 307 transitions, 5924 flow [2022-12-05 22:55:42,987 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=5131, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5924, PETRI_PLACES=167, PETRI_TRANSITIONS=307} [2022-12-05 22:55:42,988 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 125 predicate places. [2022-12-05 22:55:42,988 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:55:42,988 INFO L89 Accepts]: Start accepts. Operand has 167 places, 307 transitions, 5924 flow [2022-12-05 22:55:42,990 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:55:42,990 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:55:42,990 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 307 transitions, 5924 flow [2022-12-05 22:55:42,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 307 transitions, 5924 flow [2022-12-05 22:55:43,293 INFO L130 PetriNetUnfolder]: 1007/2964 cut-off events. [2022-12-05 22:55:43,293 INFO L131 PetriNetUnfolder]: For 24880/25081 co-relation queries the response was YES. [2022-12-05 22:55:43,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13820 conditions, 2964 events. 1007/2964 cut-off events. For 24880/25081 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 25490 event pairs, 366 based on Foata normal form. 5/2554 useless extension candidates. Maximal degree in co-relation 11475. Up to 1206 conditions per place. [2022-12-05 22:55:43,328 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 307 transitions, 5924 flow [2022-12-05 22:55:43,328 INFO L188 LiptonReduction]: Number of co-enabled transitions 1880 [2022-12-05 22:55:44,127 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [653] L1006-6-->L1006-6: Formula: (let ((.cse0 (select |v_#pthreadsMutex_448| |v_~#m~0.base_192|))) (and (not (= (+ 2 |v_t2Thread1of1ForFork1_pop_#res#1_140|) 0)) (= |v_t2Thread1of1ForFork1_get_top_#res#1_110| v_~top~0_528) (<= |v_t2Thread1of1ForFork1_get_top_#res#1_110| 2147483647) (= |v_#pthreadsMutex_446| (store |v_#pthreadsMutex_448| |v_~#m~0.base_192| (store .cse0 |v_~#m~0.offset_194| 0))) (= (select .cse0 |v_~#m~0.offset_194|) 0) (= (let ((.cse1 (mod (select (select |v_#memory_int_251| |v_t2Thread1of1ForFork1_pop_~stack#1.base_155|) (+ |v_t2Thread1of1ForFork1_pop_~stack#1.offset_155| (* |v_t2Thread1of1ForFork1_get_top_#res#1_110| 4))) 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) |v_t2Thread1of1ForFork1_pop_#res#1_140|) (= |v_t2Thread1of1ForFork1_~i~1#1_228| (+ |v_t2Thread1of1ForFork1_~i~1#1_229| 1)) (= |v_~#arr~0.base_139| |v_t2Thread1of1ForFork1_pop_#in~stack#1.base_121|) (= |v_t2Thread1of1ForFork1_pop_~stack#1.offset_155| |v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_121|) (< 0 v_~top~0_529) (= |v_t2Thread1of1ForFork1_pop_~stack#1.base_155| |v_t2Thread1of1ForFork1_pop_#in~stack#1.base_121|) (< |v_t2Thread1of1ForFork1_~i~1#1_229| 5) (= |v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_121| |v_~#arr~0.offset_139|) (= (+ v_~top~0_528 1) v_~top~0_529))) InVars {#pthreadsMutex=|v_#pthreadsMutex_448|, ~#arr~0.offset=|v_~#arr~0.offset_139|, ~#m~0.base=|v_~#m~0.base_192|, ~#m~0.offset=|v_~#m~0.offset_194|, #memory_int=|v_#memory_int_251|, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_229|, ~top~0=v_~top~0_529, ~#arr~0.base=|v_~#arr~0.base_139|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_446|, ~#arr~0.offset=|v_~#arr~0.offset_139|, t2Thread1of1ForFork1_pop_#t~mem37#1=|v_t2Thread1of1ForFork1_pop_#t~mem37#1_120|, t2Thread1of1ForFork1_get_top_#res#1=|v_t2Thread1of1ForFork1_get_top_#res#1_110|, t2Thread1of1ForFork1_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_121|, t2Thread1of1ForFork1_#t~nondet43#1=|v_t2Thread1of1ForFork1_#t~nondet43#1_157|, t2Thread1of1ForFork1_pop_#t~ret36#1=|v_t2Thread1of1ForFork1_pop_#t~ret36#1_130|, t2Thread1of1ForFork1_pop_~stack#1.offset=|v_t2Thread1of1ForFork1_pop_~stack#1.offset_155|, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_228|, ~top~0=v_~top~0_528, t2Thread1of1ForFork1_pop_#res#1=|v_t2Thread1of1ForFork1_pop_#res#1_140|, t2Thread1of1ForFork1_dec_top_#t~post32#1=|v_t2Thread1of1ForFork1_dec_top_#t~post32#1_241|, ~#m~0.base=|v_~#m~0.base_192|, t2Thread1of1ForFork1_pop_~stack#1.base=|v_t2Thread1of1ForFork1_pop_~stack#1.base_155|, t2Thread1of1ForFork1_#t~post42#1=|v_t2Thread1of1ForFork1_#t~post42#1_105|, ~#m~0.offset=|v_~#m~0.offset_194|, t2Thread1of1ForFork1_#t~ret44#1=|v_t2Thread1of1ForFork1_#t~ret44#1_166|, #memory_int=|v_#memory_int_251|, t2Thread1of1ForFork1_pop_#t~nondet35#1=|v_t2Thread1of1ForFork1_pop_#t~nondet35#1_106|, t2Thread1of1ForFork1_pop_#in~stack#1.base=|v_t2Thread1of1ForFork1_pop_#in~stack#1.base_121|, ~#arr~0.base=|v_~#arr~0.base_139|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_pop_#t~mem37#1, t2Thread1of1ForFork1_get_top_#res#1, t2Thread1of1ForFork1_pop_#in~stack#1.offset, t2Thread1of1ForFork1_#t~nondet43#1, t2Thread1of1ForFork1_pop_#t~ret36#1, t2Thread1of1ForFork1_pop_~stack#1.offset, t2Thread1of1ForFork1_~i~1#1, ~top~0, t2Thread1of1ForFork1_pop_#res#1, t2Thread1of1ForFork1_dec_top_#t~post32#1, t2Thread1of1ForFork1_pop_~stack#1.base, t2Thread1of1ForFork1_#t~post42#1, t2Thread1of1ForFork1_#t~ret44#1, t2Thread1of1ForFork1_pop_#t~nondet35#1, t2Thread1of1ForFork1_pop_#in~stack#1.base] and [675] L992-6-->t2EXIT: Formula: (let ((.cse0 (select |v_#pthreadsMutex_558| |v_~#m~0.base_234|)) (.cse1 (mod |v_t1Thread1of1ForFork0_~tmp~0#1_132| 4294967296))) (and (not (< |v_t2Thread1of1ForFork1_~i~1#1_269| 5)) (= |v_t1Thread1of1ForFork0_push_#in~stack#1.offset_70| |v_~#arr~0.offset_183|) (= |v_t1Thread1of1ForFork0_~tmp~0#1_132| |v_t1Thread1of1ForFork0_#t~nondet40#1_172|) (= |v_t2Thread1of1ForFork1_#res#1.base_13| 0) (= |v_#pthreadsMutex_557| (store |v_#pthreadsMutex_558| |v_~#m~0.base_234| (store .cse0 |v_~#m~0.offset_236| 1))) (= |v_t2Thread1of1ForFork1_#res#1.offset_13| 0) (not (= |v_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1_124| 0)) (= |v_t1Thread1of1ForFork0_push_#in~stack#1.base_70| |v_t1Thread1of1ForFork0_push_~stack#1.base_127|) (= |v_t1Thread1of1ForFork0_push_#in~x#1_70| (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) (= 0 (select .cse0 |v_~#m~0.offset_236|)) (= (ite (< .cse1 5) 1 0) |v_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_112|) (= |v_t1Thread1of1ForFork0_push_#in~stack#1.base_70| |v_~#arr~0.base_183|) (= |v_t1Thread1of1ForFork0_push_~x#1_127| |v_t1Thread1of1ForFork0_push_#in~x#1_70|) (= |v_t1Thread1of1ForFork0_push_#in~stack#1.offset_70| |v_t1Thread1of1ForFork0_push_~stack#1.offset_127|) (< |v_t1Thread1of1ForFork0_~i~0#1_176| 5) (= |v_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1_124| |v_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_112|))) InVars {~#arr~0.offset=|v_~#arr~0.offset_183|, #pthreadsMutex=|v_#pthreadsMutex_558|, ~#m~0.base=|v_~#m~0.base_234|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_176|, ~#m~0.offset=|v_~#m~0.offset_236|, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_269|, ~#arr~0.base=|v_~#arr~0.base_183|, t1Thread1of1ForFork0_#t~nondet40#1=|v_t1Thread1of1ForFork0_#t~nondet40#1_172|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_183|, #pthreadsMutex=|v_#pthreadsMutex_557|, t2Thread1of1ForFork1_#res#1.base=|v_t2Thread1of1ForFork1_#res#1.base_13|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_176|, t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_127|, t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_112|, t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_207|, t2Thread1of1ForFork1_#res#1.offset=|v_t2Thread1of1ForFork1_#res#1.offset_13|, t1Thread1of1ForFork0_push_#in~stack#1.offset=|v_t1Thread1of1ForFork0_push_#in~stack#1.offset_70|, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_269|, t1Thread1of1ForFork0_push_#in~x#1=|v_t1Thread1of1ForFork0_push_#in~x#1_70|, t1Thread1of1ForFork0_push_#in~stack#1.base=|v_t1Thread1of1ForFork0_push_#in~stack#1.base_70|, t1Thread1of1ForFork0_push_#res#1=|v_t1Thread1of1ForFork0_push_#res#1_224|, ~#m~0.base=|v_~#m~0.base_234|, t1Thread1of1ForFork0_~tmp~0#1=|v_t1Thread1of1ForFork0_~tmp~0#1_132|, ~#m~0.offset=|v_~#m~0.offset_236|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_127|, t1Thread1of1ForFork0_push_#t~nondet33#1=|v_t1Thread1of1ForFork0_push_#t~nondet33#1_78|, t1Thread1of1ForFork0_#t~nondet39#1=|v_t1Thread1of1ForFork0_#t~nondet39#1_120|, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_127|, ~#arr~0.base=|v_~#arr~0.base_183|, t1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1_124|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#res#1.base, t1Thread1of1ForFork0_push_~x#1, t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, t1Thread1of1ForFork0_push_#t~ret34#1, t2Thread1of1ForFork1_#res#1.offset, t1Thread1of1ForFork0_push_#in~stack#1.offset, t1Thread1of1ForFork0_push_#in~x#1, t1Thread1of1ForFork0_push_#in~stack#1.base, t1Thread1of1ForFork0_#t~nondet40#1, t1Thread1of1ForFork0_push_#res#1, t1Thread1of1ForFork0_~tmp~0#1, t1Thread1of1ForFork0_push_~stack#1.base, t1Thread1of1ForFork0_push_#t~nondet33#1, t1Thread1of1ForFork0_#t~nondet39#1, t1Thread1of1ForFork0_push_~stack#1.offset, t1Thread1of1ForFork0_assume_abort_if_not_~cond#1] [2022-12-05 22:55:44,532 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:55:44,532 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1544 [2022-12-05 22:55:44,532 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 306 transitions, 5971 flow [2022-12-05 22:55:44,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 23 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:44,533 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:55:44,533 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:55:44,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-05 22:55:44,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-05 22:55:44,738 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:55:44,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:55:44,738 INFO L85 PathProgramCache]: Analyzing trace with hash 2105208518, now seen corresponding path program 1 times [2022-12-05 22:55:44,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:55:44,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451534120] [2022-12-05 22:55:44,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:55:44,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:55:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:55:45,155 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:55:45,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:55:45,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451534120] [2022-12-05 22:55:45,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451534120] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:55:45,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397500004] [2022-12-05 22:55:45,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:55:45,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:55:45,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:55:45,157 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:55:45,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-05 22:55:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:55:45,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-05 22:55:45,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:55:45,415 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 22 treesize of output 17 [2022-12-05 22:55:45,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:55:45,514 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 60 treesize of output 40 [2022-12-05 22:55:45,583 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-05 22:55:45,791 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:55:45,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:55:45,923 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 38 treesize of output 30 [2022-12-05 22:55:45,967 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 22:55:45,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397500004] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:55:45,968 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:55:45,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 22 [2022-12-05 22:55:45,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082801141] [2022-12-05 22:55:45,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:55:45,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-05 22:55:45,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:55:45,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-05 22:55:45,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-12-05 22:55:45,969 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 65 [2022-12-05 22:55:45,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 306 transitions, 5971 flow. Second operand has 23 states, 23 states have (on average 5.608695652173913) internal successors, (129), 23 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:45,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:55:45,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 65 [2022-12-05 22:55:45,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:55:54,408 INFO L130 PetriNetUnfolder]: 5518/11214 cut-off events. [2022-12-05 22:55:54,408 INFO L131 PetriNetUnfolder]: For 98444/98444 co-relation queries the response was YES. [2022-12-05 22:55:54,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54476 conditions, 11214 events. 5518/11214 cut-off events. For 98444/98444 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 90527 event pairs, 1279 based on Foata normal form. 0/11154 useless extension candidates. Maximal degree in co-relation 47375. Up to 4121 conditions per place. [2022-12-05 22:55:54,471 INFO L137 encePairwiseOnDemand]: 27/65 looper letters, 316 selfloop transitions, 260 changer transitions 40/619 dead transitions. [2022-12-05 22:55:54,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 619 transitions, 10341 flow [2022-12-05 22:55:54,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-05 22:55:54,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-05 22:55:54,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 416 transitions. [2022-12-05 22:55:54,472 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2206896551724138 [2022-12-05 22:55:54,473 INFO L175 Difference]: Start difference. First operand has 166 places, 306 transitions, 5971 flow. Second operand 29 states and 416 transitions. [2022-12-05 22:55:54,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 619 transitions, 10341 flow [2022-12-05 22:55:54,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 619 transitions, 10130 flow, removed 95 selfloop flow, removed 5 redundant places. [2022-12-05 22:55:54,640 INFO L231 Difference]: Finished difference. Result has 198 places, 375 transitions, 8005 flow [2022-12-05 22:55:54,640 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=5825, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=193, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=8005, PETRI_PLACES=198, PETRI_TRANSITIONS=375} [2022-12-05 22:55:54,640 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 156 predicate places. [2022-12-05 22:55:54,640 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:55:54,640 INFO L89 Accepts]: Start accepts. Operand has 198 places, 375 transitions, 8005 flow [2022-12-05 22:55:54,642 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:55:54,642 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:55:54,642 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 375 transitions, 8005 flow [2022-12-05 22:55:54,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 375 transitions, 8005 flow [2022-12-05 22:55:55,012 INFO L130 PetriNetUnfolder]: 1219/3612 cut-off events. [2022-12-05 22:55:55,013 INFO L131 PetriNetUnfolder]: For 37801/38043 co-relation queries the response was YES. [2022-12-05 22:55:55,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18239 conditions, 3612 events. 1219/3612 cut-off events. For 37801/38043 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 32659 event pairs, 435 based on Foata normal form. 6/3117 useless extension candidates. Maximal degree in co-relation 15716. Up to 1476 conditions per place. [2022-12-05 22:55:55,067 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 375 transitions, 8005 flow [2022-12-05 22:55:55,067 INFO L188 LiptonReduction]: Number of co-enabled transitions 2234 [2022-12-05 22:55:55,271 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L1022-4-->L1023-3: Formula: (and (= (store |v_#memory_int_123| |v_ULTIMATE.start_main_~#id2~0#1.base_17| (store (select |v_#memory_int_123| |v_ULTIMATE.start_main_~#id2~0#1.base_17|) |v_ULTIMATE.start_main_~#id2~0#1.offset_17| |v_ULTIMATE.start_main_#t~pre47#1_15|)) |v_#memory_int_122|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|) (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre47#1_15|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_17|, #pthreadsForks=|v_#pthreadsForks_30|, #memory_int=|v_#memory_int_123|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_17|} OutVars{ULTIMATE.start_main_#t~nondet46#1=|v_ULTIMATE.start_main_#t~nondet46#1_7|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_17|, #pthreadsForks=|v_#pthreadsForks_29|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_15|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_17|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre47#1, ULTIMATE.start_main_#t~pre45#1] and [565] L946-1-->push_returnLabel#1: Formula: (and (= (+ 1 |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_42|) v_~top~0_85) (= |v_t1Thread1of1ForFork0_push_#res#1_35| 0)) InVars {t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_42|} OutVars{t1Thread1of1ForFork0_push_#res#1=|v_t1Thread1of1ForFork0_push_#res#1_35|, ~top~0=v_~top~0_85} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#res#1, ~top~0, t1Thread1of1ForFork0_inc_top_#t~post31#1] [2022-12-05 22:55:55,298 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [620] L962-->L969-3: Formula: (and (= |v_t1Thread1of1ForFork0_get_top_#res#1_62| |v_t1Thread1of1ForFork0_push_#t~ret34#1_102|) (<= 0 (+ |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 2147483648)) (= |v_t1Thread1of1ForFork0_get_top_#res#1_62| v_~top~0_376) (= (store |v_#memory_int_158| |v_t1Thread1of1ForFork0_push_~stack#1.base_66| (store (select |v_#memory_int_158| |v_t1Thread1of1ForFork0_push_~stack#1.base_66|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_66| (* |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 4)) |v_t1Thread1of1ForFork0_push_~x#1_66|)) |v_#memory_int_157|) (not (= 5 v_~top~0_376)) (<= |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 2147483647)) InVars {t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_66|, #memory_int=|v_#memory_int_158|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_66|, ~top~0=v_~top~0_376, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_66|} OutVars{t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_66|, t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_102|, #memory_int=|v_#memory_int_157|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_66|, t1Thread1of1ForFork0_get_top_#res#1=|v_t1Thread1of1ForFork0_get_top_#res#1_62|, ~top~0=v_~top~0_376, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_66|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~ret34#1, #memory_int, t1Thread1of1ForFork0_get_top_#res#1] and [587] L1022-4-->L1023-3: Formula: (and (= (store |v_#memory_int_123| |v_ULTIMATE.start_main_~#id2~0#1.base_17| (store (select |v_#memory_int_123| |v_ULTIMATE.start_main_~#id2~0#1.base_17|) |v_ULTIMATE.start_main_~#id2~0#1.offset_17| |v_ULTIMATE.start_main_#t~pre47#1_15|)) |v_#memory_int_122|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|) (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre47#1_15|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_17|, #pthreadsForks=|v_#pthreadsForks_30|, #memory_int=|v_#memory_int_123|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_17|} OutVars{ULTIMATE.start_main_#t~nondet46#1=|v_ULTIMATE.start_main_#t~nondet46#1_7|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_17|, #pthreadsForks=|v_#pthreadsForks_29|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_15|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_17|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_19|} 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-05 22:55:56,408 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [596] L992-6-->L962: Formula: (let ((.cse1 (mod |v_t1Thread1of1ForFork0_~tmp~0#1_Out_8| 4294967296)) (.cse0 (select |v_#pthreadsMutex_In_13| |v_~#m~0.base_In_16|))) (and (not (= |v_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= |v_t1Thread1of1ForFork0_push_#in~stack#1.offset_Out_4| |v_t1Thread1of1ForFork0_push_~stack#1.offset_Out_10|) (= |v_t1Thread1of1ForFork0_#t~nondet40#1_In_3| |v_t1Thread1of1ForFork0_~tmp~0#1_Out_8|) (= |v_t1Thread1of1ForFork0_push_~stack#1.base_Out_10| |v_t1Thread1of1ForFork0_push_#in~stack#1.base_Out_4|) (< |v_t1Thread1of1ForFork0_~i~0#1_In_6| 5) (= |v_t1Thread1of1ForFork0_push_#in~stack#1.offset_Out_4| |v_~#arr~0.offset_In_9|) (= |v_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_t1Thread1of1ForFork0_push_~x#1_Out_12| |v_t1Thread1of1ForFork0_push_#in~x#1_Out_4|) (= (select .cse0 |v_~#m~0.offset_In_16|) 0) (= (ite (< .cse1 5) 1 0) |v_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_~#arr~0.base_In_9| |v_t1Thread1of1ForFork0_push_#in~stack#1.base_Out_4|) (= (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) |v_t1Thread1of1ForFork0_push_#in~x#1_Out_4|) (= |v_#pthreadsMutex_Out_28| (store |v_#pthreadsMutex_In_13| |v_~#m~0.base_In_16| (store .cse0 |v_~#m~0.offset_In_16| 1))))) InVars {~#arr~0.offset=|v_~#arr~0.offset_In_9|, #pthreadsMutex=|v_#pthreadsMutex_In_13|, ~#m~0.base=|v_~#m~0.base_In_16|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_In_6|, ~#m~0.offset=|v_~#m~0.offset_In_16|, ~#arr~0.base=|v_~#arr~0.base_In_9|, t1Thread1of1ForFork0_#t~nondet40#1=|v_t1Thread1of1ForFork0_#t~nondet40#1_In_3|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_In_9|, #pthreadsMutex=|v_#pthreadsMutex_Out_28|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_In_6|, t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_Out_12|, t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_Out_8|, t1Thread1of1ForFork0_push_#in~stack#1.offset=|v_t1Thread1of1ForFork0_push_#in~stack#1.offset_Out_4|, t1Thread1of1ForFork0_push_#in~x#1=|v_t1Thread1of1ForFork0_push_#in~x#1_Out_4|, t1Thread1of1ForFork0_push_#in~stack#1.base=|v_t1Thread1of1ForFork0_push_#in~stack#1.base_Out_4|, t1Thread1of1ForFork0_push_#res#1=|v_t1Thread1of1ForFork0_push_#res#1_Out_14|, ~#m~0.base=|v_~#m~0.base_In_16|, t1Thread1of1ForFork0_~tmp~0#1=|v_t1Thread1of1ForFork0_~tmp~0#1_Out_8|, ~#m~0.offset=|v_~#m~0.offset_In_16|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_Out_10|, t1Thread1of1ForFork0_push_#t~nondet33#1=|v_t1Thread1of1ForFork0_push_#t~nondet33#1_Out_10|, t1Thread1of1ForFork0_#t~nondet39#1=|v_t1Thread1of1ForFork0_#t~nondet39#1_Out_6|, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_Out_10|, ~#arr~0.base=|v_~#arr~0.base_In_9|, t1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork0_push_~x#1, t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, t1Thread1of1ForFork0_push_#t~ret34#1, t1Thread1of1ForFork0_push_#in~stack#1.offset, t1Thread1of1ForFork0_push_#in~x#1, t1Thread1of1ForFork0_push_#in~stack#1.base, t1Thread1of1ForFork0_#t~nondet40#1, t1Thread1of1ForFork0_push_#res#1, t1Thread1of1ForFork0_~tmp~0#1, t1Thread1of1ForFork0_push_~stack#1.base, t1Thread1of1ForFork0_push_#t~nondet33#1, t1Thread1of1ForFork0_#t~nondet39#1, t1Thread1of1ForFork0_push_~stack#1.offset, t1Thread1of1ForFork0_assume_abort_if_not_~cond#1] and [587] L1022-4-->L1023-3: Formula: (and (= (store |v_#memory_int_123| |v_ULTIMATE.start_main_~#id2~0#1.base_17| (store (select |v_#memory_int_123| |v_ULTIMATE.start_main_~#id2~0#1.base_17|) |v_ULTIMATE.start_main_~#id2~0#1.offset_17| |v_ULTIMATE.start_main_#t~pre47#1_15|)) |v_#memory_int_122|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|) (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre47#1_15|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_17|, #pthreadsForks=|v_#pthreadsForks_30|, #memory_int=|v_#memory_int_123|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_17|} OutVars{ULTIMATE.start_main_#t~nondet46#1=|v_ULTIMATE.start_main_#t~nondet46#1_7|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_17|, #pthreadsForks=|v_#pthreadsForks_29|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_15|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_17|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_19|} 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-05 22:55:56,746 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [532] L969-3-->L946-1: Formula: (= v_~top~0_43 |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_27|) InVars {~top~0=v_~top~0_43} OutVars{t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_23|, ~top~0=v_~top~0_43, t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_27|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~ret34#1, t1Thread1of1ForFork0_inc_top_#t~post31#1] and [690] L1022-4-->push_returnLabel#1: Formula: (and (= (store |v_#memory_int_368| |v_ULTIMATE.start_main_~#id2~0#1.base_35| (store (select |v_#memory_int_368| |v_ULTIMATE.start_main_~#id2~0#1.base_35|) |v_ULTIMATE.start_main_~#id2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre47#1_50|)) |v_#memory_int_367|) (= |v_#pthreadsForks_54| |v_ULTIMATE.start_main_#t~pre47#1_50|) (= (+ |v_#pthreadsForks_54| 1) |v_#pthreadsForks_53|) (= (+ |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_308| 1) v_~top~0_673) (= |v_t1Thread1of1ForFork0_push_#res#1_255| 0)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_31|, #pthreadsForks=|v_#pthreadsForks_54|, #memory_int=|v_#memory_int_368|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_35|, t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_308|} OutVars{ULTIMATE.start_main_#t~nondet46#1=|v_ULTIMATE.start_main_#t~nondet46#1_23|, t1Thread1of1ForFork0_push_#res#1=|v_t1Thread1of1ForFork0_push_#res#1_255|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_31|, #pthreadsForks=|v_#pthreadsForks_53|, #memory_int=|v_#memory_int_367|, ~top~0=v_~top~0_673, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_50|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_35|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46#1, t1Thread1of1ForFork0_push_#res#1, #pthreadsForks, #memory_int, ~top~0, ULTIMATE.start_main_#t~pre47#1, t1Thread1of1ForFork0_inc_top_#t~post31#1, ULTIMATE.start_main_#t~pre45#1] [2022-12-05 22:55:56,816 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-05 22:55:56,817 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2177 [2022-12-05 22:55:56,817 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 370 transitions, 8112 flow [2022-12-05 22:55:56,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.608695652173913) internal successors, (129), 23 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:56,817 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:55:56,817 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:55:56,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-05 22:55:57,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-05 22:55:57,023 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:55:57,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:55:57,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1355735086, now seen corresponding path program 1 times [2022-12-05 22:55:57,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:55:57,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862541526] [2022-12-05 22:55:57,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:55:57,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:55:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:55:57,936 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:55:57,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:55:57,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862541526] [2022-12-05 22:55:57,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862541526] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:55:57,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959875948] [2022-12-05 22:55:57,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:55:57,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:55:57,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:55:57,938 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:55:57,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-05 22:55:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:55:58,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 82 conjunts are in the unsatisfiable core [2022-12-05 22:55:58,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:55:58,071 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-05 22:55:58,072 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-05 22:55:58,154 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-05 22:55:58,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:55:58,285 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 60 treesize of output 40 [2022-12-05 22:55:58,338 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 51 treesize of output 46 [2022-12-05 22:55:58,460 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-05 22:55:58,517 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:55:58,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:55:58,797 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 22:55:58,807 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 22:55:58,808 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-05 22:55:58,811 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-05 22:55:58,818 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-05 22:56:00,872 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 22:56:00,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959875948] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:56:00,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:56:00,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 24 [2022-12-05 22:56:00,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936635925] [2022-12-05 22:56:00,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:56:00,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-05 22:56:00,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:56:00,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-05 22:56:00,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=546, Unknown=8, NotChecked=0, Total=650 [2022-12-05 22:56:00,874 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 80 [2022-12-05 22:56:00,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 370 transitions, 8112 flow. Second operand has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 26 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:56:00,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:56:00,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 80 [2022-12-05 22:56:00,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:56:05,760 INFO L130 PetriNetUnfolder]: 6761/13748 cut-off events. [2022-12-05 22:56:05,760 INFO L131 PetriNetUnfolder]: For 154329/154329 co-relation queries the response was YES. [2022-12-05 22:56:05,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70059 conditions, 13748 events. 6761/13748 cut-off events. For 154329/154329 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 114127 event pairs, 1923 based on Foata normal form. 0/13688 useless extension candidates. Maximal degree in co-relation 62691. Up to 5400 conditions per place. [2022-12-05 22:56:05,877 INFO L137 encePairwiseOnDemand]: 34/80 looper letters, 416 selfloop transitions, 194 changer transitions 24/637 dead transitions. [2022-12-05 22:56:05,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 637 transitions, 12998 flow [2022-12-05 22:56:05,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-05 22:56:05,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-05 22:56:05,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 340 transitions. [2022-12-05 22:56:05,880 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2236842105263158 [2022-12-05 22:56:05,880 INFO L175 Difference]: Start difference. First operand has 193 places, 370 transitions, 8112 flow. Second operand 19 states and 340 transitions. [2022-12-05 22:56:05,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 637 transitions, 12998 flow [2022-12-05 22:56:06,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 637 transitions, 12625 flow, removed 179 selfloop flow, removed 5 redundant places. [2022-12-05 22:56:06,216 INFO L231 Difference]: Finished difference. Result has 215 places, 447 transitions, 10435 flow [2022-12-05 22:56:06,216 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=7834, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=10435, PETRI_PLACES=215, PETRI_TRANSITIONS=447} [2022-12-05 22:56:06,217 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 173 predicate places. [2022-12-05 22:56:06,217 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:56:06,217 INFO L89 Accepts]: Start accepts. Operand has 215 places, 447 transitions, 10435 flow [2022-12-05 22:56:06,219 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:56:06,219 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:56:06,219 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 215 places, 447 transitions, 10435 flow [2022-12-05 22:56:06,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 215 places, 447 transitions, 10435 flow [2022-12-05 22:56:06,668 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([620] L962-->L969-3: Formula: (and (= |v_t1Thread1of1ForFork0_get_top_#res#1_62| |v_t1Thread1of1ForFork0_push_#t~ret34#1_102|) (<= 0 (+ |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 2147483648)) (= |v_t1Thread1of1ForFork0_get_top_#res#1_62| v_~top~0_376) (= (store |v_#memory_int_158| |v_t1Thread1of1ForFork0_push_~stack#1.base_66| (store (select |v_#memory_int_158| |v_t1Thread1of1ForFork0_push_~stack#1.base_66|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_66| (* |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 4)) |v_t1Thread1of1ForFork0_push_~x#1_66|)) |v_#memory_int_157|) (not (= 5 v_~top~0_376)) (<= |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 2147483647)) InVars {t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_66|, #memory_int=|v_#memory_int_158|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_66|, ~top~0=v_~top~0_376, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_66|} OutVars{t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_66|, t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_102|, #memory_int=|v_#memory_int_157|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_66|, t1Thread1of1ForFork0_get_top_#res#1=|v_t1Thread1of1ForFork0_get_top_#res#1_62|, ~top~0=v_~top~0_376, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_66|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~ret34#1, #memory_int, t1Thread1of1ForFork0_get_top_#res#1][80], [Black: 986#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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|)), Black: 1605#(and (<= (* ~top~0 4) (+ |~#m~0.offset| 4)) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (= ~top~0 1) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (<= (+ |~#m~0.offset| 4) (* ~top~0 4)) (= 3 |~#arr~0.base|)), Black: 1036#(<= ~top~0 1), Black: 1595#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (<= 0 |~#m~0.offset|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |~#m~0.offset| 0) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (= 3 |~#arr~0.base|)), Black: 1641#(and (<= (* ~top~0 4) (+ |~#m~0.offset| 4)) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (= ~top~0 1) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (<= (+ |~#m~0.offset| 4) (* ~top~0 4)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 4)) 4)), Black: 1644#(and (<= (* ~top~0 4) (+ |~#m~0.offset| 4)) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (= ~top~0 1) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (<= (+ |~#m~0.offset| 4) (* ~top~0 4)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 4)) 4)), Black: 1632#(and (<= (+ |~#m~0.offset| 12) (* ~top~0 4)) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (<= (* ~top~0 4) (+ |~#m~0.offset| 12)) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 4))) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 4)) 4) (= ~top~0 3)), Black: 866#(and (= ~top~0 0) (= |~#arr~0.offset| 0) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< (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|)), Black: 1597#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (<= 0 |~#m~0.offset|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |~#m~0.offset| 0) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (= 3 |~#arr~0.base|)), Black: 1608#(and (<= (* ~top~0 4) (+ |~#m~0.offset| 4)) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (= ~top~0 1) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (<= (+ |~#m~0.offset| 4) (* ~top~0 4)) (= 3 |~#arr~0.base|)), Black: 1555#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296)))), 1782#(not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)), Black: 1228#(not (<= 5 ~top~0)), Black: 174#(<= ~top~0 1), Black: 1162#(<= ~top~0 3), Black: 219#(not (<= 5 ~top~0)), Black: 1159#(<= ~top~0 1), Black: 1160#(<= ~top~0 2), Black: 178#(<= ~top~0 0), 1032#true, Black: 1157#(= ~top~0 0), t2Thread1of1ForFork1InUse, Black: 1809#(forall ((|v_t1Thread1of1ForFork0_get_top_#res#1_155| Int) (v_ArrVal_702 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_171| Int) (v_ArrVal_700 Int)) (or (not (= 4294967294 (mod (select (select (store (store |#memory_int| |~#arr~0.base| (store (select |#memory_int| |~#arr~0.base|) (+ (* |v_t1Thread1of1ForFork0_get_top_#res#1_155| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_171|) v_ArrVal_700)) |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296))) (not (<= (+ ~top~0 1) |v_t1Thread1of1ForFork0_get_top_#res#1_155|)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_171| |~#arr~0.offset|))), Black: 1703#(and (= |~#arr~0.offset| 0) (= ~top~0 1) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|)), Black: 1678#(and (<= (* ~top~0 4) (+ |~#m~0.offset| 4)) (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< |~#arr~0.offset| (+ |~#m~0.offset| 1)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 4))) (<= (+ |~#m~0.offset| 4) (* ~top~0 4)) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 4)) 4) (<= |~#m~0.offset| |~#arr~0.offset|)), Black: 1806#(and (= |~#arr~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_get_top_#res#1_155| Int) (v_ArrVal_702 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_171| Int) (v_ArrVal_700 Int)) (or (not (= 4294967294 (mod (select (select (store (store |#memory_int| |~#arr~0.base| (store (select |#memory_int| |~#arr~0.base|) (+ (* |v_t1Thread1of1ForFork0_get_top_#res#1_155| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_171|) v_ArrVal_700)) |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296))) (not (<= ~top~0 |v_t1Thread1of1ForFork0_get_top_#res#1_155|)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_171| |~#arr~0.offset|))) (< |~#arr~0.offset| (+ |~#m~0.offset| 1)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 4))) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 4)) 4) (<= |~#m~0.offset| |~#arr~0.offset|) (= ~top~0 3)), Black: 1714#(and (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 4294967296) (= |~#arr~0.offset| 0) (= ~top~0 2) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4))) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (<= (+ 4294967292 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)))) 4294967296) 4294967296)) 0) (= 3 |~#arr~0.base|)), Black: 1687#(and (= ~top~0 0) (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|)), Black: 1816#(and (<= (* ~top~0 4) (+ |~#m~0.offset| 4)) (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (exists ((aux_mod_v_arrayElimCell_38_49 Int) (aux_div_v_arrayElimCell_38_49 Int)) (and (<= 4294967291 aux_mod_v_arrayElimCell_38_49) (<= (+ (* aux_div_v_arrayElimCell_38_49 4294967296) aux_mod_v_arrayElimCell_38_49 1) 0) (< aux_mod_v_arrayElimCell_38_49 4294967296) (= (mod (+ 4294967295 (* 4294967295 aux_mod_v_arrayElimCell_38_49)) 4294967296) |t2Thread1of1ForFork1_#t~ret44#1|) (< 0 (+ (* aux_div_v_arrayElimCell_38_49 4294967296) aux_mod_v_arrayElimCell_38_49 4294967297)))) (< |~#arr~0.offset| (+ |~#m~0.offset| 1)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 4))) (<= (+ |~#m~0.offset| 4) (* ~top~0 4)) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 4)) 4) (<= |~#m~0.offset| |~#arr~0.offset|)), Black: 278#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647) (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0)), Black: 1811#(and (= ~top~0 0) (forall ((|v_t1Thread1of1ForFork0_get_top_#res#1_155| Int) (v_ArrVal_702 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_171| Int) (v_ArrVal_700 Int)) (or (not (= 4294967294 (mod (select (select (store (store |#memory_int| |~#arr~0.base| (store (select |#memory_int| |~#arr~0.base|) (+ (* |v_t1Thread1of1ForFork0_get_top_#res#1_155| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_171|) v_ArrVal_700)) |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296))) (not (<= (+ ~top~0 1) |v_t1Thread1of1ForFork0_get_top_#res#1_155|)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_171| |~#arr~0.offset|))) (= |~#arr~0.offset| 0) (= 3 |~#arr~0.base|)), Black: 1679#(and (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< |~#arr~0.offset| (+ |~#m~0.offset| 1)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 4))) (= 3 |~#arr~0.base|) (<= (+ |~#m~0.offset| 8) (* ~top~0 4)) (<= (* ~top~0 4) (+ |~#m~0.offset| 8)) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 4)) 4) (<= |~#m~0.offset| |~#arr~0.offset|)), 1639#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296)))), Black: 164#(= ~top~0 0), Black: 279#(and (= ~top~0 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 2147483647) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 1439#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (= ~top~0 2) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (= 3 |~#arr~0.base|) (<= (+ |~#m~0.offset| 8) (* ~top~0 4)) (<= (* ~top~0 4) (+ |~#m~0.offset| 8))), Black: 1433#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (<= 0 |~#m~0.offset|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |~#m~0.offset| 0) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (= 3 |~#arr~0.base|)), Black: 1435#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_inc_top_#t~post31#1| 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (<= 0 |~#m~0.offset|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |~#m~0.offset| 0) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (= 3 |~#arr~0.base|)), Black: 168#(= |t1Thread1of1ForFork0_push_#res#1| 0), Black: 1437#(and (<= (* ~top~0 4) (+ |~#m~0.offset| 4)) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (= ~top~0 1) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (<= (+ |~#m~0.offset| 4) (* ~top~0 4)) (= 3 |~#arr~0.base|)), Black: 1441#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= ~top~0 2) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |t1Thread1of1ForFork0_push_~x#1| 4) (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= 3 |~#arr~0.base|) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |ULTIMATE.start_main_~#id2~0#1.base|)) (<= (+ |~#m~0.offset| 8) (* ~top~0 4)) (<= (* ~top~0 4) (+ |~#m~0.offset| 8))), 836#true, Black: 302#(and (<= 1 ~top~0) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (<= ~top~0 1) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 300#(and (= ~top~0 0) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 795#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (= 3 |~#arr~0.base|)), Black: 668#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (= 3 |~#arr~0.base|)), 170#true, 275#true, Black: 319#(and (= ~top~0 0) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 321#(and (<= 1 ~top~0) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (<= ~top~0 1) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), 49#L1024-1true, 22#L969-3true, 614#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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)))) (forall ((v_ArrVal_255 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_255) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294))) (= 3 |~#arr~0.base|)), 1155#true, 790#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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|)), 1394#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|))), 458#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296)))), Black: 592#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= |~#arr~0.offset| |~#m~0.offset|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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|) (= |~#m~0.offset| 0)), Black: 979#(and (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (forall ((v_ArrVal_373 Int) (|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (< (+ ~top~0 1) |v_t2Thread1of1ForFork1_get_top_#res#1_117|) (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (not (= 4294967294 (mod (select (select (store (store |#memory_int| |~#arr~0.base| (store (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) 4) v_ArrVal_373)) |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296))))) (<= ~top~0 1) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0)) (= 3 |~#arr~0.base|)), Black: 616#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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|)), Black: 622#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (<= (+ 8589934588 (* (div (+ (- 4294967297) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))))) 4294967296) 4294967296) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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) (- 4)))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (forall ((v_ArrVal_255 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_255) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294))) (= 3 |~#arr~0.base|)), 13#L1006-6true, Black: 1034#(= ~top~0 0), Black: 1037#(<= ~top~0 2), Black: 993#(forall ((|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296) 4294967294)) (< ~top~0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|))), Black: 1038#(<= ~top~0 3)]) [2022-12-05 22:56:06,668 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-05 22:56:06,668 INFO L385 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-05 22:56:06,668 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-05 22:56:06,668 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-05 22:56:06,809 INFO L130 PetriNetUnfolder]: 1484/4536 cut-off events. [2022-12-05 22:56:06,809 INFO L131 PetriNetUnfolder]: For 55196/55485 co-relation queries the response was YES. [2022-12-05 22:56:06,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23961 conditions, 4536 events. 1484/4536 cut-off events. For 55196/55485 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 43488 event pairs, 534 based on Foata normal form. 2/3889 useless extension candidates. Maximal degree in co-relation 22843. Up to 1761 conditions per place. [2022-12-05 22:56:06,878 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 215 places, 447 transitions, 10435 flow [2022-12-05 22:56:06,879 INFO L188 LiptonReduction]: Number of co-enabled transitions 2630 [2022-12-05 22:56:08,806 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 22:56:08,807 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2590 [2022-12-05 22:56:08,807 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 446 transitions, 10485 flow [2022-12-05 22:56:08,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 26 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:56:08,807 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:56:08,807 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:56:08,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-05 22:56:09,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-05 22:56:09,010 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:56:09,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:56:09,010 INFO L85 PathProgramCache]: Analyzing trace with hash 2128389202, now seen corresponding path program 1 times [2022-12-05 22:56:09,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:56:09,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247993850] [2022-12-05 22:56:09,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:56:09,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:56:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:56:09,554 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:56:09,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:56:09,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247993850] [2022-12-05 22:56:09,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247993850] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:56:09,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872365724] [2022-12-05 22:56:09,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:56:09,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:56:09,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:56:09,556 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:56:09,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-05 22:56:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:56:09,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 82 conjunts are in the unsatisfiable core [2022-12-05 22:56:09,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:56:09,776 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 22 treesize of output 17 [2022-12-05 22:56:09,859 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 72 treesize of output 43 [2022-12-05 22:56:09,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:56:09,938 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 72 treesize of output 43 [2022-12-05 22:56:10,022 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-05 22:56:11,385 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:56:11,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:56:11,515 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 38 treesize of output 30 [2022-12-05 22:56:11,542 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:56:11,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872365724] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:56:11,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:56:11,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 23 [2022-12-05 22:56:11,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449628915] [2022-12-05 22:56:11,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:56:11,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-05 22:56:11,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:56:11,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-05 22:56:11,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2022-12-05 22:56:11,543 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 89 [2022-12-05 22:56:11,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 446 transitions, 10485 flow. Second operand has 24 states, 24 states have (on average 5.375) internal successors, (129), 24 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:56:11,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:56:11,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 89 [2022-12-05 22:56:11,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:56:13,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-05 22:56:15,999 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-05 22:56:18,401 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-05 22:56:20,426 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-05 22:56:22,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] [2022-12-05 22:56:24,762 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-05 22:56:26,817 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-05 22:56:28,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-05 22:56:30,886 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-05 22:56:32,908 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-05 22:56:34,932 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-05 22:56:37,043 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-05 22:56:39,060 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-05 22:56:41,091 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-05 22:56:43,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-05 22:56:45,264 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-05 22:56:47,302 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-05 22:56:49,316 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-05 22:56:51,384 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-05 22:56:54,679 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-05 22:56:57,502 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-05 22:56:59,785 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-05 22:57:02,552 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-05 22:57:04,615 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-05 22:57:07,366 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-05 22:57:08,595 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] [2022-12-05 22:57:10,621 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-05 22:57:12,647 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-05 22:57:14,685 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-05 22:57:16,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-05 22:57:18,886 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-05 22:57:22,296 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-05 22:57:26,151 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-05 22:57:28,210 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-05 22:57:30,238 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-05 22:57:32,512 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-05 22:57:33,660 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] [2022-12-05 22:57:35,683 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-05 22:57:37,913 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-05 22:57:39,934 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-05 22:57:43,341 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-05 22:57:45,420 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-05 22:57:47,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-05 22:57:49,780 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-05 22:57:51,818 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-05 22:57:54,229 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] [2022-12-05 22:57:56,255 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-05 22:57:58,290 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-05 22:58:01,245 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-05 22:58:03,279 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-05 22:58:05,315 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-05 22:58:07,837 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-05 22:58:09,863 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-05 22:58:11,925 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-05 22:58:14,743 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-05 22:58:16,776 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-05 22:58:18,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-05 22:58:20,976 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-05 22:58:22,992 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-05 22:58:25,630 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-05 22:58:27,665 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-05 22:58:29,688 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-05 22:58:32,505 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-05 22:58:34,556 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-05 22:58:36,989 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-05 22:58:39,035 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-05 22:58:41,149 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-05 22:58:43,196 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-05 22:58:45,227 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-05 22:58:47,268 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-05 22:58:49,383 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-05 22:58:51,412 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-05 22:58:53,635 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-05 22:58:55,981 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-05 22:58:58,229 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-05 22:58:59,556 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-05 22:59:01,586 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-05 22:59:03,621 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-05 22:59:05,671 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-05 22:59:07,230 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] [2022-12-05 22:59:09,387 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-05 22:59:11,438 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-05 22:59:12,533 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] [2022-12-05 22:59:14,598 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-05 22:59:16,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-05 22:59:18,870 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-05 22:59:20,904 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-05 22:59:23,023 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-05 22:59:25,354 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-05 22:59:27,388 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-05 22:59:30,784 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-05 22:59:32,823 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-05 22:59:35,401 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-05 22:59:37,559 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-05 22:59:39,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 [0] [2022-12-05 22:59:41,839 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-05 22:59:44,249 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-05 22:59:47,559 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-05 22:59:49,586 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-05 22:59:51,739 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-05 22:59:54,009 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-05 22:59:56,927 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-05 22:59:58,191 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-05 22:59:58,491 INFO L130 PetriNetUnfolder]: 8356/17071 cut-off events. [2022-12-05 22:59:58,491 INFO L131 PetriNetUnfolder]: For 204044/204044 co-relation queries the response was YES. [2022-12-05 22:59:58,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88434 conditions, 17071 events. 8356/17071 cut-off events. For 204044/204044 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 142485 event pairs, 2204 based on Foata normal form. 0/17023 useless extension candidates. Maximal degree in co-relation 84110. Up to 6199 conditions per place. [2022-12-05 22:59:58,609 INFO L137 encePairwiseOnDemand]: 33/89 looper letters, 362 selfloop transitions, 389 changer transitions 49/803 dead transitions. [2022-12-05 22:59:58,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 803 transitions, 16913 flow [2022-12-05 22:59:58,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-05 22:59:58,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-05 22:59:58,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 410 transitions. [2022-12-05 22:59:58,610 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20029311187103077 [2022-12-05 22:59:58,610 INFO L175 Difference]: Start difference. First operand has 214 places, 446 transitions, 10485 flow. Second operand 23 states and 410 transitions. [2022-12-05 22:59:58,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 803 transitions, 16913 flow [2022-12-05 22:59:59,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 803 transitions, 16657 flow, removed 56 selfloop flow, removed 7 redundant places. [2022-12-05 22:59:59,048 INFO L231 Difference]: Finished difference. Result has 233 places, 539 transitions, 13552 flow [2022-12-05 22:59:59,048 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=10272, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=297, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=13552, PETRI_PLACES=233, PETRI_TRANSITIONS=539} [2022-12-05 22:59:59,049 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 191 predicate places. [2022-12-05 22:59:59,049 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:59:59,049 INFO L89 Accepts]: Start accepts. Operand has 233 places, 539 transitions, 13552 flow [2022-12-05 22:59:59,050 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:59:59,050 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:59:59,051 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 233 places, 539 transitions, 13552 flow [2022-12-05 22:59:59,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 539 transitions, 13552 flow [2022-12-05 22:59:59,456 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([620] L962-->L969-3: Formula: (and (= |v_t1Thread1of1ForFork0_get_top_#res#1_62| |v_t1Thread1of1ForFork0_push_#t~ret34#1_102|) (<= 0 (+ |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 2147483648)) (= |v_t1Thread1of1ForFork0_get_top_#res#1_62| v_~top~0_376) (= (store |v_#memory_int_158| |v_t1Thread1of1ForFork0_push_~stack#1.base_66| (store (select |v_#memory_int_158| |v_t1Thread1of1ForFork0_push_~stack#1.base_66|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_66| (* |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 4)) |v_t1Thread1of1ForFork0_push_~x#1_66|)) |v_#memory_int_157|) (not (= 5 v_~top~0_376)) (<= |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 2147483647)) InVars {t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_66|, #memory_int=|v_#memory_int_158|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_66|, ~top~0=v_~top~0_376, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_66|} OutVars{t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_66|, t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_102|, #memory_int=|v_#memory_int_157|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_66|, t1Thread1of1ForFork0_get_top_#res#1=|v_t1Thread1of1ForFork0_get_top_#res#1_62|, ~top~0=v_~top~0_376, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_66|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~ret34#1, #memory_int, t1Thread1of1ForFork0_get_top_#res#1][111], [Black: 986#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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|)), Black: 1605#(and (<= (* ~top~0 4) (+ |~#m~0.offset| 4)) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (= ~top~0 1) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (<= (+ |~#m~0.offset| 4) (* ~top~0 4)) (= 3 |~#arr~0.base|)), Black: 1036#(<= ~top~0 1), Black: 1595#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (<= 0 |~#m~0.offset|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |~#m~0.offset| 0) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (= 3 |~#arr~0.base|)), Black: 1641#(and (<= (* ~top~0 4) (+ |~#m~0.offset| 4)) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (= ~top~0 1) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (<= (+ |~#m~0.offset| 4) (* ~top~0 4)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 4)) 4)), Black: 1644#(and (<= (* ~top~0 4) (+ |~#m~0.offset| 4)) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (= ~top~0 1) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (<= (+ |~#m~0.offset| 4) (* ~top~0 4)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 4)) 4)), Black: 866#(and (= ~top~0 0) (= |~#arr~0.offset| 0) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< (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|)), Black: 1632#(and (<= (+ |~#m~0.offset| 12) (* ~top~0 4)) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (<= (* ~top~0 4) (+ |~#m~0.offset| 12)) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 4))) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 4)) 4) (= ~top~0 3)), Black: 1608#(and (<= (* ~top~0 4) (+ |~#m~0.offset| 4)) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (= ~top~0 1) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (<= (+ |~#m~0.offset| 4) (* ~top~0 4)) (= 3 |~#arr~0.base|)), 1782#(not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)), 1968#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296)))), Black: 1228#(not (<= 5 ~top~0)), Black: 1162#(<= ~top~0 3), Black: 174#(<= ~top~0 1), Black: 219#(not (<= 5 ~top~0)), Black: 1159#(<= ~top~0 1), Black: 1160#(<= ~top~0 2), Black: 178#(<= ~top~0 0), Black: 1157#(= ~top~0 0), 1032#true, t2Thread1of1ForFork1InUse, Black: 1809#(forall ((|v_t1Thread1of1ForFork0_get_top_#res#1_155| Int) (v_ArrVal_702 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_171| Int) (v_ArrVal_700 Int)) (or (not (= 4294967294 (mod (select (select (store (store |#memory_int| |~#arr~0.base| (store (select |#memory_int| |~#arr~0.base|) (+ (* |v_t1Thread1of1ForFork0_get_top_#res#1_155| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_171|) v_ArrVal_700)) |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296))) (not (<= (+ ~top~0 1) |v_t1Thread1of1ForFork0_get_top_#res#1_155|)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_171| |~#arr~0.offset|))), Black: 1703#(and (= |~#arr~0.offset| 0) (= ~top~0 1) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|)), Black: 1678#(and (<= (* ~top~0 4) (+ |~#m~0.offset| 4)) (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< |~#arr~0.offset| (+ |~#m~0.offset| 1)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 4))) (<= (+ |~#m~0.offset| 4) (* ~top~0 4)) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 4)) 4) (<= |~#m~0.offset| |~#arr~0.offset|)), Black: 1806#(and (= |~#arr~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_get_top_#res#1_155| Int) (v_ArrVal_702 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_171| Int) (v_ArrVal_700 Int)) (or (not (= 4294967294 (mod (select (select (store (store |#memory_int| |~#arr~0.base| (store (select |#memory_int| |~#arr~0.base|) (+ (* |v_t1Thread1of1ForFork0_get_top_#res#1_155| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_171|) v_ArrVal_700)) |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296))) (not (<= ~top~0 |v_t1Thread1of1ForFork0_get_top_#res#1_155|)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_171| |~#arr~0.offset|))) (< |~#arr~0.offset| (+ |~#m~0.offset| 1)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 4))) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 4)) 4) (<= |~#m~0.offset| |~#arr~0.offset|) (= ~top~0 3)), Black: 1714#(and (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 4294967296) (= |~#arr~0.offset| 0) (= ~top~0 2) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4))) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (<= (+ 4294967292 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)))) 4294967296) 4294967296)) 0) (= 3 |~#arr~0.base|)), Black: 1687#(and (= ~top~0 0) (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|)), Black: 1811#(and (= ~top~0 0) (forall ((|v_t1Thread1of1ForFork0_get_top_#res#1_155| Int) (v_ArrVal_702 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_171| Int) (v_ArrVal_700 Int)) (or (not (= 4294967294 (mod (select (select (store (store |#memory_int| |~#arr~0.base| (store (select |#memory_int| |~#arr~0.base|) (+ (* |v_t1Thread1of1ForFork0_get_top_#res#1_155| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_171|) v_ArrVal_700)) |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296))) (not (<= (+ ~top~0 1) |v_t1Thread1of1ForFork0_get_top_#res#1_155|)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_171| |~#arr~0.offset|))) (= |~#arr~0.offset| 0) (= 3 |~#arr~0.base|)), Black: 1679#(and (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< |~#arr~0.offset| (+ |~#m~0.offset| 1)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 4))) (= 3 |~#arr~0.base|) (<= (+ |~#m~0.offset| 8) (* ~top~0 4)) (<= (* ~top~0 4) (+ |~#m~0.offset| 8)) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 4)) 4) (<= |~#m~0.offset| |~#arr~0.offset|)), 1639#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296)))), Black: 164#(= ~top~0 0), Black: 279#(and (= ~top~0 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 2147483647) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 1439#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (= ~top~0 2) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (= 3 |~#arr~0.base|) (<= (+ |~#m~0.offset| 8) (* ~top~0 4)) (<= (* ~top~0 4) (+ |~#m~0.offset| 8))), Black: 1433#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (<= 0 |~#m~0.offset|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |~#m~0.offset| 0) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (= 3 |~#arr~0.base|)), Black: 1435#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_inc_top_#t~post31#1| 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (<= 0 |~#m~0.offset|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |~#m~0.offset| 0) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (= 3 |~#arr~0.base|)), Black: 168#(= |t1Thread1of1ForFork0_push_#res#1| 0), Black: 1437#(and (<= (* ~top~0 4) (+ |~#m~0.offset| 4)) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (= ~top~0 1) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (<= (+ |~#m~0.offset| 4) (* ~top~0 4)) (= 3 |~#arr~0.base|)), Black: 1441#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= ~top~0 2) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |t1Thread1of1ForFork0_push_~x#1| 4) (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= 3 |~#arr~0.base|) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |ULTIMATE.start_main_~#id2~0#1.base|)) (<= (+ |~#m~0.offset| 8) (* ~top~0 4)) (<= (* ~top~0 4) (+ |~#m~0.offset| 8))), 836#true, Black: 302#(and (<= 1 ~top~0) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (<= ~top~0 1) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 300#(and (= ~top~0 0) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 795#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (= 3 |~#arr~0.base|)), Black: 668#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (= 3 |~#arr~0.base|)), 170#true, 275#true, Black: 319#(and (= ~top~0 0) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 321#(and (<= 1 ~top~0) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (<= ~top~0 1) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 1976#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (= 3 |~#arr~0.base|)), Black: 2002#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (not (= (+ |t2Thread1of1ForFork1_#t~ret44#1| 2) 0)) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296)))), Black: 1966#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) (= |~#arr~0.offset| 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (= ~top~0 1) (<= (+ 8589934588 (* (div (+ (- 4294967297) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))))) 4294967296) 4294967296) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) 0) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) (= 3 |~#arr~0.base|)), 49#L1024-1true, Black: 1992#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (exists ((aux_mod_v_arrayElimCell_43_58 Int) (aux_div_v_arrayElimCell_43_58 Int)) (and (= |t2Thread1of1ForFork1_#t~ret44#1| (mod (+ (* 4294967295 aux_mod_v_arrayElimCell_43_58) 4294967295) 4294967296)) (< aux_mod_v_arrayElimCell_43_58 4294967296) (< 0 (+ (* aux_div_v_arrayElimCell_43_58 4294967296) 8589934593 aux_mod_v_arrayElimCell_43_58)) (<= 4294967291 aux_mod_v_arrayElimCell_43_58) (<= (+ (* aux_div_v_arrayElimCell_43_58 4294967296) aux_mod_v_arrayElimCell_43_58 4294967297) 0))) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (= 3 |~#arr~0.base|)), 22#L969-3true, 614#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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)))) (forall ((v_ArrVal_255 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_255) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294))) (= 3 |~#arr~0.base|)), 1155#true, 1394#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|))), 790#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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|)), 458#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296)))), Black: 592#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= |~#arr~0.offset| |~#m~0.offset|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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|) (= |~#m~0.offset| 0)), Black: 979#(and (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (forall ((v_ArrVal_373 Int) (|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (< (+ ~top~0 1) |v_t2Thread1of1ForFork1_get_top_#res#1_117|) (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (not (= 4294967294 (mod (select (select (store (store |#memory_int| |~#arr~0.base| (store (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) 4) v_ArrVal_373)) |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296))))) (<= ~top~0 1) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0)) (= 3 |~#arr~0.base|)), Black: 616#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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|)), Black: 622#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (<= (+ 8589934588 (* (div (+ (- 4294967297) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))))) 4294967296) 4294967296) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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) (- 4)))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (forall ((v_ArrVal_255 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_255) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294))) (= 3 |~#arr~0.base|)), 13#L1006-6true, Black: 1034#(= ~top~0 0), Black: 993#(forall ((|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296) 4294967294)) (< ~top~0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|))), Black: 1037#(<= ~top~0 2), Black: 1038#(<= ~top~0 3)]) [2022-12-05 22:59:59,457 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-05 22:59:59,457 INFO L385 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-05 22:59:59,457 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-05 22:59:59,457 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-05 22:59:59,760 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([620] L962-->L969-3: Formula: (and (= |v_t1Thread1of1ForFork0_get_top_#res#1_62| |v_t1Thread1of1ForFork0_push_#t~ret34#1_102|) (<= 0 (+ |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 2147483648)) (= |v_t1Thread1of1ForFork0_get_top_#res#1_62| v_~top~0_376) (= (store |v_#memory_int_158| |v_t1Thread1of1ForFork0_push_~stack#1.base_66| (store (select |v_#memory_int_158| |v_t1Thread1of1ForFork0_push_~stack#1.base_66|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_66| (* |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 4)) |v_t1Thread1of1ForFork0_push_~x#1_66|)) |v_#memory_int_157|) (not (= 5 v_~top~0_376)) (<= |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 2147483647)) InVars {t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_66|, #memory_int=|v_#memory_int_158|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_66|, ~top~0=v_~top~0_376, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_66|} OutVars{t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_66|, t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_102|, #memory_int=|v_#memory_int_157|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_66|, t1Thread1of1ForFork0_get_top_#res#1=|v_t1Thread1of1ForFork0_get_top_#res#1_62|, ~top~0=v_~top~0_376, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_66|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~ret34#1, #memory_int, t1Thread1of1ForFork0_get_top_#res#1][105], [Black: 986#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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|)), Black: 1036#(<= ~top~0 1), Black: 1605#(and (<= (* ~top~0 4) (+ |~#m~0.offset| 4)) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (= ~top~0 1) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (<= (+ |~#m~0.offset| 4) (* ~top~0 4)) (= 3 |~#arr~0.base|)), Black: 1595#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (<= 0 |~#m~0.offset|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |~#m~0.offset| 0) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (= 3 |~#arr~0.base|)), Black: 1641#(and (<= (* ~top~0 4) (+ |~#m~0.offset| 4)) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (= ~top~0 1) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (<= (+ |~#m~0.offset| 4) (* ~top~0 4)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 4)) 4)), Black: 1644#(and (<= (* ~top~0 4) (+ |~#m~0.offset| 4)) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (= ~top~0 1) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (<= (+ |~#m~0.offset| 4) (* ~top~0 4)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 4)) 4)), Black: 1632#(and (<= (+ |~#m~0.offset| 12) (* ~top~0 4)) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| 0) (<= (* ~top~0 4) (+ |~#m~0.offset| 12)) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 4))) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 4)) 4) (= ~top~0 3)), Black: 866#(and (= ~top~0 0) (= |~#arr~0.offset| 0) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< (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|)), Black: 1608#(and (<= (* ~top~0 4) (+ |~#m~0.offset| 4)) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (= ~top~0 1) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (<= (+ |~#m~0.offset| 4) (* ~top~0 4)) (= 3 |~#arr~0.base|)), 1782#(not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)), Black: 1228#(not (<= 5 ~top~0)), 1968#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296)))), Black: 174#(<= ~top~0 1), Black: 1159#(<= ~top~0 1), Black: 219#(not (<= 5 ~top~0)), Black: 178#(<= ~top~0 0), Black: 1160#(<= ~top~0 2), Black: 1157#(= ~top~0 0), 1032#true, t2Thread1of1ForFork1InUse, 96#t2EXITtrue, 815#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (<= (+ 8589934588 (* (div (+ (- 4294967297) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))))) 4294967296) 4294967296) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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) (- 4)))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (= 3 |~#arr~0.base|)), Black: 1809#(forall ((|v_t1Thread1of1ForFork0_get_top_#res#1_155| Int) (v_ArrVal_702 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_171| Int) (v_ArrVal_700 Int)) (or (not (= 4294967294 (mod (select (select (store (store |#memory_int| |~#arr~0.base| (store (select |#memory_int| |~#arr~0.base|) (+ (* |v_t1Thread1of1ForFork0_get_top_#res#1_155| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_171|) v_ArrVal_700)) |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296))) (not (<= (+ ~top~0 1) |v_t1Thread1of1ForFork0_get_top_#res#1_155|)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_171| |~#arr~0.offset|))), Black: 1703#(and (= |~#arr~0.offset| 0) (= ~top~0 1) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|)), Black: 1678#(and (<= (* ~top~0 4) (+ |~#m~0.offset| 4)) (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< |~#arr~0.offset| (+ |~#m~0.offset| 1)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 4))) (<= (+ |~#m~0.offset| 4) (* ~top~0 4)) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 4)) 4) (<= |~#m~0.offset| |~#arr~0.offset|)), Black: 1806#(and (= |~#arr~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_get_top_#res#1_155| Int) (v_ArrVal_702 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_171| Int) (v_ArrVal_700 Int)) (or (not (= 4294967294 (mod (select (select (store (store |#memory_int| |~#arr~0.base| (store (select |#memory_int| |~#arr~0.base|) (+ (* |v_t1Thread1of1ForFork0_get_top_#res#1_155| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_171|) v_ArrVal_700)) |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296))) (not (<= ~top~0 |v_t1Thread1of1ForFork0_get_top_#res#1_155|)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_171| |~#arr~0.offset|))) (< |~#arr~0.offset| (+ |~#m~0.offset| 1)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 4))) (= 3 |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 4)) 4) (<= |~#m~0.offset| |~#arr~0.offset|) (= ~top~0 3)), Black: 1714#(and (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) 4294967296) (= |~#arr~0.offset| 0) (= ~top~0 2) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4))) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (<= (+ 4294967292 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)) (* (div (+ (- 1) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 4)))) 4294967296) 4294967296)) 0) (= 3 |~#arr~0.base|)), Black: 1687#(and (= ~top~0 0) (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (= 3 |~#arr~0.base|)), Black: 1811#(and (= ~top~0 0) (forall ((|v_t1Thread1of1ForFork0_get_top_#res#1_155| Int) (v_ArrVal_702 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_171| Int) (v_ArrVal_700 Int)) (or (not (= 4294967294 (mod (select (select (store (store |#memory_int| |~#arr~0.base| (store (select |#memory_int| |~#arr~0.base|) (+ (* |v_t1Thread1of1ForFork0_get_top_#res#1_155| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_171|) v_ArrVal_700)) |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296))) (not (<= (+ ~top~0 1) |v_t1Thread1of1ForFork0_get_top_#res#1_155|)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_171| |~#arr~0.offset|))) (= |~#arr~0.offset| 0) (= 3 |~#arr~0.base|)), Black: 1679#(and (= |~#arr~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< |~#arr~0.offset| (+ |~#m~0.offset| 1)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 4))) (= 3 |~#arr~0.base|) (<= (+ |~#m~0.offset| 8) (* ~top~0 4)) (<= (* ~top~0 4) (+ |~#m~0.offset| 8)) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 4)) 4) (<= |~#m~0.offset| |~#arr~0.offset|)), 1639#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296)))), Black: 164#(= ~top~0 0), Black: 279#(and (= ~top~0 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 2147483647) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 1439#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (= ~top~0 2) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (= 3 |~#arr~0.base|) (<= (+ |~#m~0.offset| 8) (* ~top~0 4)) (<= (* ~top~0 4) (+ |~#m~0.offset| 8))), Black: 1433#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (<= 0 |~#m~0.offset|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |~#m~0.offset| 0) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (= 3 |~#arr~0.base|)), Black: 1435#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_inc_top_#t~post31#1| 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (<= 0 |~#m~0.offset|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |~#m~0.offset| 0) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (= 3 |~#arr~0.base|)), Black: 168#(= |t1Thread1of1ForFork0_push_#res#1| 0), Black: 1437#(and (<= (* ~top~0 4) (+ |~#m~0.offset| 4)) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (= ~top~0 1) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (<= (+ |~#m~0.offset| 4) (* ~top~0 4)) (= 3 |~#arr~0.base|)), Black: 1441#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= ~top~0 2) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |t1Thread1of1ForFork0_push_~x#1| 4) (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= 3 |~#arr~0.base|) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |ULTIMATE.start_main_~#id2~0#1.base|)) (<= (+ |~#m~0.offset| 8) (* ~top~0 4)) (<= (* ~top~0 4) (+ |~#m~0.offset| 8))), 836#true, Black: 302#(and (<= 1 ~top~0) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (<= ~top~0 1) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 300#(and (= ~top~0 0) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 795#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (= 3 |~#arr~0.base|)), Black: 668#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (= 3 |~#arr~0.base|)), 170#true, 275#true, Black: 319#(and (= ~top~0 0) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 321#(and (<= 1 ~top~0) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (<= ~top~0 1) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0))), Black: 1976#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (= 3 |~#arr~0.base|)), Black: 2002#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (not (= (+ |t2Thread1of1ForFork1_#t~ret44#1| 2) 0)) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296)))), Black: 1966#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) (= |~#arr~0.offset| 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (= ~top~0 1) (<= (+ 8589934588 (* (div (+ (- 4294967297) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))))) 4294967296) 4294967296) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) 0) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) (= 3 |~#arr~0.base|)), 49#L1024-1true, Black: 1992#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (exists ((aux_mod_v_arrayElimCell_43_58 Int) (aux_div_v_arrayElimCell_43_58 Int)) (and (= |t2Thread1of1ForFork1_#t~ret44#1| (mod (+ (* 4294967295 aux_mod_v_arrayElimCell_43_58) 4294967295) 4294967296)) (< aux_mod_v_arrayElimCell_43_58 4294967296) (< 0 (+ (* aux_div_v_arrayElimCell_43_58 4294967296) 8589934593 aux_mod_v_arrayElimCell_43_58)) (<= 4294967291 aux_mod_v_arrayElimCell_43_58) (<= (+ (* aux_div_v_arrayElimCell_43_58 4294967296) aux_mod_v_arrayElimCell_43_58 4294967297) 0))) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (= 3 |~#arr~0.base|)), 22#L969-3true, 614#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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)))) (forall ((v_ArrVal_255 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_255) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294))) (= 3 |~#arr~0.base|)), 1162#(<= ~top~0 3), 1394#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296))) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|))), 458#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (= (mod (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294)) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod |t1Thread1of1ForFork0_push_~x#1| 4294967296)))), Black: 592#(and (= ~top~0 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= |~#arr~0.offset| |~#m~0.offset|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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|) (= |~#m~0.offset| 0)), Black: 616#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (not (= 3 |ULTIMATE.start_main_~#id2~0#1.base|)) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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|)), Black: 979#(and (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (forall ((v_ArrVal_373 Int) (|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (< (+ ~top~0 1) |v_t2Thread1of1ForFork1_get_top_#res#1_117|) (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (not (= 4294967294 (mod (select (select (store (store |#memory_int| |~#arr~0.base| (store (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) 4) v_ArrVal_373)) |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296))))) (<= ~top~0 1) (not (= |ULTIMATE.start_main_~#id2~0#1.base| |~#arr~0.base|)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0)) (= 3 |~#arr~0.base|)), Black: 622#(and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (< (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 4294967296) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ 8589934588 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) (* (div (+ (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (- 4294967297)) 4294967296) 4294967296)) 0) (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ 4294967292 (* 4294967296 (div (+ (- 1) (* (- 1) |t1Thread1of1ForFork0_push_~x#1|)) 4294967296)) |t1Thread1of1ForFork0_push_~x#1|) 0) (<= (+ 8589934588 (* (div (+ (- 4294967297) (* (- 1) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))))) 4294967296) 4294967296) (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) 0) (< |t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (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) (- 4)))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (forall ((v_ArrVal_255 (Array Int Int))) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_255) |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 4294967296) 4294967294))) (= 3 |~#arr~0.base|)), Black: 1034#(= ~top~0 0), Black: 993#(forall ((|v_t2Thread1of1ForFork1_get_top_#res#1_117| Int) (v_ArrVal_374 (Array Int Int))) (or (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|)) (not (= (mod (select (select (store |#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_374) |~#arr~0.base|) (+ |~#arr~0.offset| (* |v_t2Thread1of1ForFork1_get_top_#res#1_117| 4) (- 4))) 4294967296) 4294967294)) (< ~top~0 |v_t2Thread1of1ForFork1_get_top_#res#1_117|))), Black: 1037#(<= ~top~0 2), Black: 1038#(<= ~top~0 3)]) [2022-12-05 22:59:59,760 INFO L382 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-05 22:59:59,760 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 22:59:59,760 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-05 22:59:59,760 INFO L385 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-05 22:59:59,811 INFO L130 PetriNetUnfolder]: 1900/5752 cut-off events. [2022-12-05 22:59:59,812 INFO L131 PetriNetUnfolder]: For 79823/80157 co-relation queries the response was YES. [2022-12-05 22:59:59,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31961 conditions, 5752 events. 1900/5752 cut-off events. For 79823/80157 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 54818 event pairs, 633 based on Foata normal form. 2/4965 useless extension candidates. Maximal degree in co-relation 31712. Up to 2225 conditions per place. [2022-12-05 22:59:59,956 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 233 places, 539 transitions, 13552 flow [2022-12-05 22:59:59,956 INFO L188 LiptonReduction]: Number of co-enabled transitions 3140 [2022-12-05 23:00:00,550 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:00:00,550 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1501 [2022-12-05 23:00:00,550 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 537 transitions, 13556 flow [2022-12-05 23:00:00,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.375) internal successors, (129), 24 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:00:00,551 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:00:00,551 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:00:00,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-05 23:00:00,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-05 23:00:00,755 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:00:00,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:00:00,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1355705295, now seen corresponding path program 1 times [2022-12-05 23:00:00,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:00:00,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792978073] [2022-12-05 23:00:00,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:00:00,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:00:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:00:01,303 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:00:01,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:00:01,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792978073] [2022-12-05 23:00:01,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792978073] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 23:00:01,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943169835] [2022-12-05 23:00:01,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:00:01,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 23:00:01,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:00:01,305 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 23:00:01,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-05 23:00:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:00:01,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 89 conjunts are in the unsatisfiable core [2022-12-05 23:00:01,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 23:00:01,441 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-05 23:00:01,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-05 23:00:01,501 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 13 treesize of output 9 [2022-12-05 23:00:01,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 23:00:01,570 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 30 treesize of output 25 [2022-12-05 23:00:01,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 23:00:01,619 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 30 treesize of output 25 [2022-12-05 23:00:01,649 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 21 treesize of output 21 [2022-12-05 23:00:01,737 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 23:00:01,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 33 [2022-12-05 23:00:01,772 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:00:01,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 23:00:01,820 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_853 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_853) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294))) is different from false [2022-12-05 23:00:07,876 INFO L321 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2022-12-05 23:00:07,876 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 2 case distinctions, treesize of input 53 treesize of output 60 [2022-12-05 23:00:07,886 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:00:07,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 62 [2022-12-05 23:00:07,891 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-05 23:00:12,002 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:00:12,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943169835] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 23:00:12,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 23:00:12,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-12-05 23:00:12,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818903581] [2022-12-05 23:00:12,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 23:00:12,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-05 23:00:12,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:00:12,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-05 23:00:12,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=420, Unknown=6, NotChecked=42, Total=552 [2022-12-05 23:00:12,003 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 93 [2022-12-05 23:00:12,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 537 transitions, 13556 flow. Second operand has 24 states, 24 states have (on average 4.833333333333333) internal successors, (116), 24 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:00:12,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:00:12,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 93 [2022-12-05 23:00:12,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:00:20,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 23:00:26,096 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-05 23:00:28,105 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 [1] [2022-12-05 23:00:35,525 INFO L130 PetriNetUnfolder]: 12844/26168 cut-off events. [2022-12-05 23:00:35,525 INFO L131 PetriNetUnfolder]: For 343095/343095 co-relation queries the response was YES. [2022-12-05 23:00:35,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140382 conditions, 26168 events. 12844/26168 cut-off events. For 343095/343095 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 230064 event pairs, 3501 based on Foata normal form. 6/26174 useless extension candidates. Maximal degree in co-relation 139176. Up to 9492 conditions per place. [2022-12-05 23:00:35,747 INFO L137 encePairwiseOnDemand]: 27/93 looper letters, 645 selfloop transitions, 483 changer transitions 87/1218 dead transitions. [2022-12-05 23:00:35,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 1218 transitions, 26317 flow [2022-12-05 23:00:35,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-05 23:00:35,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-12-05 23:00:35,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 613 transitions. [2022-12-05 23:00:35,749 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1690102012682658 [2022-12-05 23:00:35,749 INFO L175 Difference]: Start difference. First operand has 231 places, 537 transitions, 13556 flow. Second operand 39 states and 613 transitions. [2022-12-05 23:00:35,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 1218 transitions, 26317 flow [2022-12-05 23:00:36,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 1218 transitions, 26211 flow, removed 48 selfloop flow, removed 6 redundant places. [2022-12-05 23:00:36,619 INFO L231 Difference]: Finished difference. Result has 284 places, 816 transitions, 22546 flow [2022-12-05 23:00:36,620 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=13510, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=254, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=22546, PETRI_PLACES=284, PETRI_TRANSITIONS=816} [2022-12-05 23:00:36,620 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 242 predicate places. [2022-12-05 23:00:36,620 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:00:36,620 INFO L89 Accepts]: Start accepts. Operand has 284 places, 816 transitions, 22546 flow [2022-12-05 23:00:36,623 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:00:36,623 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:00:36,624 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 284 places, 816 transitions, 22546 flow [2022-12-05 23:00:36,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 284 places, 816 transitions, 22546 flow [2022-12-05 23:00:38,506 INFO L130 PetriNetUnfolder]: 3771/11043 cut-off events. [2022-12-05 23:00:38,507 INFO L131 PetriNetUnfolder]: For 200952/201781 co-relation queries the response was YES. [2022-12-05 23:00:38,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71021 conditions, 11043 events. 3771/11043 cut-off events. For 200952/201781 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 111372 event pairs, 1345 based on Foata normal form. 9/10065 useless extension candidates. Maximal degree in co-relation 69726. Up to 4060 conditions per place. [2022-12-05 23:00:38,837 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 284 places, 816 transitions, 22546 flow [2022-12-05 23:00:38,837 INFO L188 LiptonReduction]: Number of co-enabled transitions 4516 [2022-12-05 23:00:38,840 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L992-6-->push_returnLabel#1: Formula: (let ((.cse0 (mod |v_t1Thread1of1ForFork0_~tmp~0#1_147| 4294967296)) (.cse1 (select |v_#pthreadsMutex_622| |v_~#m~0.base_252|))) (and (not (= 5 v_~top~0_644)) (= |v_t1Thread1of1ForFork0_push_#in~stack#1.base_83| |v_t1Thread1of1ForFork0_push_~stack#1.base_143|) (= (ite (< .cse0 5) 1 0) |v_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_125|) (= |v_t1Thread1of1ForFork0_push_~x#1_143| |v_t1Thread1of1ForFork0_push_#in~x#1_83|) (= |v_t1Thread1of1ForFork0_push_#in~stack#1.base_83| |v_~#arr~0.base_189|) (= |v_#memory_int_353| (store |v_#memory_int_354| |v_t1Thread1of1ForFork0_push_~stack#1.base_143| (store (select |v_#memory_int_354| |v_t1Thread1of1ForFork0_push_~stack#1.base_143|) (+ (* |v_t1Thread1of1ForFork0_get_top_#res#1_132| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_143|) |v_t1Thread1of1ForFork0_push_~x#1_143|))) (not (= |v_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1_137| 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_190| 5) (= (select .cse1 |v_~#m~0.offset_254|) 0) (= |v_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1_137| |v_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_125|) (<= 0 (+ |v_t1Thread1of1ForFork0_get_top_#res#1_132| 2147483648)) (<= |v_t1Thread1of1ForFork0_get_top_#res#1_132| 2147483647) (= |v_t1Thread1of1ForFork0_push_#in~x#1_83| (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) (= |v_t1Thread1of1ForFork0_push_#res#1_244| 0) (= |v_t1Thread1of1ForFork0_push_#in~stack#1.offset_83| |v_~#arr~0.offset_189|) (= |v_t1Thread1of1ForFork0_push_#in~stack#1.offset_83| |v_t1Thread1of1ForFork0_push_~stack#1.offset_143|) (= (+ v_~top~0_644 1) v_~top~0_643) (= |v_t1Thread1of1ForFork0_~tmp~0#1_147| |v_t1Thread1of1ForFork0_#t~nondet40#1_182|) (= (store |v_#pthreadsMutex_622| |v_~#m~0.base_252| (store .cse1 |v_~#m~0.offset_254| 1)) |v_#pthreadsMutex_621|) (= |v_t1Thread1of1ForFork0_get_top_#res#1_132| v_~top~0_644))) InVars {~#arr~0.offset=|v_~#arr~0.offset_189|, #pthreadsMutex=|v_#pthreadsMutex_622|, ~#m~0.base=|v_~#m~0.base_252|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_190|, ~#m~0.offset=|v_~#m~0.offset_254|, #memory_int=|v_#memory_int_354|, ~top~0=v_~top~0_644, ~#arr~0.base=|v_~#arr~0.base_189|, t1Thread1of1ForFork0_#t~nondet40#1=|v_t1Thread1of1ForFork0_#t~nondet40#1_182|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_189|, #pthreadsMutex=|v_#pthreadsMutex_621|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_190|, t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_143|, t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_125|, t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_235|, t1Thread1of1ForFork0_push_#in~stack#1.offset=|v_t1Thread1of1ForFork0_push_#in~stack#1.offset_83|, ~top~0=v_~top~0_643, t1Thread1of1ForFork0_get_top_#res#1=|v_t1Thread1of1ForFork0_get_top_#res#1_132|, t1Thread1of1ForFork0_push_#in~x#1=|v_t1Thread1of1ForFork0_push_#in~x#1_83|, t1Thread1of1ForFork0_push_#in~stack#1.base=|v_t1Thread1of1ForFork0_push_#in~stack#1.base_83|, t1Thread1of1ForFork0_push_#res#1=|v_t1Thread1of1ForFork0_push_#res#1_244|, ~#m~0.base=|v_~#m~0.base_252|, t1Thread1of1ForFork0_~tmp~0#1=|v_t1Thread1of1ForFork0_~tmp~0#1_147|, ~#m~0.offset=|v_~#m~0.offset_254|, #memory_int=|v_#memory_int_353|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_143|, t1Thread1of1ForFork0_push_#t~nondet33#1=|v_t1Thread1of1ForFork0_push_#t~nondet33#1_92|, t1Thread1of1ForFork0_#t~nondet39#1=|v_t1Thread1of1ForFork0_#t~nondet39#1_133|, t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_298|, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_143|, ~#arr~0.base=|v_~#arr~0.base_189|, t1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1_137|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork0_push_~x#1, t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, t1Thread1of1ForFork0_push_#t~ret34#1, t1Thread1of1ForFork0_push_#in~stack#1.offset, ~top~0, t1Thread1of1ForFork0_get_top_#res#1, t1Thread1of1ForFork0_push_#in~x#1, t1Thread1of1ForFork0_push_#in~stack#1.base, t1Thread1of1ForFork0_#t~nondet40#1, t1Thread1of1ForFork0_push_#res#1, t1Thread1of1ForFork0_~tmp~0#1, #memory_int, t1Thread1of1ForFork0_push_~stack#1.base, t1Thread1of1ForFork0_push_#t~nondet33#1, t1Thread1of1ForFork0_#t~nondet39#1, t1Thread1of1ForFork0_inc_top_#t~post31#1, t1Thread1of1ForFork0_push_~stack#1.offset, t1Thread1of1ForFork0_assume_abort_if_not_~cond#1] and [564] L1023-4-->L1024-1: Formula: (= |v_ULTIMATE.start_main_#t~mem49#1_10| (select (select |v_#memory_int_98| |v_ULTIMATE.start_main_~#id1~0#1.base_15|) |v_ULTIMATE.start_main_~#id1~0#1.offset_15|)) InVars {#memory_int=|v_#memory_int_98|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_15|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_15|} OutVars{ULTIMATE.start_main_#t~mem49#1=|v_ULTIMATE.start_main_#t~mem49#1_10|, ULTIMATE.start_main_#t~nondet48#1=|v_ULTIMATE.start_main_#t~nondet48#1_5|, #memory_int=|v_#memory_int_98|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_13|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_15|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem49#1, ULTIMATE.start_main_#t~nondet48#1, ULTIMATE.start_main_#t~pre47#1] [2022-12-05 23:00:40,376 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-05 23:00:40,377 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3757 [2022-12-05 23:00:40,377 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 815 transitions, 22639 flow [2022-12-05 23:00:40,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.833333333333333) internal successors, (116), 24 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:00:40,377 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:00:40,377 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:00:40,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-05 23:00:40,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 23:00:40,583 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:00:40,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:00:40,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1002715065, now seen corresponding path program 1 times [2022-12-05 23:00:40,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:00:40,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78430694] [2022-12-05 23:00:40,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:00:40,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:00:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:00:41,042 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:00:41,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:00:41,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78430694] [2022-12-05 23:00:41,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78430694] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 23:00:41,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197601606] [2022-12-05 23:00:41,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:00:41,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 23:00:41,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:00:41,044 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 23:00:41,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-05 23:00:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:00:41,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-05 23:00:41,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 23:00:41,176 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-05 23:00:41,176 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-05 23:00:41,353 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 20 treesize of output 15 [2022-12-05 23:00:41,395 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 51 treesize of output 46 [2022-12-05 23:00:41,529 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-05 23:00:41,737 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:00:41,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 23:00:41,812 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_919 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_919) |c_~#arr~0.base|) (+ (* 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|) |c_~#arr~0.offset|)) 4294967296) 4294967294))) is different from false [2022-12-05 23:00:41,817 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:00:41,817 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-05 23:00:41,824 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:00:41,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2022-12-05 23:00:41,827 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-05 23:00:41,904 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-05 23:00:41,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197601606] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 23:00:41,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 23:00:41,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 22 [2022-12-05 23:00:41,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471532051] [2022-12-05 23:00:41,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 23:00:41,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-05 23:00:41,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:00:41,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-05 23:00:41,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=438, Unknown=1, NotChecked=42, Total=552 [2022-12-05 23:00:41,905 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 101 [2022-12-05 23:00:41,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 815 transitions, 22639 flow. Second operand has 24 states, 24 states have (on average 5.333333333333333) internal successors, (128), 24 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:00:41,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:00:41,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 101 [2022-12-05 23:00:41,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:00:46,219 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-05 23:00:54,937 INFO L130 PetriNetUnfolder]: 16143/33010 cut-off events. [2022-12-05 23:00:54,937 INFO L131 PetriNetUnfolder]: For 588386/588386 co-relation queries the response was YES. [2022-12-05 23:00:55,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207162 conditions, 33010 events. 16143/33010 cut-off events. For 588386/588386 co-relation queries the response was YES. Maximal size of possible extension queue 779. Compared 299875 event pairs, 5036 based on Foata normal form. 84/32992 useless extension candidates. Maximal degree in co-relation 202486. Up to 15417 conditions per place. [2022-12-05 23:00:55,354 INFO L137 encePairwiseOnDemand]: 46/101 looper letters, 809 selfloop transitions, 367 changer transitions 5/1184 dead transitions. [2022-12-05 23:00:55,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 1184 transitions, 32865 flow [2022-12-05 23:00:55,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-05 23:00:55,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-05 23:00:55,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 313 transitions. [2022-12-05 23:00:55,356 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1936881188118812 [2022-12-05 23:00:55,356 INFO L175 Difference]: Start difference. First operand has 283 places, 815 transitions, 22639 flow. Second operand 16 states and 313 transitions. [2022-12-05 23:00:55,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 1184 transitions, 32865 flow [2022-12-05 23:00:56,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 1184 transitions, 32486 flow, removed 142 selfloop flow, removed 8 redundant places. [2022-12-05 23:00:56,900 INFO L231 Difference]: Finished difference. Result has 299 places, 976 transitions, 29130 flow [2022-12-05 23:00:56,901 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=22347, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=815, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=210, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=29130, PETRI_PLACES=299, PETRI_TRANSITIONS=976} [2022-12-05 23:00:56,901 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 257 predicate places. [2022-12-05 23:00:56,901 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:00:56,901 INFO L89 Accepts]: Start accepts. Operand has 299 places, 976 transitions, 29130 flow [2022-12-05 23:00:56,906 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:00:56,906 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:00:56,906 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 299 places, 976 transitions, 29130 flow [2022-12-05 23:00:56,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 299 places, 976 transitions, 29130 flow [2022-12-05 23:00:59,764 INFO L130 PetriNetUnfolder]: 4734/13829 cut-off events. [2022-12-05 23:00:59,764 INFO L131 PetriNetUnfolder]: For 288626/289925 co-relation queries the response was YES. [2022-12-05 23:00:59,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94802 conditions, 13829 events. 4734/13829 cut-off events. For 288626/289925 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 143903 event pairs, 1722 based on Foata normal form. 13/12608 useless extension candidates. Maximal degree in co-relation 92391. Up to 5159 conditions per place. [2022-12-05 23:01:00,010 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 299 places, 976 transitions, 29130 flow [2022-12-05 23:01:00,011 INFO L188 LiptonReduction]: Number of co-enabled transitions 5488 [2022-12-05 23:01:01,247 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-05 23:01:01,248 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4347 [2022-12-05 23:01:01,248 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 974 transitions, 29143 flow [2022-12-05 23:01:01,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.333333333333333) internal successors, (128), 24 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:01:01,248 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:01:01,248 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:01:01,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-05 23:01:01,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-12-05 23:01:01,449 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:01:01,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:01:01,450 INFO L85 PathProgramCache]: Analyzing trace with hash -629881314, now seen corresponding path program 1 times [2022-12-05 23:01:01,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:01:01,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512198541] [2022-12-05 23:01:01,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:01:01,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:01:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:01:02,164 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:01:02,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:01:02,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512198541] [2022-12-05 23:01:02,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512198541] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 23:01:02,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837577095] [2022-12-05 23:01:02,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:01:02,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 23:01:02,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:01:02,166 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 23:01:02,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-05 23:01:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:01:02,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 84 conjunts are in the unsatisfiable core [2022-12-05 23:01:02,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 23:01:02,326 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-05 23:01:02,326 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-05 23:01:02,417 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-05 23:01:02,478 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-05 23:01:02,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 23:01:02,675 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 60 treesize of output 40 [2022-12-05 23:01:02,829 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-05 23:01:03,685 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:01:03,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 23:01:03,939 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_989 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_989) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-12-05 23:01:03,960 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:01:03,960 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 31 treesize of output 32 [2022-12-05 23:01:03,964 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 89 treesize of output 49 [2022-12-05 23:01:03,968 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-05 23:01:04,005 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 23:01:04,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837577095] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 23:01:04,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 23:01:04,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 26 [2022-12-05 23:01:04,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869587346] [2022-12-05 23:01:04,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 23:01:04,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-05 23:01:04,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:01:04,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-05 23:01:04,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=622, Unknown=1, NotChecked=50, Total=756 [2022-12-05 23:01:04,006 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 110 [2022-12-05 23:01:04,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 974 transitions, 29143 flow. Second operand has 28 states, 28 states have (on average 5.142857142857143) internal successors, (144), 28 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:01:04,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:01:04,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 110 [2022-12-05 23:01:04,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:01:08,966 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-05 23:01:11,067 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-05 23:01:13,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-05 23:01:16,084 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-05 23:01:18,220 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-05 23:01:20,690 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-05 23:01:24,405 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-05 23:01:26,488 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-05 23:01:28,520 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-05 23:01:31,032 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-05 23:01:34,866 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-05 23:01:37,766 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-05 23:01:43,746 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-05 23:01:48,493 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-05 23:01:50,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-05 23:01:52,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-05 23:02:01,777 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-05 23:02:02,896 INFO L130 PetriNetUnfolder]: 20180/41112 cut-off events. [2022-12-05 23:02:02,896 INFO L131 PetriNetUnfolder]: For 856096/856096 co-relation queries the response was YES. [2022-12-05 23:02:03,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276848 conditions, 41112 events. 20180/41112 cut-off events. For 856096/856096 co-relation queries the response was YES. Maximal size of possible extension queue 965. Compared 382488 event pairs, 5860 based on Foata normal form. 60/41046 useless extension candidates. Maximal degree in co-relation 269681. Up to 14944 conditions per place. [2022-12-05 23:02:03,469 INFO L137 encePairwiseOnDemand]: 35/110 looper letters, 755 selfloop transitions, 692 changer transitions 23/1473 dead transitions. [2022-12-05 23:02:03,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 1473 transitions, 42092 flow [2022-12-05 23:02:03,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-05 23:02:03,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-05 23:02:03,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 443 transitions. [2022-12-05 23:02:03,471 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1610909090909091 [2022-12-05 23:02:03,471 INFO L175 Difference]: Start difference. First operand has 297 places, 974 transitions, 29143 flow. Second operand 25 states and 443 transitions. [2022-12-05 23:02:03,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 1473 transitions, 42092 flow [2022-12-05 23:02:05,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 1473 transitions, 41742 flow, removed 173 selfloop flow, removed 4 redundant places. [2022-12-05 23:02:05,747 INFO L231 Difference]: Finished difference. Result has 332 places, 1224 transitions, 38702 flow [2022-12-05 23:02:05,748 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=28989, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=974, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=472, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=38702, PETRI_PLACES=332, PETRI_TRANSITIONS=1224} [2022-12-05 23:02:05,748 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 290 predicate places. [2022-12-05 23:02:05,748 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:02:05,748 INFO L89 Accepts]: Start accepts. Operand has 332 places, 1224 transitions, 38702 flow [2022-12-05 23:02:05,754 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:02:05,754 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:02:05,754 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 332 places, 1224 transitions, 38702 flow [2022-12-05 23:02:05,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 331 places, 1224 transitions, 38702 flow [2022-12-05 23:02:09,671 INFO L130 PetriNetUnfolder]: 5980/17303 cut-off events. [2022-12-05 23:02:09,671 INFO L131 PetriNetUnfolder]: For 440684/442276 co-relation queries the response was YES. [2022-12-05 23:02:09,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126711 conditions, 17303 events. 5980/17303 cut-off events. For 440684/442276 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 183551 event pairs, 2200 based on Foata normal form. 15/15736 useless extension candidates. Maximal degree in co-relation 124817. Up to 6420 conditions per place. [2022-12-05 23:02:10,114 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 331 places, 1224 transitions, 38702 flow [2022-12-05 23:02:10,114 INFO L188 LiptonReduction]: Number of co-enabled transitions 6748 [2022-12-05 23:02:12,384 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:02:12,385 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6637 [2022-12-05 23:02:12,385 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 1222 transitions, 38733 flow [2022-12-05 23:02:12,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.142857142857143) internal successors, (144), 28 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:02:12,385 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:02:12,385 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:02:12,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-05 23:02:12,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 23:02:12,586 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:02:12,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:02:12,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1164145950, now seen corresponding path program 1 times [2022-12-05 23:02:12,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:02:12,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480362975] [2022-12-05 23:02:12,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:02:12,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:02:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:02:13,256 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:02:13,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:02:13,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480362975] [2022-12-05 23:02:13,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480362975] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 23:02:13,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406138695] [2022-12-05 23:02:13,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:02:13,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 23:02:13,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:02:13,258 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 23:02:13,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-05 23:02:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:02:13,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-05 23:02:13,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 23:02:13,534 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 22 treesize of output 17 [2022-12-05 23:02:13,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 23:02:13,692 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 60 treesize of output 40 [2022-12-05 23:02:13,835 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-05 23:02:16,444 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:02:16,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 23:02:16,906 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 38 treesize of output 30 [2022-12-05 23:02:16,951 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 23:02:16,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406138695] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 23:02:16,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 23:02:16,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 26 [2022-12-05 23:02:16,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334339670] [2022-12-05 23:02:16,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 23:02:16,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-05 23:02:16,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:02:16,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-05 23:02:16,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=626, Unknown=1, NotChecked=0, Total=702 [2022-12-05 23:02:16,953 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 123 [2022-12-05 23:02:16,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 1222 transitions, 38733 flow. Second operand has 27 states, 27 states have (on average 5.222222222222222) internal successors, (141), 27 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:02:16,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:02:16,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 123 [2022-12-05 23:02:16,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:02:49,155 INFO L130 PetriNetUnfolder]: 26661/54309 cut-off events. [2022-12-05 23:02:49,155 INFO L131 PetriNetUnfolder]: For 1329589/1329589 co-relation queries the response was YES. [2022-12-05 23:02:50,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 385306 conditions, 54309 events. 26661/54309 cut-off events. For 1329589/1329589 co-relation queries the response was YES. Maximal size of possible extension queue 1105. Compared 513979 event pairs, 6849 based on Foata normal form. 132/54279 useless extension candidates. Maximal degree in co-relation 374605. Up to 19814 conditions per place. [2022-12-05 23:02:50,547 INFO L137 encePairwiseOnDemand]: 28/123 looper letters, 537 selfloop transitions, 1361 changer transitions 37/1938 dead transitions. [2022-12-05 23:02:50,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 1938 transitions, 59024 flow [2022-12-05 23:02:50,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-05 23:02:50,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-05 23:02:50,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 561 transitions. [2022-12-05 23:02:50,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12669376693766937 [2022-12-05 23:02:50,549 INFO L175 Difference]: Start difference. First operand has 329 places, 1222 transitions, 38733 flow. Second operand 36 states and 561 transitions. [2022-12-05 23:02:50,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 1938 transitions, 59024 flow [2022-12-05 23:02:55,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 1938 transitions, 58200 flow, removed 398 selfloop flow, removed 4 redundant places. [2022-12-05 23:02:55,540 INFO L231 Difference]: Finished difference. Result has 375 places, 1609 transitions, 55164 flow [2022-12-05 23:02:55,541 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=38248, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=979, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=55164, PETRI_PLACES=375, PETRI_TRANSITIONS=1609} [2022-12-05 23:02:55,542 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 333 predicate places. [2022-12-05 23:02:55,542 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:02:55,542 INFO L89 Accepts]: Start accepts. Operand has 375 places, 1609 transitions, 55164 flow [2022-12-05 23:02:55,550 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:02:55,550 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:02:55,550 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 375 places, 1609 transitions, 55164 flow [2022-12-05 23:02:55,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 375 places, 1609 transitions, 55164 flow [2022-12-05 23:03:02,317 INFO L130 PetriNetUnfolder]: 8149/23537 cut-off events. [2022-12-05 23:03:02,317 INFO L131 PetriNetUnfolder]: For 733209/734698 co-relation queries the response was YES. [2022-12-05 23:03:02,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185092 conditions, 23537 events. 8149/23537 cut-off events. For 733209/734698 co-relation queries the response was YES. Maximal size of possible extension queue 679. Compared 256138 event pairs, 2887 based on Foata normal form. 13/21454 useless extension candidates. Maximal degree in co-relation 183254. Up to 8865 conditions per place. [2022-12-05 23:03:03,042 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 375 places, 1609 transitions, 55164 flow [2022-12-05 23:03:03,042 INFO L188 LiptonReduction]: Number of co-enabled transitions 8804 [2022-12-05 23:03:05,717 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 23:03:05,718 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10176 [2022-12-05 23:03:05,718 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 1607 transitions, 55271 flow [2022-12-05 23:03:05,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.222222222222222) internal successors, (141), 27 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:03:05,718 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:03:05,718 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:03:05,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-05 23:03:05,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 23:03:05,920 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:03:05,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:03:05,921 INFO L85 PathProgramCache]: Analyzing trace with hash -843397428, now seen corresponding path program 1 times [2022-12-05 23:03:05,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:03:05,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053116708] [2022-12-05 23:03:05,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:03:05,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:03:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:03:06,528 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-05 23:03:06,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:03:06,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053116708] [2022-12-05 23:03:06,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053116708] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 23:03:06,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782027660] [2022-12-05 23:03:06,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:03:06,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 23:03:06,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:03:06,530 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 23:03:06,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-05 23:03:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:03:06,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 67 conjunts are in the unsatisfiable core [2022-12-05 23:03:06,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 23:03:06,676 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-05 23:03:06,676 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-05 23:03:06,859 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 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-05 23:03:06,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2022-12-05 23:03:07,024 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-05 23:03:07,135 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-05 23:03:07,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 23:03:07,236 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:03:07,237 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-05 23:03:07,249 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:03:07,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2022-12-05 23:03:07,252 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-05 23:03:07,324 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-05 23:03:07,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782027660] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 23:03:07,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 23:03:07,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 24 [2022-12-05 23:03:07,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812298971] [2022-12-05 23:03:07,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 23:03:07,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-05 23:03:07,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:03:07,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-05 23:03:07,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2022-12-05 23:03:07,325 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 138 [2022-12-05 23:03:07,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 1607 transitions, 55271 flow. Second operand has 26 states, 26 states have (on average 5.269230769230769) internal successors, (137), 26 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:03:07,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:03:07,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 138 [2022-12-05 23:03:07,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:03:10,345 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-05 23:03:12,484 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-05 23:03:14,787 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-05 23:03:16,898 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-05 23:03:19,351 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-05 23:03:21,900 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-05 23:03:23,994 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-05 23:03:26,060 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-05 23:03:30,088 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-05 23:03:32,241 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-05 23:03:34,306 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-05 23:03:37,659 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-05 23:03:39,760 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-05 23:03:41,951 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-05 23:03:44,288 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-05 23:03:46,728 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-05 23:03:48,838 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-05 23:03:50,901 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-05 23:03:54,702 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-05 23:03:57,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-05 23:04:01,370 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-05 23:04:05,416 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-05 23:04:07,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-05 23:04:09,529 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-05 23:04:11,684 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-05 23:04:15,973 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-05 23:04:18,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] [2022-12-05 23:04:20,400 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-05 23:04:25,234 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-05 23:04:26,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-05 23:04:29,052 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-05 23:04:30,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-05 23:04:34,029 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-05 23:04:36,444 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-05 23:04:38,781 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-05 23:04:42,984 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-05 23:04:46,562 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-05 23:04:53,477 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-05 23:04:57,971 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-05 23:05:02,406 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-05 23:05:17,767 INFO L130 PetriNetUnfolder]: 28630/58655 cut-off events. [2022-12-05 23:05:17,768 INFO L131 PetriNetUnfolder]: For 1651601/1651601 co-relation queries the response was YES. [2022-12-05 23:05:19,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430702 conditions, 58655 events. 28630/58655 cut-off events. For 1651601/1651601 co-relation queries the response was YES. Maximal size of possible extension queue 1175. Compared 559727 event pairs, 5235 based on Foata normal form. 126/58601 useless extension candidates. Maximal degree in co-relation 428726. Up to 21391 conditions per place. [2022-12-05 23:05:19,321 INFO L137 encePairwiseOnDemand]: 50/138 looper letters, 491 selfloop transitions, 1508 changer transitions 25/2027 dead transitions. [2022-12-05 23:05:19,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 2027 transitions, 67447 flow [2022-12-05 23:05:19,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-05 23:05:19,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-05 23:05:19,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 519 transitions. [2022-12-05 23:05:19,323 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11061381074168798 [2022-12-05 23:05:19,323 INFO L175 Difference]: Start difference. First operand has 373 places, 1607 transitions, 55271 flow. Second operand 34 states and 519 transitions. [2022-12-05 23:05:19,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 2027 transitions, 67447 flow [2022-12-05 23:05:26,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 2027 transitions, 66732 flow, removed 350 selfloop flow, removed 7 redundant places. [2022-12-05 23:05:26,825 INFO L231 Difference]: Finished difference. Result has 408 places, 1771 transitions, 63412 flow [2022-12-05 23:05:26,827 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=53606, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1318, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=63412, PETRI_PLACES=408, PETRI_TRANSITIONS=1771} [2022-12-05 23:05:26,827 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 366 predicate places. [2022-12-05 23:05:26,827 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:05:26,827 INFO L89 Accepts]: Start accepts. Operand has 408 places, 1771 transitions, 63412 flow [2022-12-05 23:05:26,837 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:05:26,837 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:05:26,837 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 408 places, 1771 transitions, 63412 flow [2022-12-05 23:05:26,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 408 places, 1771 transitions, 63412 flow [2022-12-05 23:05:35,028 INFO L130 PetriNetUnfolder]: 8831/25521 cut-off events. [2022-12-05 23:05:35,028 INFO L131 PetriNetUnfolder]: For 843474/844926 co-relation queries the response was YES. [2022-12-05 23:05:35,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207028 conditions, 25521 events. 8831/25521 cut-off events. For 843474/844926 co-relation queries the response was YES. Maximal size of possible extension queue 742. Compared 278410 event pairs, 3150 based on Foata normal form. 16/23313 useless extension candidates. Maximal degree in co-relation 205395. Up to 9662 conditions per place. [2022-12-05 23:05:35,887 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 408 places, 1771 transitions, 63412 flow [2022-12-05 23:05:35,888 INFO L188 LiptonReduction]: Number of co-enabled transitions 9564 [2022-12-05 23:05:36,393 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:05:36,393 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9566 [2022-12-05 23:05:36,393 INFO L495 AbstractCegarLoop]: Abstraction has has 406 places, 1769 transitions, 63404 flow [2022-12-05 23:05:36,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.269230769230769) internal successors, (137), 26 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:05:36,394 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:05:36,394 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:05:36,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-05 23:05:36,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-05 23:05:36,602 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:05:36,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:05:36,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1429282179, now seen corresponding path program 1 times [2022-12-05 23:05:36,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:05:36,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585957891] [2022-12-05 23:05:36,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:05:36,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:05:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:05:37,253 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:05:37,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:05:37,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585957891] [2022-12-05 23:05:37,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585957891] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 23:05:37,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287576834] [2022-12-05 23:05:37,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:05:37,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 23:05:37,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:05:37,256 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 23:05:37,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-05 23:05:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:05:37,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 98 conjunts are in the unsatisfiable core [2022-12-05 23:05:37,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 23:05:37,470 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-05 23:05:37,471 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-05 23:05:37,556 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 22 treesize of output 17 [2022-12-05 23:05:37,597 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-05 23:05:37,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 23:05:37,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2022-12-05 23:05:37,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 23:05:37,839 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-05 23:05:37,961 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-05 23:05:44,146 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-05 23:05:44,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 23:05:44,545 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1213 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1213) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-12-05 23:05:44,551 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:05:44,551 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-05 23:05:44,557 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:05:44,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2022-12-05 23:05:44,560 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-05 23:05:44,633 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-05 23:05:44,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287576834] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 23:05:44,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 23:05:44,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 31 [2022-12-05 23:05:44,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20356131] [2022-12-05 23:05:44,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 23:05:44,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-05 23:05:44,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:05:44,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-05 23:05:44,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=860, Unknown=3, NotChecked=60, Total=1056 [2022-12-05 23:05:44,634 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 140 [2022-12-05 23:05:44,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 1769 transitions, 63404 flow. Second operand has 33 states, 33 states have (on average 4.818181818181818) internal successors, (159), 33 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:05:44,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:05:44,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 140 [2022-12-05 23:05:44,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:05:46,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-05 23:05:48,439 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-05 23:05:50,817 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-05 23:05:54,600 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-05 23:05:58,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-05 23:06:01,474 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-05 23:06:03,612 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] Received shutdown request... [2022-12-05 23:06:04,176 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-05 23:06:04,176 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-05 23:06:05,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-05 23:06:05,376 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-12-05 23:06:05,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2022-12-05 23:06:05,413 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 23:06:05,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-05 23:06:05,413 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-12-05 23:06:05,414 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2022-12-05 23:06:05,414 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 23:06:05,414 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-12-05 23:06:05,414 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-12-05 23:06:05,414 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 23:06:05,415 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:06:05,418 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:06:05,418 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:06:05,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:06:05 BasicIcfg [2022-12-05 23:06:05,419 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:06:05,420 INFO L158 Benchmark]: Toolchain (without parser) took 837247.25ms. Allocated memory was 181.4MB in the beginning and 6.1GB in the end (delta: 5.9GB). Free memory was 156.0MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2022-12-05 23:06:05,420 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:06:05,420 INFO L158 Benchmark]: CACSL2BoogieTranslator took 436.00ms. Allocated memory is still 181.4MB. Free memory was 155.3MB in the beginning and 126.5MB in the end (delta: 28.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-05 23:06:05,420 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.07ms. Allocated memory is still 181.4MB. Free memory was 126.5MB in the beginning and 123.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 23:06:05,420 INFO L158 Benchmark]: Boogie Preprocessor took 19.83ms. Allocated memory is still 181.4MB. Free memory was 123.9MB in the beginning and 121.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:06:05,420 INFO L158 Benchmark]: RCFGBuilder took 470.50ms. Allocated memory is still 181.4MB. Free memory was 121.8MB in the beginning and 155.0MB in the end (delta: -33.3MB). Peak memory consumption was 18.6MB. Max. memory is 8.0GB. [2022-12-05 23:06:05,420 INFO L158 Benchmark]: TraceAbstraction took 836276.33ms. Allocated memory was 181.4MB in the beginning and 6.1GB in the end (delta: 5.9GB). Free memory was 154.5MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2022-12-05 23:06:05,424 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 436.00ms. Allocated memory is still 181.4MB. Free memory was 155.3MB in the beginning and 126.5MB in the end (delta: 28.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.07ms. Allocated memory is still 181.4MB. Free memory was 126.5MB in the beginning and 123.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.83ms. Allocated memory is still 181.4MB. Free memory was 123.9MB in the beginning and 121.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 470.50ms. Allocated memory is still 181.4MB. Free memory was 121.8MB in the beginning and 155.0MB in the end (delta: -33.3MB). Peak memory consumption was 18.6MB. Max. memory is 8.0GB. * TraceAbstraction took 836276.33ms. Allocated memory was 181.4MB in the beginning and 6.1GB in the end (delta: 5.9GB). Free memory was 154.5MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 140 PlacesBefore, 42 PlacesAfterwards, 143 TransitionsBefore, 40 TransitionsAfterwards, 6382 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 30 TrivialYvCompositions, 76 ConcurrentYvCompositions, 5 ChoiceCompositions, 114 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5670, independent: 5585, independent conditional: 5585, independent unconditional: 0, dependent: 85, dependent conditional: 85, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5670, independent: 5585, independent conditional: 0, independent unconditional: 5585, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5670, independent: 5585, independent conditional: 0, independent unconditional: 5585, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5670, independent: 5585, independent conditional: 0, independent unconditional: 5585, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4210, independent: 4158, independent conditional: 0, independent unconditional: 4158, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4210, independent: 4143, independent conditional: 0, independent unconditional: 4143, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 106, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5670, independent: 1427, independent conditional: 0, independent unconditional: 1427, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 4210, unknown conditional: 0, unknown unconditional: 4210] , Statistics on independence cache: Total cache size (in pairs): 7673, Positive cache size: 7621, Positive conditional cache size: 0, Positive unconditional cache size: 7621, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 660 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 201, independent: 177, independent conditional: 177, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 201, independent: 177, independent conditional: 2, independent unconditional: 175, dependent: 24, dependent conditional: 1, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 201, independent: 177, independent conditional: 1, independent unconditional: 176, dependent: 24, dependent conditional: 1, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 201, independent: 177, independent conditional: 1, independent unconditional: 176, dependent: 24, dependent conditional: 1, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 178, independent: 158, independent conditional: 1, independent unconditional: 157, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 178, independent: 155, independent conditional: 0, independent unconditional: 155, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, independent: 3, independent conditional: 1, independent unconditional: 3, dependent: 22, dependent conditional: 2, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 201, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 178, unknown conditional: 2, unknown unconditional: 176] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 158, Positive conditional cache size: 1, Positive unconditional cache size: 157, Negative cache size: 20, Negative conditional cache size: 1, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 698 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 91, independent: 68, independent conditional: 68, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 91, independent: 68, independent conditional: 4, independent unconditional: 64, dependent: 23, dependent conditional: 2, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 91, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 91, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 91, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 192, Positive cache size: 168, Positive conditional cache size: 1, Positive unconditional cache size: 167, Negative cache size: 24, Negative conditional cache size: 1, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 60 PlacesBefore, 59 PlacesAfterwards, 65 TransitionsBefore, 64 TransitionsAfterwards, 1108 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 659, independent: 611, independent conditional: 611, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 659, independent: 611, independent conditional: 231, independent unconditional: 380, dependent: 48, dependent conditional: 32, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 659, independent: 611, independent conditional: 108, independent unconditional: 503, dependent: 48, dependent conditional: 24, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 659, independent: 611, independent conditional: 108, independent unconditional: 503, dependent: 48, dependent conditional: 24, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 110, independent: 97, independent conditional: 23, independent unconditional: 74, dependent: 13, dependent conditional: 11, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 110, independent: 97, independent conditional: 0, independent unconditional: 97, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 11, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 9, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 659, independent: 514, independent conditional: 85, independent unconditional: 429, dependent: 35, dependent conditional: 13, dependent unconditional: 22, unknown: 110, unknown conditional: 34, unknown unconditional: 76] , Statistics on independence cache: Total cache size (in pairs): 311, Positive cache size: 274, Positive conditional cache size: 24, Positive unconditional cache size: 250, Negative cache size: 37, Negative conditional cache size: 12, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 131, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 1054 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 252, independent: 226, independent conditional: 226, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 252, independent: 226, independent conditional: 61, independent unconditional: 165, dependent: 26, dependent conditional: 18, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 252, independent: 226, independent conditional: 13, independent unconditional: 213, dependent: 26, dependent conditional: 12, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 252, independent: 226, independent conditional: 13, independent unconditional: 213, dependent: 26, dependent conditional: 12, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 252, independent: 220, independent conditional: 12, independent unconditional: 208, dependent: 22, dependent conditional: 8, dependent unconditional: 14, unknown: 10, unknown conditional: 5, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 321, Positive cache size: 280, Positive conditional cache size: 25, Positive unconditional cache size: 255, Negative cache size: 41, Negative conditional cache size: 16, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 54, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 49 PlacesBefore, 43 PlacesAfterwards, 48 TransitionsBefore, 42 TransitionsAfterwards, 438 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 119, independent: 118, independent conditional: 118, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 119, independent: 118, independent conditional: 38, independent unconditional: 80, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 119, independent: 118, independent conditional: 38, independent unconditional: 80, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 119, independent: 118, independent conditional: 38, independent unconditional: 80, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 17, independent conditional: 15, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 119, independent: 101, independent conditional: 23, independent unconditional: 78, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 15, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 509, Positive cache size: 467, Positive conditional cache size: 41, Positive unconditional cache size: 426, Negative cache size: 42, Negative conditional cache size: 16, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 56 PlacesBefore, 53 PlacesAfterwards, 59 TransitionsBefore, 56 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 38, independent: 38, independent conditional: 15, independent unconditional: 23, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38, independent: 38, independent conditional: 15, independent unconditional: 23, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38, independent: 38, independent conditional: 15, independent unconditional: 23, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, independent: 28, independent conditional: 5, independent unconditional: 23, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 527, Positive cache size: 485, Positive conditional cache size: 51, Positive unconditional cache size: 434, Negative cache size: 42, Negative conditional cache size: 16, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 62 PlacesBefore, 61 PlacesAfterwards, 60 TransitionsBefore, 59 TransitionsAfterwards, 486 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 5, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, independent: 11, independent conditional: 5, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 5, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 532, Positive cache size: 490, Positive conditional cache size: 56, Positive unconditional cache size: 434, Negative cache size: 42, Negative conditional cache size: 16, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 71 PlacesBefore, 70 PlacesAfterwards, 67 TransitionsBefore, 66 TransitionsAfterwards, 540 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 10, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 16, independent conditional: 10, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 10, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 542, Positive cache size: 500, Positive conditional cache size: 66, Positive unconditional cache size: 434, Negative cache size: 42, Negative conditional cache size: 16, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 75 PlacesBefore, 74 PlacesAfterwards, 84 TransitionsBefore, 83 TransitionsAfterwards, 660 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 10, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 16, independent conditional: 10, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 10, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 552, Positive cache size: 510, Positive conditional cache size: 76, Positive unconditional cache size: 434, Negative cache size: 42, Negative conditional cache size: 16, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 99 PlacesBefore, 97 PlacesAfterwards, 116 TransitionsBefore, 114 TransitionsAfterwards, 792 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 575, Positive cache size: 533, Positive conditional cache size: 87, Positive unconditional cache size: 446, Negative cache size: 42, Negative conditional cache size: 16, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 124 PlacesBefore, 119 PlacesAfterwards, 162 TransitionsBefore, 157 TransitionsAfterwards, 1074 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 49, independent: 46, independent conditional: 40, independent unconditional: 6, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 55, independent: 46, independent conditional: 32, independent unconditional: 14, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 55, independent: 46, independent conditional: 32, independent unconditional: 14, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, independent: 20, independent conditional: 18, independent unconditional: 2, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 55, independent: 26, independent conditional: 14, independent unconditional: 12, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 23, unknown conditional: 21, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 609, Positive cache size: 564, Positive conditional cache size: 105, Positive unconditional cache size: 459, Negative cache size: 45, Negative conditional cache size: 19, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 154 PlacesBefore, 151 PlacesAfterwards, 278 TransitionsBefore, 275 TransitionsAfterwards, 1678 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 70, independent conditional: 70, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 72, independent: 70, independent conditional: 70, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 78, independent: 70, independent conditional: 55, independent unconditional: 15, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 78, independent: 70, independent conditional: 55, independent unconditional: 15, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 35, independent: 34, independent conditional: 31, independent unconditional: 3, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 35, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 78, independent: 36, independent conditional: 24, independent unconditional: 12, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 35, unknown conditional: 32, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 768, Positive cache size: 722, Positive conditional cache size: 136, Positive unconditional cache size: 586, Negative cache size: 46, Negative conditional cache size: 20, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 152 PlacesBefore, 152 PlacesAfterwards, 287 TransitionsBefore, 287 TransitionsAfterwards, 1712 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 23, independent: 21, independent conditional: 15, independent unconditional: 6, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 29, independent: 21, independent conditional: 15, independent unconditional: 6, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 29, independent: 21, independent conditional: 15, independent unconditional: 6, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 29, independent: 21, independent conditional: 15, independent unconditional: 6, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 814, Positive cache size: 768, Positive conditional cache size: 136, Positive unconditional cache size: 632, Negative cache size: 46, Negative conditional cache size: 20, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 165 PlacesBefore, 165 PlacesAfterwards, 333 TransitionsBefore, 333 TransitionsAfterwards, 1998 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 38, independent: 36, independent conditional: 6, independent unconditional: 30, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 36, independent conditional: 6, independent unconditional: 30, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 36, independent conditional: 6, independent unconditional: 30, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, independent: 36, independent conditional: 6, independent unconditional: 30, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 835, Positive cache size: 788, Positive conditional cache size: 136, Positive unconditional cache size: 652, Negative cache size: 47, Negative conditional cache size: 21, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 167 PlacesBefore, 166 PlacesAfterwards, 307 TransitionsBefore, 306 TransitionsAfterwards, 1880 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 29, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 37, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 37, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 37, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 849, Positive cache size: 802, Positive conditional cache size: 148, Positive unconditional cache size: 654, Negative cache size: 47, Negative conditional cache size: 21, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 198 PlacesBefore, 193 PlacesAfterwards, 375 TransitionsBefore, 370 TransitionsAfterwards, 2234 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, independent: 81, independent conditional: 81, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 84, independent: 81, independent conditional: 81, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 99, independent: 81, independent conditional: 76, independent unconditional: 5, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 99, independent: 81, independent conditional: 76, independent unconditional: 5, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 99, independent: 63, independent conditional: 58, independent unconditional: 5, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 982, Positive cache size: 934, Positive conditional cache size: 166, Positive unconditional cache size: 768, Negative cache size: 48, Negative conditional cache size: 22, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 215 PlacesBefore, 214 PlacesAfterwards, 447 TransitionsBefore, 446 TransitionsAfterwards, 2630 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 58, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 70, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 70, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 70, independent: 51, independent conditional: 51, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1091, Positive cache size: 1042, Positive conditional cache size: 176, Positive unconditional cache size: 866, Negative cache size: 49, Negative conditional cache size: 23, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 233 PlacesBefore, 231 PlacesAfterwards, 539 TransitionsBefore, 537 TransitionsAfterwards, 3140 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1106, Positive cache size: 1056, Positive conditional cache size: 186, Positive unconditional cache size: 870, Negative cache size: 50, Negative conditional cache size: 24, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 284 PlacesBefore, 283 PlacesAfterwards, 816 TransitionsBefore, 815 TransitionsAfterwards, 4516 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48, independent: 46, independent conditional: 22, independent unconditional: 24, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 64, independent: 46, independent conditional: 22, independent unconditional: 24, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64, independent: 46, independent conditional: 22, independent unconditional: 24, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 64, independent: 37, independent conditional: 13, independent unconditional: 24, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1148, Positive cache size: 1097, Positive conditional cache size: 200, Positive unconditional cache size: 897, Negative cache size: 51, Negative conditional cache size: 25, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 299 PlacesBefore, 297 PlacesAfterwards, 976 TransitionsBefore, 974 TransitionsAfterwards, 5488 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, independent: 55, independent conditional: 55, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 57, independent: 55, independent conditional: 31, independent unconditional: 24, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 75, independent: 55, independent conditional: 31, independent unconditional: 24, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 75, independent: 55, independent conditional: 31, independent unconditional: 24, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 75, independent: 50, independent conditional: 26, independent unconditional: 24, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1186, Positive cache size: 1134, Positive conditional cache size: 205, Positive unconditional cache size: 929, Negative cache size: 52, Negative conditional cache size: 26, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 331 PlacesBefore, 329 PlacesAfterwards, 1224 TransitionsBefore, 1222 TransitionsAfterwards, 6748 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 71, independent: 69, independent conditional: 69, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 71, independent: 69, independent conditional: 69, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 91, independent: 69, independent conditional: 69, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 91, independent: 69, independent conditional: 69, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 91, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1196, Positive cache size: 1143, Positive conditional cache size: 210, Positive unconditional cache size: 933, Negative cache size: 53, Negative conditional cache size: 27, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 375 PlacesBefore, 373 PlacesAfterwards, 1609 TransitionsBefore, 1607 TransitionsAfterwards, 8804 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 77, independent: 75, independent conditional: 75, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 77, independent: 75, independent conditional: 75, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 99, independent: 75, independent conditional: 75, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 99, independent: 75, independent conditional: 75, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 99, independent: 75, independent conditional: 75, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1227, Positive cache size: 1173, Positive conditional cache size: 210, Positive unconditional cache size: 963, Negative cache size: 54, Negative conditional cache size: 28, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 408 PlacesBefore, 406 PlacesAfterwards, 1771 TransitionsBefore, 1769 TransitionsAfterwards, 9564 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 42, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1241, Positive cache size: 1186, Positive conditional cache size: 223, Positive unconditional cache size: 963, Negative cache size: 55, Negative conditional cache size: 29, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 12 - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1023]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 238 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 836.1s, OverallIterations: 24, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 721.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 454 mSolverCounterUnknown, 6365 SdHoareTripleChecker+Valid, 568.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6365 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 561.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 875 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2653 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32834 IncrementalHoareTripleChecker+Invalid, 36817 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2653 mSolverCounterUnsat, 1 mSDtfsCounter, 32834 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1156 GetRequests, 454 SyntacticMatches, 43 SemanticMatches, 659 ConstructedPredicates, 5 IntricatePredicates, 2 DeprecatedPredicates, 6555 ImplicationChecksByTransitivity, 74.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63412occurred in iteration=23, InterpolantAutomatonStates: 385, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 52.6s InterpolantComputationTime, 725 NumberOfCodeBlocks, 720 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 984 ConstructedInterpolants, 46 QuantifiedInterpolants, 19078 SizeOfPredicates, 427 NumberOfNonLiveVariables, 5209 ConjunctsInSsa, 1040 ConjunctsInUnsatCore, 58 InterpolantComputations, 8 PerfectInterpolantSequences, 88/477 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown